Fetching the paper…
Reading the bibliography…
We consider $\beta$-smooth (satisfies the generalized Holder condition with parameter $\beta > 2$) stochastic convex optimization problem with zero-order one-point oracle.
Problemy Peredachi Informatsii 26
Polyak, B.T., Tsybakov, A.B.: Optimal order of accuracy of search algorithms in stochastic optimization · 1990
Earlier work this paper cites.
John Wiley & Sons, Inc., New York, NY, USA (2003)
Spall, J.C.: Introduction to Stochastic Search and Optimization, 1 edn · 2003
Earlier work this paper cites.
Society for Industrial and Applied Mathematics (2009)
Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization · 2009
Earlier work this paper cites.
arXiv preprint arXiv:1411.4218 (2014)
Gasnikov, A., Dvurechensky, P., Nesterov, Y.: Stochastic gradient methods with inexact oracle · 2014
Earlier work this paper cites.
IEEE Transactions on Information Theory 61
Duchi, J.C., Jordan, M.I., Wainwright, M.J., Wibisono, A.: Optimal rates for zero-order convex optimization: The power of two function evaluations · 2015
Earlier work this paper cites.
arXiv preprint arXiv:1502.06259 (2015)
Gasnikov, A., Dvurechensky, P., Kamzolov, D.: Gradient and gradient-free methods for stochastic convex optimization with inexact oracle · 2015
Cited alongside, same era.
In: Conference on Learning Theory, pp. 257–283 (2016)
Bach, F., Perchet, V.: Highly-smooth zero-th order online optimization · 2016
Cited alongside, same era.
In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 72–85 (2017)
Bubeck, S., Lee, Y.T., Eldan, R.: Kernel-based methods for bandit convex optimization · 2017
Cited alongside, same era.
Automation and remote control 78
Gasnikov, A.V., Krymova, E.A., Lagunovskaya, A.A., Usmanova, I.N., Fedorenko, F.A.: Stochastic online optimization. single-point and multi-point non-linear multi-armed bandits. convex and strongly-convex case · 2017
Cited alongside, same era.
The Journal of Machine Learning Research 18
Shamir, O.: An optimal algorithm for bandit and zero-order convex optimization with two-point feedback · 2017
Cited alongside, same era.
Acta Numerica 28
Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods · 2019
Later among the works it cites.
arXiv preprint arXiv:2006.07862 (2020)
Akhavan, A., Pontil, M., Tsybakov, A.B.: Exploiting higher order smoothness in derivative-free optimization and continuous bandits · 2020
Later among the works it cites.
URL https://cutt.ly/bjxQHRY
Novitskii, V.: Zeroth-order algorithms for smooth saddle-point problems (2020) · 2020
Later among the works it cites.
arXiv preprint arXiv:2009.09908 (2020)
Sadiev, A., Beznosikov, A., Dvurechensky, P., Gasnikov, A.: Zeroth-order algorithms for smooth saddle-point problems · 2020
Later among the works it cites.
arXiv preprint arXiv:2010.07378 (2020)
Zhang, Y., Zhou, Y., Ji, K., Zavlanos, M.M.: Boosting one-point derivative-free online optimization via residual feedback · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Later among the works it cites.