Improved Differentially Private and Lazy Online Convex Optimization

Asymptotic evaluation of certain markov process expectations for large time, i

M. D. Donsker and S. S. Varadhan · 1975

Earlier work this paper cites.

Concentration of measure and logarithmic sobolev inequalities

M. Ledoux · 1999

Earlier work this paper cites.

On sequential strategies for loss functions with memory

N. Merhav, E. Ordentlich, G. Seroussi, and M. J. Weinberger · 2002

Earlier work this paper cites.

Efficient algorithms for online decision problems

A. Kalai and S. Vempala · 2005

Earlier work this paper cites.

Diffusions hypercontractives

D. Bakry and M. Émery · 2006

Earlier work this paper cites.

Regret minimization for online buffering problems using the weighted majority algorithm

S. Geulen, B. Vöcking, and M. Winkler · 2010

Earlier work this paper cites.

Differentially private online learning

P. Jain, P. Kothari, and A. Thakurta · 2012

Earlier work this paper cites.

(nearly) optimal algorithms for private online learning in full-information and bandit settings

A. Smith and A. Thakurta · 2013

Earlier work this paper cites.

The algorithmic foundations of differential privacy

C. Dwork and A. Roth · 2014

Cited alongside, same era.

Online learning for adversaries with memory: price of past mistakes

O. Anava, E. Hazan, and S. Mannor · 2015

Cited alongside, same era.

Introduction to online convex optimization

E. Hazan · 2016

Cited alongside, same era.

The price of differential privacy for online learning

N. Agarwal and K. Singh · 2017

Cited alongside, same era.

Markov chains and mixing times , volume 107

D. A. Levin and Y. Peres · 2017

Cited alongside, same era.

Online learning over a finite action set with limited switching

J. M. Altschuler and K. Talwar · 2020

Cited alongside, same era.

Lazy oco: Online convex optimization on a switching budget

U. Sherman and T. Koren · 2021

Later among the works it cites.

Private convex optimization via exponential mechanism

S. Gopi, Y. T. Lee, and D. Liu · 2022

Later among the works it cites.

Fully adaptive composition in differential privacy

Original

J. Whitehouse, A. Ramdas, R. Rogers, and Z. S. Wu · 2022

Later among the works it cites.

Differentially private and lazy online convex optimization

N. Agarwal, S. Kale, K. Singh, and A. Thakurta · 2023

Closest in time.

Private online prediction from experts: Separations and faster rates

H. Asi, V. Feldman, T. Koren, and K. Talwar · 2023

Closest in time.

Universality of langevin diffusion for private optimization, with applications to sampling from rashomon sets