Zhize Li
Published 2021-06-17Version 1
In this note, we first recall the nonconvex problem setting and introduce the optimal PAGE algorithm (Li et al., ICML'21). Then we provide a simple and clean convergence analysis of PAGE for achieving optimal convergence rates. Moreover, PAGE and its analysis can be easily adopted and generalized to other works. We hope that this note provides the insights and is helpful for future works.
Stochastic Frank-Wolfe Methods for Nonconvex Optimization
The Number of Steps Needed for Nonconvex Optimization of a Deep Learning Optimizer is a Rational Function of Batch Size
Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization
![QR code for arXiv:2106.09663 [math.OC]](http://oss.arxitics.com/images/favicon.svg)