Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
math.OC, cs.LG, stat.ML
Submitted: 2024-02-07
Updated: 2026-09-26
Terminology
Sources
- Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
- Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
- Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
- An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
- Sublinear Convergence Rates of Extragradient-Type Methods: A Survey on Classical and Recent Developments
- Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
- Accelerated Minimax Algorithms Flock Together
Related papers
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
- Incremental Learning in Mirror Flows
- Online Control via Counterfactual Tracking
- Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
- Petrov-Galerkin operator inference with application to stability-encouraging identification