MAEG: Moving-Anchor Adaptive-Adaptive Accelerated Extra Gradient Method
Abstract
We propose the moving-anchor adaptive-adaptive accelerated extragradient method (MAEG) for smooth convex-concave minimax problems, which combines extragradient updates with a moving anchor to achieve accelerated convergence while adapting to both the smoothness constant and the strong convexity-concavity parameter. MAEG uses no line search and no restarts, and its step size and anchor coefficient are adaptively updated. For a smooth convex-concave objective function, MAEG achieves an accelerated last-iterate convergence rate, similar to the extra anchored gradient (EAG) method. When the objective function is additionally -strongly convex-concave, MAEG has a linear last-iterate convergence rate. Numerical experiments in several diverse settings show that MAEG matches or beats prior methods, and significantly outperforms the baselines when the local smoothness constant and strong convexity-concavity parameter are more favorable than their global counterparts.
est. 32% chance this paper gets accepted at ICLR 2027.
What do you think this paper will get?
All positions stay anonymous.