mlsanityData to 14 Oct 2026

On Same-Sample and Independent-Sample Stochastic Extragradient for Monotone Variational Inequalities

arXiv 2608.06182 ↗First posted 6 Aug 2026math.OC cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 49 of its 79 references that are in the map. First posted on arXiv 6 Aug 2026.

Builds on

49 of 79 references.

References · 49

  1. 2013Optimization, Learning, and Games with Predictable Sequencescited by 188
  2. 2018A Variational Inequality Perspective on Generative Adversarial Networkscited by 144
  3. 2019A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approachcited by 143
  4. 2018Optimistic mirror descent in saddle-point problems: Going the extra (gradient) milecited by 136
  5. 2017The Numerics of GANscited by 105
  6. 2019On the convergence of single-call stochastic extra-gradient methodscited by 89
  7. 2021Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with O(1/k2) Rate on Squared Gradient Normcited by 73
  8. 2018Interaction Matters: A Note on Non-asymptotic Local Convergence of Generative Adversarial Networkscited by 68
  9. 2019Reducing Noise in GAN Training with Variance Reduced Extragradientcited by 62
  10. 2021Fast Extra Gradient Methods for Smooth Structured Nonconvex-Nonconcave Minimax Problemscited by 62
  11. 2020Halpern Iteration for Near-Optimal and Parameter-Free Monotone Inclusion and Strong Solutions to Variational Inequalitiescited by 61
  12. 2018Negative Momentum for Improved Game Dynamicscited by 60
37 more
  1. 2020Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problemscited by 60
  2. 2020Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scalingcited by 49
  3. 2020Tight last-iterate convergence rates for no-regret learning in multi-player gamescited by 49
  4. 2021Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivitycited by 43
  5. 2021Extragradient Method: O(1/K) Last-Iterate Convergence for Monotone Variational Inequalities and Connections With Cocoercivitycited by 39
  6. 2018Golden Ratio Algorithms for Variational Inequalitiescited by 38
  7. 2022Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methodscited by 37
  8. 2019Revisiting Stochastic Extragradientcited by 35
  9. 2022Last-Iterate Convergence of Optimistic Gradient Method for Monotone Variational Inequalitiescited by 33
  10. 2020Stochastic Hamiltonian Gradient Methods for Smooth Gamescited by 32
  11. 2022Accelerated Single-Call Methods for Constrained Min-Max Optimizationcited by 32
  12. 2021Stochastic Extragradient: General Analysis and Improved Ratescited by 31
  13. 2022Solving Nonconvex-Nonconcave Min-Max Problems exhibiting Weak Minty Solutionscited by 27
  14. 2019A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noisecited by 26
  15. 2021Decentralized Local Stochastic Extra-Gradient for Variational Inequalitiescited by 25
  16. 2021Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusionscited by 21
  17. 2022From Halpern's Fixed-Point Iterations to Nesterov's Accelerated Interpretations for Root-Finding Problemscited by 20
  18. 2014Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variantscited by 19
  19. 2022Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusionscited by 19
  20. 2025Towards Weaker Variance Assumptions for Stochastic Optimizationcited by 17
  21. 2024Dealing with unbounded gradients in stochastic saddle-point optimizationcited by 16
  22. 2017Stabilizing Adversarial Nets With Prediction Methodscited by 14
  23. 2023Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditionscited by 14
  24. 2022Beyond the Golden Ratio for Variational Inequality Algorithmscited by 12
  25. 2025Negative Stepsizes Make Gradient-Descent-Ascent Convergecited by 11
  26. 2022Fast Optimistic Gradient Descent Ascent (OGDA) method in continuous and discrete timecited by 10
  27. 2022Accelerated Minimax Algorithms Flock Togethercited by 9
  28. 2024Fundamental Benefit of Alternating Updates in Minimax Optimizationcited by 9
  29. 2024Optimal Acceleration for Minimax and Fixed-Point Problems is Not Uniquecited by 7
  30. 2016On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemescited by 5
  31. 2026Solving Stochastic Variational Inequalities without the Bounded Variance Assumptioncited by 5
  32. 2026A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithmscited by 5
  33. 2024Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-max Optimizationcited by 4
  34. 2023A Fast Optimistic Method for Monotone Variational Inequalitiescited by 3
  35. 2025Extragradient Method for (L0, L1)-Lipschitz Root-finding Problemscited by 3
  36. 2025H-invariance theory: A complete characterization of minimax optimal fixed-point algorithmscited by 3
  37. 2024Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvementscited by 2

Built on by

Not cited yet.