{"total":58,"rows":[{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"area":null},{"id":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47,"area":null},{"id":"2107.00052","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","created":"2021-06-30","cited_by_count":43,"area":null},{"id":"2110.04261","title":"Extragradient Method: $O(1/K)$ Last-Iterate Convergence for Monotone Variational Inequalities and Connections With Cocoercivity","created":"2021-10-08","cited_by_count":39,"area":null},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36,"area":null},{"id":"2102.09468","title":"Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization","created":"2021-02-18","cited_by_count":31,"area":null},{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31,"area":null},{"id":"2206.05248","title":"Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion","created":"2022-06-10","cited_by_count":20,"area":null},{"id":"2203.09436","title":"Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions","created":"2022-03-17","cited_by_count":19,"area":null},{"id":"2204.09228","title":"Tight Last-Iterate Convergence of the Extragradient and the Optimistic Gradient Descent-Ascent Algorithm for Constrained Monotone Variational Inequalities","created":"2022-04-20","cited_by_count":19,"area":null},{"id":"2107.00464","title":"On the Convergence of Stochastic Extragradient for Bilinear Games using Restarted Iteration Averaging","created":"2021-06-30","cited_by_count":18,"area":null},{"id":"2109.00545","title":"Fair Representation: Guaranteeing Approximate Multiple Group Fairness for Unknown Tasks","created":"2021-09-01","cited_by_count":16,"area":null},{"id":"2206.02640","title":"Policy Optimization for Markov Games: Unified Framework and Faster Convergence","created":"2022-06-06","cited_by_count":16,"area":null},{"id":"2206.04502","title":"What is a Good Metric to Study Generalization of Minimax Learners?","created":"2022-06-09","cited_by_count":16,"area":null},{"id":"2112.02856","title":"Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback","created":"2021-12-06","cited_by_count":15,"area":null},{"id":"2301.13120","title":"Doubly Optimal No-Regret Learning in Monotone Games","created":"2023-01-30","cited_by_count":14,"area":null},{"id":"2406.10631","title":"Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms","created":"2024-06-15","cited_by_count":14,"area":null},{"id":"2107.01906","title":"The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities","created":"2021-07-05","cited_by_count":12,"area":null},{"id":"2305.16569","title":"Accelerating Value Iteration with Anchoring","created":"2023-05-26","cited_by_count":11,"area":null},{"id":"2310.02987","title":"Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions","created":"2023-10-04","cited_by_count":11,"area":null},{"id":"2505.01423","title":"Negative Stepsizes Make Gradient-Descent-Ascent Converge","created":"2025-05-02","cited_by_count":11,"area":null},{"id":"2112.09579","title":"Convergence Rates of Two-Time-Scale Gradient Descent-Ascent Dynamics for Solving Nonconvex Min-Max Problems","created":"2021-12-17","cited_by_count":10,"area":null},{"id":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2411.00568","title":"Constrained Sampling with Primal-Dual Langevin Monte Carlo","created":"2024-11-01","cited_by_count":10,"area":null},{"id":"2208.09855","title":"Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games","created":"2022-08-21","cited_by_count":9,"area":null},{"id":"2305.16610","title":"Adaptively Perturbed Mirror Descent for Learning in Games","created":"2023-05-26","cited_by_count":9,"area":null},{"id":"2110.03950","title":"Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain","created":"2021-10-08","cited_by_count":8,"area":null},{"id":"2112.13826","title":"Last-Iterate Convergence of Saddle-Point Optimizers via High-Resolution Differential Equations","created":"2021-12-27","cited_by_count":8,"area":null},{"id":"2210.12812","title":"Symmetric (Optimistic) Natural Policy Gradient for Multi-agent Learning with Parameter Convergence","created":"2022-10-23","cited_by_count":8,"area":null},{"id":"2506.03464","title":"From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications","created":"2025-06-04","cited_by_count":8,"area":null},{"id":"2311.00676","title":"Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games","created":"2023-11-01","cited_by_count":6,"area":null},{"id":"2303.17192","title":"Sublinear Convergence Rates of Extragradient-Type Methods: A Survey on Classical and Recent Developments","created":"2023-03-30","cited_by_count":5,"area":null},{"id":"2101.12101","title":"Potential Function-based Framework for Making the Gradients Small in Convex and Min-Max Optimization","created":"2021-01-28","cited_by_count":4,"area":null},{"id":"2103.00284","title":"On the Initialization for Convex-Concave Min-max Problems","created":"2021-02-27","cited_by_count":4,"area":null},{"id":"2210.09769","title":"STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games","created":"2022-10-18","cited_by_count":4,"area":null},{"id":"2301.03931","title":"Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction Maps","created":"2023-01-10","cited_by_count":4,"area":null},{"id":"2206.10575","title":"Solving Constrained Variational Inequalities via a First-order Interior Point-based Method","created":"2022-06-21","cited_by_count":3,"area":null},{"id":"2207.07971","title":"A Survey of Decision Making in Adversarial Games","created":"2022-07-16","cited_by_count":3,"area":null},{"id":"2310.13459","title":"Stable Nonconvex-Nonconcave Training via Linear Interpolation","created":"2023-10-20","cited_by_count":3,"area":null},{"id":"2403.12859","title":"Primal Methods for Variational Inequality Problems with Functional Constraints","created":"2024-03-19","cited_by_count":3,"area":null},{"id":"2304.12768","title":"Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games","created":"2023-04-25","cited_by_count":2,"area":null},{"id":"2306.16617","title":"Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation","created":"2023-06-29","cited_by_count":2,"area":null},{"id":"2312.12067","title":"Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property","created":"2023-12-19","cited_by_count":2,"area":null},{"id":"2401.14585","title":"Diffusion Stochastic Optimization for Min-Max Problems","created":"2024-01-26","cited_by_count":2,"area":null},{"id":"2510.11691","title":"Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games","created":"2025-10-13","cited_by_count":2,"area":null},{"id":"2207.07105","title":"Continuous-time Analysis for Variational Inequalities: An Overview and Desiderata","created":"2022-07-14","cited_by_count":1,"area":null},{"id":"2301.08830","title":"ApproxED: Approximate exploitability descent via learned best responses","created":"2023-01-20","cited_by_count":1,"area":null},{"id":"2309.14155","title":"Extragradient Type Methods for Riemannian Variational Inequality Problems","created":"2023-09-25","cited_by_count":1,"area":null},{"id":"2310.14087","title":"A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport","created":"2023-10-21","cited_by_count":1,"area":null},{"id":"2405.17463","title":"Is Thompson Sampling Susceptible to Algorithmic Collusion?","created":"2024-05-23","cited_by_count":1,"area":null},{"id":"2410.20649","title":"Learning Variational Inequalities from Data: Fast Generalization Rates under Strong Monotonicity","created":"2024-10-28","cited_by_count":1,"area":null},{"id":"2603.22155","title":"RAMPAGE: RAndomized Mid-Point for debiAsed Gradient Extrapolation","created":"2026-03-23","cited_by_count":1,"area":null},{"id":"2604.07662","title":"Parameter-Free Non-Ergodic Extragradient Algorithms for Solving Monotone Variational Inequalities","created":"2026-04-09","cited_by_count":1,"area":null},{"id":"2507.11366","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","created":"2025-07-15","cited_by_count":0,"area":null},{"id":"2606.22688","title":"GARIP: A Running-Average Moving Reference for Last-Iterate Self-Play in Two-Player Zero-Sum Games","created":"2026-06-21","cited_by_count":0,"area":null},{"id":"2608.06182","title":"On Same-Sample and Independent-Sample Stochastic Extragradient for Monotone Variational Inequalities","created":"2026-08-06","cited_by_count":0,"area":null},{"id":"2609.15257","title":"Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2610.05968","title":"Fast Last-Iterate Convergence in Zero-Sum Markov Games with Bandit Feedback","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}