Recent Theoretical Advances in Non-Convex Optimization

Authors

Marina Danilova, V. A. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences
Pavel Dvurechensky, Weierstrass Institute for Applied Analysis and Stochastics
Alexander Gasnikov, Moscow Institute of Physics and Technology
Eduard Gorbunov, Moscow Institute of Physics and Technology
Sergey Guminov, HSE University
Dmitry Kamzolov, Moscow Institute of Physics and Technology & Mohamed bin Zayed University of Artificial IntelligenceFollow
Innokentiy Shibaev, Moscow Institute of Physics and Technology

Document Type

Book

Publication Title

High-Dimensional Optimization and Probability

Abstract

Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical results on global performance guarantees of optimization algorithms for non-convex optimization. We start with classical arguments showing that general non-convex problems could not be solved efficiently in a reasonable time. Then we give a list of problems that can be solved efficiently to find the global minimizer by exploiting the structure of the problem as much as it is possible. Another way to deal with non-convexity is to relax the goal from finding the global minimum to finding a stationary point or a local minimum. For this setting, we first present known results for the convergence rates of deterministic first-order methods, which are then followed by a general theoretical analysis of optimal stochastic and randomized gradient schemes, and an overview of the stochastic first-order methods. After that, we discuss quite general classes of non-convex problems, such as minimization of α-weakly quasi-convex functions and functions that satisfy Polyak–Łojasiewicz condition, which still allow obtaining theoretical convergence guarantees of first-order methods. Then we consider higher-order and zeroth-order/derivative-free methods and their convergence rates for non-convex optimization problems.

First Page

79

Last Page

163

DOI

10.1007/978-3-031-00832-0_3

Publication Date

4-5-2022

Keywords

Transfer Of Learning, Coordinate Descent, Convex Minimization

Comments

IR conditions: non-described

Recommended Citation

Danilova, M., et al, "Recent Theoretical Advances in Non-Convex Optimization", in High-Dimensional Optimization and Probability, Cham: Springer, 2022, ch. 3, pp. 79-163.