30 citations · 133 across the 29 of their papers we have counts for
4 papers · 1 filter
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
Peng Zhao, Yu-Jie Zhang, Lijun Zhang +1
We investigate online convex optimization in non-stationary environments and choose dynamic regret as the performance measure, defined as the difference between cumulative loss inc…
Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits
Youming Tao, Yulian Wu, Peng Zhao +1
In this paper we investigate the problem of stochastic multi-armed bandits (MAB) in the (local) differential privacy (DP/LDP) model. Unlike previous results that assume bounded/sub…
A Simple Approach for Non-stationary Linear Bandits
Peng Zhao, Lijun Zhang, Yuan Jiang +1
This paper investigates the problem of non-stationary linear bandits, where the unknown regression parameter is evolving over time. Existing studies develop various algorithms and…
Non-stationary Online Learning with Memory and Non-stochastic Control
Peng Zhao, Yu-Hu Yan, Yu-Xiang Wang +1
We study the problem of Online Convex Optimization (OCO) with memory, which allows loss functions to depend on past decisions and thus captures temporal effects of learning problem…