Cover Image

On the Convergence of Min-Max Langevin Dynamics and Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cai, Yang, Mitra, Siddharth, Wang, Xiuyuan, Wibisono, Andre
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
by: Cai, Yang, et al.
Published: (2024)

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
by: Cai, Yang, et al.
Published: (2025)

Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation
by: Cai, Yang, et al.
Published: (2023)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
by: Cai, Yang, et al.
Published: (2025)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
by: Wang, Guillaume, et al.
Published: (2022)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities
by: Emmanouilidis, Konstantinos, et al.
Published: (2024)

Last-Iterate Guarantees for Learning in Co-coercive Games
by: Chandak, Siddharth, et al.
Published: (2026)

Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach
by: Qiu, Shuang, et al.
Published: (2022)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
by: Cai, Yang, et al.
Published: (2024)

A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
by: Anagnostides, Ioannis, et al.
Published: (2025)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
by: Soleymani, Ashkan, et al.
Published: (2025)

MALADY: Multiclass Active Learning with Auction Dynamics on Graphs
by: Bhusal, Gokul, et al.
Published: (2024)

Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment
by: Graf, Lukas, et al.
Published: (2021)

Convergence Analysis of Gradient-Based Learning with Non-Uniform Learning Rates in Non-Cooperative Multi-Agent Settings
by: Chasnov, Benjamin, et al.
Published: (2019)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
by: Faizal, Fathima Zarin, et al.
Published: (2024)

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
by: Sakos, Iosif, et al.
Published: (2023)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
by: Yang, Zongjun, et al.
Published: (2026)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
by: Nayak, Anupam, et al.
Published: (2025)

Linear Convergence in Games with Delayed Feedback via Extra Prediction
by: Fujimoto, Yuma, et al.
Published: (2026)

Outcome-Driven Dynamic Refugee Assignment with Allocation Balancing
by: Bansak, Kirk, et al.
Published: (2020)

A Symplectic Analysis of Alternating Mirror Descent
by: Katona, Jonas, et al.
Published: (2024)

Dynamic system optimal traffic assignment with atomic users: Convergence and stability
by: Satsukawa, Koki, et al.
Published: (2021)

A pragmatic policy learning approach to account for users' fatigue in repeated auctions
by: Heymann, Benjamin, et al.
Published: (2024)

The Oracle Complexity of Simplex-based Matrix Games
by: Kornowski, Guy, et al.
Published: (2024)

Reinforcement Learning for Finite Space Mean-Field Type Games
by: Shao, Kai, et al.
Published: (2024)

Mistake, Manipulation and Margin Guarantees in Online Strategic Classification
by: Shen, Lingqing, et al.
Published: (2024)

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations
by: Huang, Han, et al.
Published: (2024)

A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents
by: Laurière, Mathieu, et al.
Published: (2024)

Exploiting Approximate Symmetry for Efficient Multi-Agent Reinforcement Learning
by: Yardim, Batuhan, et al.
Published: (2024)

Tracking solutions of time-varying variational inequalities
by: Hadiji, Hédi, et al.
Published: (2024)

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
by: Yongacoglu, Bora, et al.
Published: (2021)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
by: Hu, Ruimeng, et al.
Published: (2025)

Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
by: Simchi-Levi, David, et al.
Published: (2019)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
by: Soleymani, Ashkan, et al.
Published: (2025)

Expected Variational Inequalities
by: Zhang, Brian Hu, et al.
Published: (2025)

Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities
by: Dvurechensky, Pavel, et al.
Published: (2026)