activity
20122023
most citedEnhancing the Locality and Breaking the Memory Bottleneck of Transformer on Time Series Forecasting

1.1k citations · 2.4k across the 69 of their papers we have counts for

collaborators

71 papers

cs.LG2023★ 5 cited

Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation

Jiachen T. Wang, Yuqing Zhu, Yu-Xiang Wang +2

Data valuation aims to quantify the usefulness of individual data sources in training machine learning (ML) models, and is a critical aspect of data-centric ML research. However, d…

cs.LG2023★ 1 cited

Nonparametric Classification on Low Dimensional Manifolds using Overparameterized Convolutional Residual Networks

Zixuan Zhang, Kaiqi Zhang, Minshuo Chen +4

Convolutional residual neural networks (ConvResNets), though overparameterized, can achieve remarkable prediction performance in practice, which cannot be well explained by convent…

cs.CR2023★ 9 cited

Invisible Image Watermarks Are Provably Removable Using Generative AI

Xuandong Zhao, Kexun Zhang, Zihao Su +6

Invisible watermarks safeguard images' copyrights by embedding hidden messages only detectable by owners. They also prevent people from misusing images, especially those generated…

cs.LG2023

Improved Differentially Private Regression via Gradient Boosting

Shuai Tang, Sergul Aydore, Michael Kearns +5

We revisit the problem of differentially private squared error linear regression. We observe that existing state-of-the-art methods are sensitive to the choice of hyperparameters -…

cs.LG2022★ 1 cited

Generalized PTR: User-Friendly Recipes for Data-Adaptive Algorithms with Differential Privacy

Rachel Redberg, Yuqing Zhu, Yu-Xiang Wang

The ''Propose-Test-Release'' (PTR) framework is a classic recipe for designing differentially private (DP) algorithms that are data-adaptive, i.e. those that add less noise when th…

cs.LG2022

Global Optimization with Parametric Function Approximation

Chong Liu, Yu-Xiang Wang

We consider the problem of global optimization with noisy zeroth order oracles - a well-motivated problem useful for various applications ranging from hyper-parameter tuning for de…

cs.LG2022★ 5 cited

Differentially Private Optimization on Large Model at Small Cost

Zhiqi Bu, Yu-Xiang Wang, Sheng Zha +1

Differentially private (DP) optimization is the standard paradigm to learn large neural networks that are accurate and privacy-preserving. The computational cost for DP deep learni…

cs.LG2022★ 7 cited

Differentially Private Bias-Term Fine-tuning of Foundation Models

Zhiqi Bu, Yu-Xiang Wang, Sheng Zha +1

We study the problem of differentially private (DP) fine-tuning of large pre-trained models -- a recent privacy-preserving approach suitable for solving downstream tasks with sensi…

cs.CL2022

Provably Confidential Language Modelling

Xuandong Zhao, Lei Li, Yu-Xiang Wang

Large language models are shown to memorize privacy information such as social security numbers in training data. Given the sheer scale of the training corpus, it is challenging to…

cs.LG2022★ 3 cited

Why Quantization Improves Generalization: NTK of Binary Weight Neural Networks

Kaiqi Zhang, Ming Yin, Yu-Xiang Wang

Quantized neural networks have drawn a lot of attention as they reduce the space and computational complexity during the inference. Moreover, there has been folklore that quantizat…

cs.LG2022★ 16 cited

Automatic Clipping: Differentially Private Deep Learning Made Easier and Stronger

Zhiqi Bu, Yu-Xiang Wang, Sheng Zha +1

Per-example gradient clipping is a key algorithmic step that enables practical differential private (DP) training for deep learning models. The choice of clipping threshold R, howe…

cs.DS2022★ 11 cited

Differentially Private Linear Sketches: Efficient Implementations and Applications

Fuheng Zhao, Dan Qiao, Rachel Redberg +3

Linear sketches have been widely adopted to process fast data streams, and they can be used to accurately answer frequency estimation, approximate top K items, and summarize data d…

cs.LG2022

Second Order Path Variationals in Non-Stationary Online Learning

Dheeraj Baby, Yu-Xiang Wang

We consider the problem of universal dynamic regret minimization under exp-concave and smooth losses. We show that appropriately designed Strongly Adaptive algorithms achieve a dyn…

cs.LG2022★ 3 cited

Deep Learning meets Nonparametric Regression: Are Weight-Decayed DNNs Locally Adaptive?

Kaiqi Zhang, Yu-Xiang Wang

We study the theory of neural network (NN) from the lens of classical nonparametric regression problems with a focus on NN's ability to adaptively estimate functions with heterogen…

cs.LG2022

Towards Differential Relational Privacy and its use in Question Answering

Simone Bombari, Alessandro Achille, Zijian Wang +6

Memorization of the relation between entities in a dataset can lead to privacy issues when using a trained model for question answering. We introduce Relational Memorization (RM) t…

cs.LG2022★ 3 cited

Adaptive Private-K-Selection with Adaptive K and Application to Multi-label PATE

Yuqing Zhu, Yu-Xiang Wang

We provide an end-to-end Renyi DP based-framework for differentially private top- selection. Unlike previous approaches, which require a data-independent choice on , we propo…

cs.CV2022

Mixed Differential Privacy in Computer Vision

Aditya Golatkar, Alessandro Achille, Yu-Xiang Wang +3

We introduce AdaMix, an adaptive differentially private algorithm for training deep neural network classifiers using both private and public image data. While pre-training language…

cs.LG2022★ 3 cited

Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism

Ming Yin, Yaqi Duan, Mengdi Wang +1

Offline reinforcement learning, which seeks to utilize offline/historical data to optimize sequential decision-making strategies, has gained surging prominence in recent studies. D…

cs.LG2022★ 3 cited

Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost

Dan Qiao, Ming Yin, Ming Min +1

We study the problem of reinforcement learning (RL) with low (policy) switching cost - a problem well-motivated by real-life RL applications in which deployments of new policies ar…

cs.LG2022★ 4 cited

Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond

Dheeraj Baby, Yu-Xiang Wang

We study the framework of universal dynamic regret minimization with strongly convex losses. We answer an open problem in Baby and Wang 2021 by showing that in a proper learning se…

cs.LG2022★ 5 cited

Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise

Jianyu Xu, Yu-Xiang Wang

In feature-based dynamic pricing, a seller sets appropriate prices for a sequence of products (described by feature vectors) on the fly by learning from the binary outcomes of prev…

stat.ML2021

Multivariate Trend Filtering for Lattice Data

Veeranjaneyulu Sadhanala, Yu-Xiang Wang, Addison J. Hu +1

We study a multivariate version of trend filtering, called Kronecker trend filtering or KTF, for the case in which the design points form a lattice in dimensions. KTF is a natu…

cs.CR2021★ 3 cited

Privately Publishable Per-instance Privacy

Rachel Redberg, Yu-Xiang Wang

We consider how to privately share the personalized privacy losses incurred by objective perturbation, using per-instance differential privacy (pDP). Standard differential privacy…

cs.LG2021★ 4 cited

Towards Instance-Optimal Offline Reinforcement Learning with Pessimism

Ming Yin, Yu-Xiang Wang

We study the offline reinforcement learning (offline RL) problem, where the goal is to learn a reward-maximizing policy in an unknown Markov Decision Process (MDP) using the data c…