Fetching the paper…
Reading the bibliography…
We consider the fundamental problem of prediction with expert advice where the experts are "optimizable": there is a black-box optimization oracle that can be used to compute, in constant time, the leading expert in retrospect at any point in time.
Iterative solution of games by fictitious play
G. W. Brown · 1951
Earlier work this paper cites.
An iterative method of solving a game
J. Robinson · 1951
Earlier work this paper cites.
Approximation to bayes risk in repeated play
J. Hannan · 1957
Earlier work this paper cites.
Minimization algorithms and random walk on the d d -cube
D. Aldous · 1983
Earlier work this paper cites.
Separating distribution-free and mistake-bound learning models over the boolean domain
A. Blum · 1990
Earlier work this paper cites.
The weighted majority algorithm
N. Littlestone and M. K. Warmuth · 1994
Earlier work this paper cites.
A sublinear-time randomized approximation algorithm for matrix games
M. D. Grigoriadis and L. G. Khachiyan · 1995
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Y. Freund and R. E. Schapire · 1997
Earlier work this paper cites.
Using and combining predictors that specialize
Y. Freund, R. E. Schapire, Y. Singer, and M. K. Warmuth · 1997
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Y. Freund and R. E. Schapire · 1999
Earlier work this paper cites.
A simple adaptive procedure leading to correlated equilibrium
S. Hart and A. Mas-Colell · 2000
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Online geometric optimization in the bandit setting against an adaptive adversary
H. B. McMahan and A. Blum · 2004
Earlier work this paper cites.
Efficient algorithms for online decision problems
A. Kalai and S. Vempala · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Lower bounds for local search by quantum arguments
S. Aaronson · 2006
Cited alongside, same era.
Prediction, Learning, and Games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary
V. Dani and T. P. Hayes · 2006
Cited alongside, same era.
From batch to transductive online learning
S. Kakade and A. T. Kalai · 2006
Cited alongside, same era.
Online variance minimization
M. Warmuth and D. Kuzmin · 2006
Cited alongside, same era.
From external to internal regret
A. Blum and Y. Mansour · 2007
Cited alongside, same era.
Algorithmic Game Theory
N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani · 2007
Near-optimal no-regret algorithms for zero-sum games
C. Daskalakis, A. Deckelbaum, and A. Kim · 2011
Later among the works it cites.
Efficient optimal learning for contextual bandits
M. Dudík, D. Hsu, S. Kale, N. Karampatziakis, J. Langford, L. Reyzin, and T. Zhang · 2011
Later among the works it cites.
Computational Trade-offs in Statistical Learning
A. Agarwal · 2012
Later among the works it cites.
The multiplicative weights update method: a meta-algorithm and applications
S. Arora, E. Hazan, and S. Kale · 2012
Later among the works it cites.
Sublinear optimization for machine learning
K. L. Clarkson, E. Hazan, and D. P. Woodruff · 2012
Later among the works it cites.
Online submodular minimization
E. Hazan and S. Kale · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Online linear optimization and adaptive routing
B. Awerbuch and R. Kleinberg · 2008
Cited alongside, same era.
SVM optimization: Inverse dependence on training set size
S. Shalev-Shwartz and N. Srebro · 2008
Cited alongside, same era.
Online markov decision processes
E. Even-Dar, S. M. Kakade, and Y. Mansour · 2009
Cited alongside, same era.
On the convergence of regret minimization dynamics in concave games
E. Even-dar, Y. Mansour, and U. Nadav · 2009
Cited alongside, same era.
Learning permutations with exponential weights
D. P. Helmbold and M. K. Warmuth · 2009
Cited alongside, same era.
Near-optimal algorithms for online matrix prediction
E. Hazan, S. Kale, and S. Shalev-Shwartz · 2012
Later among the works it cites.
Using more data to speed-up training time
S. Shalev-Shwartz, O. Shamir, and E. Tromer · 2012
Later among the works it cites.
The equivalence of linear programs and zero-sum games
I. Adler · 2013
Later among the works it cites.
On the rate of convergence of fictitious play
F. Brandt, F. Fischer, and P. Harrenstein · 2013
Later among the works it cites.
Regret minimization for branching experts
E. Gofer, N. Cesa-Bianchi, C. Gentile, and Y. Mansour · 2013
Later among the works it cites.
Taming the monster: A fast and simple algorithm for contextual bandits
A. Agarwal, D. Hsu, S. Kale, J. Langford, L. Li, and R. Schapire · 2014
Later among the works it cites.
A counter-example to karlin’s strong conjecture for fictitious play
C. Daskalakis and Q. Pan · 2014
Later among the works it cites.
Introduction to Online Convex Optimization
E. Hazan · 2014
Later among the works it cites.