1. H. H. Rosenbrock, “An automatic method for finding the greatest or least value of a function,” Comput. J. 3 (3), 175–184 (1960).
2. K. Choromanski et al., “Structured evolution with compact architectures for scalable policy optimization,” International Conference on Machine Learning (PMLR, 2018), pp. 970–978.
3. H. Mania, A. Guy, and B. Recht, “Simple random search of static linear policies is competitive for reinforcement learning,” Advances in Neural Information Processing Systems (2018), Vol. 31.
4. K. K. Patel et al., “Distributed online and bandit convex optimization,” OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop) (2022).
5. A. Lobanov et al., “Gradient-free federated learning methods with l
1 and l
2-randomization for non-smooth convex stochastic optimization problems,” arXiv preprint arXiv:2211.10783 (2022).