Fetching the paper…
Reading the bibliography…
This work studies online zero-order optimization of convex and Lipschitz functions.
A modern introduction to online learning
Orabona, F. (2019) · 1912
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
Nemirovsky, A. S. and Yudin, D. B. (1983) · 1983
Earlier work this paper cites.
Optimal order of accuracy of search algorithms in stochastic optimization
Polyak, T. B. and Tsybakov, A. B. (1990) · 1990
Earlier work this paper cites.
On the volume of the intersection of two L p n L^{n}_{p} balls
Schechtman, G. and Zinn, J. (1990) · 1990
Earlier work this paper cites.
Poincaré’s inequalities and Talagrand’s concentration phenomenon for the exponential distribution
Bobkov, S. and Ledoux, M. (1997) · 1997
Earlier work this paper cites.
A probabilistic approach to the geometry of the Lpn-ball
Barthe, F., Guédon, O., Mendelson, S., and Naor, A. (2005) · 2005
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Flaxman, A. D., Kalai, A. T., and McMahan, H. B. (2005) · 2005
Earlier work this paper cites.
Remarks on non-interacting conservative spin systems: the case of gamma distributions
Barthe, F. and Wolff, P. (2009) · 2009
Earlier work this paper cites.
Weighted Poincaré-type inequalities for Cauchy and other convex measures
Bobkov, S. G. and Ledoux, M. (2009) · 2009
Earlier work this paper cites.
Optimal algorithms for online convex optimization with multi-point bandit feedback
Agarwal, A., Dekel, O., and Xiao, L. (2010) · 2010
Earlier work this paper cites.
Stochastic convex optimization with bandit feedback
Agarwal, A., Foster, D. P., Hsu, D. J., Kakade, S. M., and Rakhlin, A. (2011) · 2011
Earlier work this paper cites.
Random gradient-free minimization of convex functions
Nesterov, Y. (2011) · 2011
Earlier work this paper cites.
Improved regret guarantees for online smooth convex optimization with bandit feedback
Saha, A. and Tewari, A. (2011) · 2011
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Bubeck, S. and Cesa-Bianchi, N. (2012) · 2012
Cited alongside, same era.
Online learning and online convex optimization
Shalev-Shwartz, S. (2012) · 2012
Cited alongside, same era.
Concentration inequalities: A nonasymptotic theory of independence
Boucheron, S., Lugosi, G., and Massart, P. (2013) · 2013
Cited alongside, same era.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
Ghadimi, S. and Lan, G. (2013) · 2013
Cited alongside, same era.
On the complexity of bandit and derivative-free stochastic convex optimization
Shamir, O. (2013) · 2013
Mathematical analysis II
Zorich, V. A. (2016) · 2016
Later among the works it cites.
Kernel-based methods for bandit convex optimization
Bubeck, S., Lee, Y. T., and Eldan, R. (2017) · 2017
Later among the works it cites.
Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case
Gasnikov, A., Krymova, E., Lagunovskaya, A., Usmanova, I., and Fedorenko, F. (2017) · 2017
Later among the works it cites.
Random gradient-free minimization of convex functions
Nesterov, Y. and Spokoiny, V. (2017) · 2017
Later among the works it cites.
An optimal algorithm for bandit and zero-order convex optimization with two-point feedback
Shamir, O. (2017) · 2017
Later among the works it cites.
Measure theory and fine properties of functions
Evans, L. C. and Gariepy, R. F. (2018) · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Escaping the local minima via simulated annealing: Optimization of approximately convex functions
Belloni, A., Liang, T., Narayanan, H., and Rakhlin, A. (2015) · 2015
Cited alongside, same era.
Optimal rates for zero-order convex optimization: The power of two function evaluations
Duchi, J. C., Jordan, M. I., Wainwright, M. J., and Wibisono, A. (2015) · 2015
Cited alongside, same era.
Highly-smooth zero-th order online optimization
Bach, F. and Perchet, V. (2016) · 2016
Cited alongside, same era.
Escaping the local minima via simulated annealing: Optimization of approximately convex functions
Hu, X., Prashanth, L. A., György, A., and Szepesvári, C. (2016) · 2016
Cited alongside, same era.
Scale-free online learning
Orabona, F. and Pál, D. (2016) · 2016
Cited alongside, same era.
Later among the works it cites.
Exploiting higher order smoothness in derivative-free optimization and continuous bandits
Akhavan, A., Pontil, M., and Tsybakov, A. (2020) · 2020
Later among the works it cites.
Distributed zero-order optimization under adversarial noise
Akhavan, A., Pontil, M., and Tsybakov, A. B. (2021) · 2021
Later among the works it cites.
Improved regret for zeroth-order stochastic convex bandits
Lattimore, T. and Gyorgy, A. (2021) · 2021
Later among the works it cites.
Improved exploiting higher order smoothness in derivative-free optimization and continuous bandit
Novitskii, V. and Gasnikov, A. (2021) · 2021
Later among the works it cites.
Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex
Gasnikov, A., Lagunovskaya, A., Usmanova, I., and Fedorenko, F. (2016) · 2034
Closest in time.