Fetching the paper…
Reading the bibliography…
We consider the problem of online convex optimization against an arbitrary adversary with bandit feedback, known as bandit convex optimization.
Extremum Problems with Inequalities as Subsidiary Conditions
F. John · 1948
Earlier work this paper cites.
Geometric algorithms and combinatorial optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1993
Earlier work this paper cites.
An elementary introduction to modern convex geometry
Keith Ball · 1997
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire · 2003
Earlier work this paper cites.
Nearly tight bounds for the continuum-armed bandit problem
Robert D Kleinberg · 2004
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham Flaxman, Adam Tauman Kalai, and H. Brendan McMahan · 2005
Earlier work this paper cites.
The price of bandit information for online optimization
Varsha Dani, Thomas P. Hayes, and Sham Kakade · 2007
Earlier work this paper cites.
Competing in the dark: An efficient algorithm for bandit linear optimization
Jacob Abernethy, Elad Hazan, and Alexander Rakhlin · 2008
Earlier work this paper cites.
Online linear optimization and adaptive routing
Baruch Awerbuch and Robert Kleinberg · 2008
Cited alongside, same era.
Introduction to Derivative-Free Optimization
Andrew R Conn, Katya Scheinberg, and Luis N Vicente · 2009
Cited alongside, same era.
Optimal algorithms for online convex optimization with multi-point bandit feedback
Alekh Agarwal, Ofer Dekel, and Lin Xiao · 2010
Cited alongside, same era.
Random walk approach to regret minimization
Hariharan Narayanan and Alexander Rakhlin · 2010
Cited alongside, same era.
Improved regret guarantees for online smooth convex optimization with bandit feedback
Ankan Saha and Ambuj Tewari · 2011
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolo Cesa-Bianchi · 2012
Cited alongside, same era.
Stochastic convex optimization with bandit feedback
Alekh Agarwal, Dean P. Foster, Daniel Hsu, Sham M. Kakade, and Alexander Rakhlin · 2013
Later among the works it cites.
On the complexity of bandit and derivative-free stochastic convex optimization
Ohad Shamir · 2013
Later among the works it cites.
Hard-margin active linear regression
Elad Hazan and Zohar Karnin · 2014
Later among the works it cites.
Bandit convex optimization: Towards tight bounds
Elad Hazan and Kfir Y. Levy · 2014
Later among the works it cites.
Bandit convex optimization: \(\sqrt{T}\) regret in one dimension
Sébastien Bubeck, Ofer Dekel, Tomer Koren, and Yuval Peres · 2015
Later among the works it cites.
Multi-scale exploration of convex functions and bandit convex optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Towards minimax policies for online linear optimization with bandit feedback
Sébastien Bubeck, Nicolò Cesa-Bianchi, and Sham M. Kakade · 2012
Cited alongside, same era.
Consistency of multidimensional convex regression
Eunji Lim and Peter W. Glynn · 2012
Cited alongside, same era.
Counting regions in hyperplane arrangements
Rediet Abebe
Cited in the paper.
Sébastien Bubeck and Ronen Eldan · 2015
Later among the works it cites.
Bandit smooth convex optimization: Improving the bias-variance tradeoff
Ofer Dekel, Ronen Eldan, and Tomer Koren · 2015
Later among the works it cites.
DRAFT: Introduction to online convex optimimization
Elad Hazan · 2015
Later among the works it cites.