Skip to content
Preprint

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

Aug 2026 · 0 citations · 79 references
Mathematics Computer Science

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.

View source

Similar papers

Preprint Aug 2026

A proximal subgradient method for nonconvex stochastic optimization under the Kurdyka-{\L}ojasiewicz condition

This work introduces a proximal stochastic subgradient method for minimizing the sum of an expected cost, whose integrand is potentially nonsmooth and nonconvex, and a lower semicontinuous, prox-bounded function. We target a broad class of integrands obeying a nonsmooth, localized variant of the descent lemma in the de...

Felipe Atenas, Alejandro Jofré, Pedro Pérez-Aros et al. · 0 citations
Preprint Jul 2026

Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order

We study Langevin-based methods for non-convex optimization under smoothness and dissipativity assumptions. Our focus is on obtaining non-asymptotic bounds for the expected excess risk rather than sampling guarantees for the full target distribution. The key ingredient of our analysis is a direct passage from relative...

E. Naldi, Marco Rando, Lorenzo Rosasco et al. · 0 citations
Preprint Jul 2026

Improved Convergence Rates for Stochastic Multi-Gradient Descent which Close the Gap: A Proof by AI

A new convergence rate for SMG in terms of the squared Pareto-stationarity (PS) measure is established, to exploit the Lipschitz continuity of the PS measure, defined by the norm of the multi-gradient descent algorithm (MGDA) direction, rather than the $(1/2)-H\"older continuity of the MGDA direction.

Li-Sha Chen · 0 citations
Preprint Sep 2026

Projected Subgradient Methods for a Class of Nonsmooth and Nonconvex Optimization Problems

We investigate the optimization problem of minimizing a nonsmooth function that satisfies a nonsmooth version of the descent lemma over a nonempty and closed but not necessarily convex set. The objective function belongs to the class of upper-$\mathcal{C}^2$ functions, whereas the constraints may promote a sparse or lo...

Christian Kanzow, Jannis Krüger, Leo Lehmann · 0 citations
Preprint Sep 2026

An Adaptive Projected-Gradient Algorithm for Sample-Average Approximations of Stochastic Multi-Objective Optimization

A line-search-free and function-value-free adaptive projected-gradient algorithm for the sample-average approximation (SAA) problem that transfers vanishing SAA residuals to Pareto stationarity for the population problem, while an additional concentration argument gives a finite-sample residual bound on compact sets.

Yi-Yang Li, Lei Wang, Xiao-Jun Chen · 0 citations
Jul 2026

Online Optimization of Difference-of-Convex Compositions with Smooth Mappings

This work proposes a time-smoothed proximal linear algorithm and a local-regret measure based on a proximal residual mapping that is a proper stationarity measure for the original problem: its fixed-point condition implies first-order stationarity.

Jingwei Ji, Jong-Shi Pang, Renyuan Xu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.