  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.
