Fetching the paper…
Reading the bibliography…
We consider stochastic bandit problems with a continuous set of arms and where the expected reward is a continuous and unimodal function of the arm.
Sequential minimax search for a maximum
J. Kiefer · 1953
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
T. Lai and H. Robbins · 1985
Earlier work this paper cites.
The continuum-armed bandit problem
R. Agrawal · 1995
Earlier work this paper cites.
Introduction to Stochastic Search and Optimization
J. C. Spall · 2003
Earlier work this paper cites.
Nearly tight bounds for the continuum-armed bandit problem
R. D. Kleinberg · 2004
Earlier work this paper cites.
The sample complexity of exploration in the multi-armed bandit problem
S. Mannor and J. Tsitsiklis · 2004
Earlier work this paper cites.
Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems
E. Even-Dar, S. Mannor, and Y. Mansour · 2006
Earlier work this paper cites.
Improved rates for the stochastic continuum-armed bandit problem
P. Auer, R. Ortner, and C. Szepesvári · 2007
Earlier work this paper cites.
Online optimization in x-armed bandits
S. Bubeck, R. Munos, G. Stoltz, and C. Szepesvári · 2008
Cited alongside, same era.
Stochastic linear optimization under bandit feedback
V. Dani, T. Hayes, and S. Kakade · 2008
Cited alongside, same era.
Multi-armed bandits in metric spaces
R. Kleinberg, A. Slivkins, and E. Upfal · 2008
Cited alongside, same era.
Regret and convergence bounds for a class of continuum-armed bandit problems
E. W. Cope · 2009
Cited alongside, same era.
Best arm identification in multi-armed bandits
J. Audibert, S. Bubeck, and R. Munos · 2010
Cited alongside, same era.
Lipschitz bandits without the Lipschitz constant
S. Bubeck, G. Stoltz, and J. Yu · 2011
Cited alongside, same era.
Query complexity of derivative-free optimization
K. Jamieson, R. Nowak, and B. Recht · 2012
Later among the works it cites.
Pac subset selection in stochastic multi-armed bandits
S. Kalyanakrishnan, A. Tewari, P. Auer, and P. Stone · 2012
Later among the works it cites.
Stochastic convex optimization with bandit feedback
A. Agarwal, D. Foster, D. Hsu, S. Kakade, and A. Rakhlin · 2013
Later among the works it cites.
On the complexity of bandit and derivative-free stochastic convex optimization
O. Shamir · 2013
Later among the works it cites.
Unimodal bandits: Regret lower bounds and optimal algorithms
R. Combes and A. Proutiere · 2014
Closest in time.
Unimodal bandits: Regret lower bounds and optimal algorithms
R. Combes and A. Proutiere · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Garivier and O. Cappé · 2011
Cited alongside, same era.
Unimodal bandits
J. Yu and S. Mannor · 2011
Cited alongside, same era.
Closest in time.
lil’ ucb : An optimal exploration algorithm for multi-armed bandits
K. Jamieson, M. Malloy, R. Nowak, and S. Bubeck · 2014
Closest in time.
Lipschitz bandits: Regret lower bounds and optimal algorithms
S. Magureanu, R. Combes, and A. Proutiere · 2014
Closest in time.