On Same-Sample and Independent-Sample Stochastic Extragradient for Monotone Variational Inequalities
TaeHo Yoon, Nicolas Loizou
math.OC, cs.LG
Submitted: 2026-08-06
License: http://creativecommons.org/licenses/by/4.0/
The gist: We study stochastic extragradient (SEG) methods for solving monotone variational inequality problems (VIPs) over a feasible set.
Terminology
Abstract
We study stochastic extragradient (SEG) methods for solving monotone variational inequality problems (VIPs) over a feasible set. Although extragradient is a foundational algorithm for VIPs and its deterministic convergence theory is well developed, its stochastic counterpart remains less understood. Most existing analyses focus on independent-sample SEG (I-SEG) and assume either that the domain is compact or that the variance of the stochastic operator is uniformly bounded. The behavior of same-sample SEG (S-SEG), a natural variant with materially different properties, has received far less attention. In this work, we address these gaps in the literature. We first show that S-SEG is sensitive to samplewise Lipschitz parameters: mean Lipschitzness and bounded variance alone do not ensure convergence, even on a compact set. Then, for possibly unbounded domains, we establish a high-probability restricted-gap convergence for each SEG variant under a relaxed set of assumptions, and show that certain fundamental improvements to these results are impossible in general. Finally, we show that a known asymmetric double step-size selection that guarantees almost sure last-iterate convergence for I-SEG can fail for S-SEG: there exists a stochastic monotone VIP for which S-SEG diverges almost surely even under the modified step-sizes.
Sources
- Solving Stochastic Variational Inequalities without the Bounded Variance Assumption
- Towards Weaker Variance Assumptions for Stochastic Optimization
- Negative Stepsizes Make Gradient-Descent-Ascent Converge
- Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions
- A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
- H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
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
- Beyond Aggregate Drift: Optimal Client-Specific Windows in Federated Learning
- Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets
- Second-Order Optimization with Asynchronous Curvature