191 citations · 806 across the 53 of their papers we have counts for
10 papers · 1 filter
A Huber Loss Minimization Approach to Mean Estimation under User-level Differential Privacy
Puning Zhao, Lifeng Lai, Li Shen +3
Privacy protection of users' entire contribution of samples is important in distributed systems. The most effective approach is the two-stage scheme, which finds a small interval f…
Efficient Action Poisoning Attacks on Linear Contextual Bandits
Guanlin Liu, Lifeng Lai
Contextual bandit algorithms have many applicants in a variety of scenarios. In order to develop trustworthy contextual bandit systems, understanding the impacts of various adversa…
Provably Efficient Black-Box Action Poisoning Attacks Against Reinforcement Learning
Guanlin Liu, Lifeng Lai
Due to the broad range of applications of reinforcement learning (RL), understanding the effects of adversarial attacks against RL model is essential for the safe applications of t…
Optimal Stochastic Nonconvex Optimization with Bandit Feedback
Puning Zhao, Lifeng Lai
In this paper, we analyze the continuous armed bandit problems for nonconvex cost functions under certain smoothness and sublevel set assumptions. We first derive an upper bound on…
Projection Robust Wasserstein Barycenters
Minhui Huang, Shiqian Ma, Lifeng Lai
Collecting and aggregating information from several probability measures or histograms is a fundamental task in machine learning. One of the popular solution methods for this task…
A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance
Minhui Huang, Shiqian Ma, Lifeng Lai
The Wasserstein distance has become increasingly important in machine learning and deep learning. Despite its popularity, the Wasserstein distance is hard to approximate because of…