29 citations · 58 across the 4 of their papers we have counts for
4 papers
Online Learning via the Differential Privacy Lens
Jacob Abernethy, Young Hun Jung, Chansoo Lee +2
In this paper, we use differential privacy as a lens to examine online learning in both full and partial information settings. The differential privacy framework is, at heart, less…
Fighting Bandits with a New Kind of Smoothness
Jacob Abernethy, Chansoo Lee, Ambuj Tewari
We define a novel family of algorithms for the adversarial multi-armed bandit problem, and provide a simple analysis technique based on convex smoothing. We prove two main results.…
Spectral Smoothing via Random Matrix Perturbations
Jacob Abernethy, Chansoo Lee, Ambuj Tewari
We consider stochastic smoothing of spectral functions of matrices using perturbations commonly studied in random matrix theory. We show that a spectral function remains spectral w…
Online Linear Optimization via Smoothing
Jacob Abernethy, Chansoo Lee, Abhinav Sinha +1
We present a new optimization-theoretic approach to analyzing Follow-the-Leader style algorithms, particularly in the setting where perturbations are used as a tool for regularizat…