Fetching the paper…
Reading the bibliography…
We consider the closely related problems of bandit convex optimization with two-point feedback, and zero-order stochastic convex optimization with two function evaluations per round.
On the generalization ability of on-line learning algorithms
N. Cesa-Bianchi, A. Conconi, and C. Gentile · 2004
Earlier work this paper cites.
Measure concentration lecture notes
A. Barvinok · 2005
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
A. Flaxman, A. Kalai, and B. McMahan · 2005
Earlier work this paper cites.
The concentration of measure phenomenon
M. Ledoux · 2005
Cited alongside, same era.
Optimal algorithms for online convex optimization with multi-point bandit feedback
A. Agarwal, O. Dekel, and L. Xiao · 2010
Cited alongside, same era.
Random gradient-free minimization of convex functions
Y. Nesterov · 2011
Cited alongside, same era.
Online learning and online convex optimization
S. Shalev-Shwartz · 2012
Later among the works it cites.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
S. Ghadimi and G. Lan · 2013
Later among the works it cites.
Optimal rates for zero-order optimization: the power of two function evaluations
J. Duchi, M. Jordan, M. Wainwright, and A. Wibisono · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…