3 papers
math.OC2026
Faster Stochastic Algorithms for Minimax Optimization under Polyak--Åojasiewicz Conditions
Lesi Chen, Boyuan Yao, Luo Luo
This paper considers stochastic first-order algorithms for minimax optimization under Polyak--Åojasiewicz (PL) conditions. We propose SPIDER-GDA for solving the finite-sum problem…
cs.LG2025
Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
Lesi Chen, Luo Luo
We study the problem of finding a near-stationary point for smooth minimax optimization. The recently proposed extra anchored gradient (EAG) methods achieve the optimal convergence…
math.OC2025
On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
Luo Luo, Yunyan Bai, Lesi Chen +2
We study the decentralized optimization problem , where the local function on the -th a…