29 citations · 58 across the 4 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LG2015★ 19 cited
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.…
cs.LG2015★ 2 cited
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…