Convergence Analysis of the PAGE Stochastic Algorithm for Weakly Convex Finite-Sum Optimization

Abstract

PAGE, a stochastic algorithm introduced by Li et al. [2021], was designed to find stationary points of averages of smooth nonconvex functions. In this work, we study PAGE in the broad framework of τ-weakly convex functions, which provides a continuous interpolation between the general nonconvex L-smooth case (τ = L) and the convex case (τ = 0). We establish new convergence rates for PAGE, showing that its complexity improves as τ decreases.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…