Fetching the paper…
Reading the bibliography…
We consider derivative-free algorithms for stochastic and non-stochastic convex optimization problems that use only function values rather than gradients.
Some aspects of the sequential design of experiments
H. Robbins · 1952
Earlier work this paper cites.
Stochastic optimization problems with nondifferentiable cost functionals
D. P. Bertsekas · 1973
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
T. L. Lai and H. Robbins · 1985
Earlier work this paper cites.
Convex Analysis and Minimization Algorithms I & II
J. Hiriart-Urruty and C. Lemaréchal · 1996
Earlier work this paper cites.
Exponentiated gradient versus gradient descent for linear predictors
J. Kivinen and M. Warmuth · 1997
Earlier work this paper cites.
Assouad, Fano, and Le Cam
B. Yu · 1997
Earlier work this paper cites.
Information-theoretic determination of minimax rates of convergence
Y. Yang and A. Barron · 1999
Earlier work this paper cites.
Metric Characterization of Random Variables and Random Processes , volume 188 of
V. Buldygin and Y. Kozachenko · 2000
Earlier work this paper cites.
The ordered subsets mirror descent optimization method with applications to tomography
A. Ben-Tal, T. Margalit, and A. Nemirovski · 2001
Earlier work this paper cites.
The Concentration of Measure Phenomenon
M. Ledoux · 2001
Earlier work this paper cites.
The robustness of the p-norm algorithms
C. Gentile · 2002
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Cited alongside, same era.
Stochastic Approximation and Recursive Algorithms and Applications
H. J. Kushner and G. Yin · 2003
Cited alongside, same era.
Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
J. C. Spall · 2003
Cited alongside, same era.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Cited alongside, same era.
On the generalization ability of on-line learning algorithms
N. Cesa-Bianchi, A. Conconi, and C. Gentile · 2004
Cited alongside, same era.
Online convex optimization in the bandit setting: gradient descent without a gradient
Introduction to Derivative-Free Optimization , volume 8 of
A. Conn, K. Scheinberg, and L. Vicente · 2009
Later among the works it cites.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Later among the works it cites.
Optimal algorithms for online convex optimization with multi-point bandit feedback
A. Agarwal, O. Dekel, and L. Xiao · 2010
Later among the works it cites.
Dual averaging methods for regularized stochastic learning and online optimization
L. Xiao · 2010
Later among the works it cites.
Random gradient-free minimization of convex functions
Y. Nesterov · 2011
Later among the works it cites.
Information-theoretic lower bounds on the oracle complexity of convex optimization
A. Agarwal, P. L. Bartlett, P. Ravikumar, and M. J. Wainwright · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. D. Flaxman, A. T. Kalai, and H. B. McMahan · 2005
Cited alongside, same era.
Smooth minimization of nonsmooth functions
Y. Nesterov · 2005
Cited alongside, same era.
Learning Structured Prediction Models: A Large Margin Approach
B. Taskar · 2005
Cited alongside, same era.
Elements of Information Theory, Second Edition
T. M. Cover and J. A. Thomas · 2006
Cited alongside, same era.
High-probability regret bounds for bandit online linear optimization
P. L. Bartlett, V. Dani, T. P. Hayes, S. M. Kakade, A. Rakhlin, and A. Tewari · 2008
Cited alongside, same era.
Graphical models, exponential families, and variational inference
M. J. Wainwright and M. I. Jordan · 2008
Cited alongside, same era.
Minimax policies for adversarial and stochastic bandits
J.-Y. Audibert and S. Bubeck · 2009
Cited alongside, same era.
Later among the works it cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
S. Bubeck and N. Cesa-Bianchi · 2012
Later among the works it cites.
Query complexity of derivative-free optimization
K. Jamieson, R. Nowak, and B. Recht · 2012
Later among the works it cites.
Stochastic convex optimization with bandit feedback
A. Agarwal, D. P. Foster, D. Hsu, S. M. Kakade, and A. Rakhlin · 2013
Closest in time.
On the fundamental limits of adaptive sensing
E. Arias-Castro, E. Candés, and M. Davenport · 2013
Closest in time.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
S. Ghadimi and G. Lan · 2013
Closest in time.
On the complexity of bandit and derivative-free stochastic convex optimization
O. Shamir · 2013
Closest in time.