Fetching the paper…
Reading the bibliography…
We consider online learning in an adversarial, non-convex setting under the assumption that the learner has an access to an offline optimization oracle.
Approximation to bayes risk in repeated play
James Hannan · 1957
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions
Nicolò Cesa-Bianchi, Alex Conconi, and Claudio Gentile · 2004
Earlier work this paper cites.
Efficient Algorithms for Online Decision Problems
Adam Kalai and Santosh Vempala · 2004
Earlier work this paper cites.
Prediction, Learning, and Games
Nicolo Cesa-Bianchi and Gabor Lugosi · 2006
Earlier work this paper cites.
Online Learning and Online Convex Optimization
Shai Shalev-Shwartz · 2011
Earlier work this paper cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck, Nicolo Cesa-Bianchi, et al · 2012
Cited alongside, same era.
Online submodular minimization
Elad Hazan and Satyen Kale · 2012
Cited alongside, same era.
Prediction by random-walk perturbation
Luc Devroye, Gábor Lugosi, and Gergely Neu · 2013
Cited alongside, same era.
Follow the leader with dropout perturbations
Tim Van Erven, Wojciech Kotłowski, and Manfred K Warmuth · 2014
Cited alongside, same era.
Following the perturbed leader for online structured learning
Alon Cohen and Tamir Hazan · 2015
Cited alongside, same era.
Introduction to Online Convex Optimization
Elad Hazan · 2016
Cited alongside, same era.
The Computational Power of Optimization in Online Learning
Elad Hazan and Tomer Koren · 2016
Later among the works it cites.
Deep learning games
Dale Schuurmans and Martin A Zinkevich · 2016
Later among the works it cites.
Oracle-efficient online learning and auction design
Miroslav Dudik, Nika Haghtalab, Haipeng Luo, Robert E. Schapire, Vasilis Syrgkanis, and Jennifer Wortman Vaughan · 2017
Later among the works it cites.
Fast Rates for Empirical Risk Minimization of Strict Saddle Problems
Alon Gonen and Shai Shalev-Shwartz · 2017
Later among the works it cites.
Efficient regret minimization in non-convex games
Elad Hazan, Karan Singh, and Cyril Zhang · 2017
Later among the works it cites.
On Convergence and Stability of GANs
Naveen Kodali, Jacob Abernethy, James Hays, and Zsolt Kira · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Later among the works it cites.