Stochastic mirror descent dynamics and their convergence in monotone variational inequalities
Not on the map. Why?
Abstract (arXiv)
We examine a class of stochastic mirror descent dynamics in the context of monotone variational inequalities (including Nash equilibrium and saddle-point problems). The dynamics under study are formulated as a stochastic differential equation driven by a (single-valued) monotone operator and perturbed by a Brownian motion. The system's controllable parameters are two variable weight sequences that respectively pre- and post-multiply the driver of the process. By carefully tuning these parameters, we obtain global convergence in the ergodic sense, and we estimate the average rate of convergence of the process. We also establish a large deviations principle showing that individual trajectories exhibit exponential concentration around this average.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 0; 2023: 0; 2024: 0; 2025: 2.
5 papers.
- 2021Independent Policy Gradient Methods for Competitive Reinforcement Learningcited by 101
- 2021The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalitiescited by 12
- 2021First-Order Methods for Convex Optimizationcited by 4
- 2025The impact of uncertainty on regularized learning in gamescited by 2
- 2025Multi-agent learning under uncertainty: Recurrence vs. concentrationcited by 0
- 2025Multi-agent learning under uncertainty: Recurrence vs. concentration9 Dec 2025
- 2025The impact of uncertainty on regularized learning in games16 Jun 2025
- 2021The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities5 Jul 2021
- 2021Independent Policy Gradient Methods for Competitive Reinforcement Learning11 Jan 2021
- 2021First-Order Methods for Convex Optimization4 Jan 2021