119 citations · 244 across the 26 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021
Best-Case Lower Bounds in Online Learning
Cristóbal Guzmán, Nishant A. Mehta, Ali Mortazavi
Much of the work in online learning focuses on the study of sublinear upper bounds on the regret. In this work, we initiate the study of best-case lower bounds in online convex opt…
cs.LG2021★ 1 cited
Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment
Bingshan Hu, Zhiming Huang, Nishant A. Mehta +1
In this paper, we study differentially private online learning problems in a stochastic environment under both bandit and full information feedback. For differentially private stoc…