{"total":128,"rows":[{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"area":null},{"id":"2105.15186","title":"Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization","created":"2021-05-31","cited_by_count":63,"area":null},{"id":"2402.19078","title":"Smooth Tchebycheff Scalarization for Multi-Objective Optimization","created":"2024-02-29","cited_by_count":54,"area":null},{"id":"2104.12761","title":"Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium","created":"2021-04-26","cited_by_count":51,"area":null},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49,"area":null},{"id":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47,"area":null},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2102.13152","title":"Local Stochastic Gradient Descent Ascent: Convergence Analysis and Communication Efficiency","created":"2021-02-25","cited_by_count":40,"area":null},{"id":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37,"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":"2106.08315","title":"Decentralized Local Stochastic Extra-Gradient for Variational Inequalities","created":"2021-06-15","cited_by_count":25,"area":null},{"id":"2206.03922","title":"A unified stochastic approximation framework for learning in games","created":"2022-06-08","cited_by_count":23,"area":null},{"id":"2106.12928","title":"Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality","created":"2021-06-24","cited_by_count":21,"area":null},{"id":"2206.09495","title":"The Power of Regularization in Solving Extensive-Form Games","created":"2022-06-19","cited_by_count":21,"area":null},{"id":"2302.09831","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems","created":"2023-02-20","cited_by_count":21,"area":null},{"id":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"area":null},{"id":"2302.01275","title":"ReLOAD: Reinforcement Learning with Optimistic Ascent-Descent for Last-Iterate Convergence in Constrained MDPs","created":"2023-02-02","cited_by_count":20,"area":null},{"id":"2102.08903","title":"Provably Efficient Policy Optimization for Two-Player Zero-Sum Markov Games","created":"2021-02-17","cited_by_count":18,"area":null},{"id":"2206.06015","title":"No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation","created":"2022-06-13","cited_by_count":17,"area":null},{"id":"2210.08857","title":"On the convergence of policy gradient methods to Nash equilibria in general stochastic games","created":"2022-10-17","cited_by_count":16,"area":null},{"id":"2402.13903","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","created":"2024-02-21","cited_by_count":16,"area":null},{"id":"2408.11974","title":"Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization","created":"2024-08-21","cited_by_count":16,"area":null},{"id":"2110.03313","title":"Distributed Methods with Compressed Communication for Solving Variational Inequalities, with Theoretical Guarantees","created":"2021-10-07","cited_by_count":15,"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":"2202.02771","title":"Optimal Algorithms for Decentralized Stochastic Variational Inequalities","created":"2022-02-06","cited_by_count":14,"area":null},{"id":"2211.01280","title":"An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games","created":"2022-11-02","cited_by_count":14,"area":null},{"id":"2301.11241","title":"On the Convergence of No-Regret Learning Dynamics in Time-Varying Games","created":"2023-01-26","cited_by_count":14,"area":null},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","cited_by_count":14,"area":null},{"id":"2305.15938","title":"First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities","created":"2023-05-25","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":"2206.04160","title":"Alternating Mirror Descent for Constrained Min-Max Games","created":"2022-06-08","cited_by_count":13,"area":null},{"id":"2212.08791","title":"Two-Scale Gradient Descent Ascent Dynamics Finds Mixed Nash Equilibria of Continuous Games: A Mean-Field Perspective","created":"2022-12-17","cited_by_count":13,"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":"2212.12978","title":"Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization","created":"2022-12-26","cited_by_count":12,"area":null},{"id":"2212.13955","title":"Beyond the Golden Ratio for Variational Inequality Algorithms","created":"2022-12-28","cited_by_count":12,"area":null},{"id":"2103.03405","title":"Learning in Matrix Games can be Arbitrarily Complex","created":"2021-03-05","cited_by_count":11,"area":null},{"id":"2410.16528","title":"ADAM-SINDy: An Efficient Optimization Framework for Parameterized Nonlinear Dynamical System Identification","created":"2024-10-21","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":"2104.12676","title":"Solving a class of non-convex min-max games using adaptive momentum methods","created":"2021-04-26","cited_by_count":10,"area":null},{"id":"2111.03377","title":"Online Learning in Periodic Zero-Sum Games","created":"2021-11-05","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":"2307.09470","title":"Multi-Player Zero-Sum Markov Games with Networked Separable Interactions","created":"2023-07-13","cited_by_count":10,"area":null},{"id":"2106.06075","title":"A Decentralized Adaptive Momentum Method for Solving a Class of Min-Max Optimization Problems","created":"2021-06-10","cited_by_count":9,"area":null},{"id":"2109.14213","title":"On the One-sided Convergence of Adam-type Algorithms in Non-convex Non-concave Min-max Optimization","created":"2021-09-29","cited_by_count":9,"area":null},{"id":"2207.00957","title":"On Convergence of Gradient Descent Ascent: A Tight Local Analysis","created":"2022-07-03","cited_by_count":9,"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":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","cited_by_count":8,"area":null},{"id":"2206.09254","title":"Mutation-Driven Follow the Regularized Leader for Last-Iterate Convergence in Zero-Sum Games","created":"2022-06-18","cited_by_count":8,"area":null},{"id":"2206.09446","title":"Compression and Data Similarity: Combination of Two Techniques for Communication-Efficient Solving of Distributed Variational Inequalities","created":"2022-06-19","cited_by_count":8,"area":null},{"id":"2106.06828","title":"A Game-Theoretic Approach to Multi-Agent Trust Region Optimization","created":"2021-06-12","cited_by_count":7,"area":null},{"id":"2202.05352","title":"Domain Adversarial Training: A Game Perspective","created":"2022-02-10","cited_by_count":7,"area":null},{"id":"2210.09382","title":"Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems","created":"2022-10-17","cited_by_count":7,"area":null},{"id":"2302.07615","title":"Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalities","created":"2023-02-15","cited_by_count":7,"area":null},{"id":"2512.08176","title":"Worst-case generation via minimax optimization in Wasserstein space","created":"2025-12-09","cited_by_count":7,"area":null},{"id":"2103.08270","title":"DIPPA: An improved Method for Bilinear Saddle Point Problems","created":"2021-03-15","cited_by_count":6,"area":null},{"id":"2106.03579","title":"Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games","created":"2021-06-07","cited_by_count":6,"area":null},{"id":"2306.16502","title":"Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements","created":"2023-06-28","cited_by_count":6,"area":null},{"id":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","cited_by_count":6,"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":"2302.12736","title":"Balanced Off-Policy Evaluation for Personalized Pricing","created":"2023-02-24","cited_by_count":5,"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":"2504.07388","title":"Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm","created":"2025-04-10","cited_by_count":5,"area":null},{"id":"2602.05531","title":"Solving Stochastic Variational Inequalities without the Bounded Variance Assumption","created":"2026-02-05","cited_by_count":5,"area":null},{"id":"2107.08011","title":"Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2203.14129","title":"Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics","created":"2022-03-26","cited_by_count":4,"area":null},{"id":"2206.08573","title":"Optimal Extragradient-Based Bilinearly-Coupled Saddle-Point Optimization","created":"2022-06-17","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":"2311.02407","title":"The equivalence of dynamic and strategic stability under regularized learning in games","created":"2023-11-04","cited_by_count":4,"area":null},{"id":"2405.07224","title":"A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights","created":"2024-05-12","cited_by_count":4,"area":null},{"id":"2412.20203","title":"No-regret learning in harmonic games: Extrapolation in the face of conflicting interests","created":"2024-12-28","cited_by_count":4,"area":null},{"id":"2605.18809","title":"Metric-Gradient Projection for Stable Multi-Agent Policy Learning","created":"2026-05-12","cited_by_count":4,"area":null},{"id":"2608.12043","title":"Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization","created":"2026-08-12","cited_by_count":4,"area":null},{"id":"2107.02919","title":"Distributed stochastic optimization with large delays","created":"2021-07-06","cited_by_count":3,"area":null},{"id":"2110.03604","title":"Online Markov Decision Processes with Non-oblivious Strategic Adversary","created":"2021-10-07","cited_by_count":3,"area":null},{"id":"2206.08303","title":"On Scaled Methods for Saddle Point Problems","created":"2022-06-16","cited_by_count":3,"area":null},{"id":"2301.02389","title":"Provable Reset-free Reinforcement Learning by No-Regret Reduction","created":"2023-01-06","cited_by_count":3,"area":null},{"id":"2310.04539","title":"Generating Less Certain Adversarial Examples Improves Robust Generalization","created":"2023-10-06","cited_by_count":3,"area":null},{"id":"2406.10605","title":"Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games","created":"2024-06-15","cited_by_count":3,"area":null},{"id":"2603.15576","title":"Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions","created":"2026-03-16","cited_by_count":3,"area":null},{"id":"2608.31166","title":"Constant Individual Regret in General Games","created":"2026-08-31","cited_by_count":3,"area":null},{"id":"2106.10022","title":"Local AdaGrad-Type Algorithm for Stochastic Convex-Concave Optimization","created":"2021-06-18","cited_by_count":2,"area":null},{"id":"2202.06460","title":"Simultaneous Transport Evolution for Minimax Equilibria on Measures","created":"2022-02-14","cited_by_count":2,"area":null},{"id":"2210.16482","title":"Recursive Reasoning in Minimax Games: A Level $k$ Gradient Play Method","created":"2022-10-29","cited_by_count":2,"area":null},{"id":"2301.13006","title":"Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods","created":"2023-01-30","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":"2506.13286","title":"The impact of uncertainty on regularized learning in games","created":"2025-06-16","cited_by_count":2,"area":null},{"id":"2512.07770","title":"Distribution-informed Online Conformal Prediction","created":"2025-12-08","cited_by_count":2,"area":null},{"id":"2105.04129","title":"Parameter-free Gradient Temporal Difference Learning","created":"2021-05-10","cited_by_count":1,"area":null},{"id":"2106.02615","title":"Consensus Multiplicative Weights Update: Learning to Learn using Projector-based Game Signatures","created":"2021-06-04","cited_by_count":1,"area":null},{"id":"2106.13067","title":"Stochastic Projective Splitting: Solving Saddle-Point Problems with Multiple Regularizers","created":"2021-06-24","cited_by_count":1,"area":null},{"id":"2111.04178","title":"Towards convergence to Nash equilibria in two-team zero-sum games","created":"2021-11-07","cited_by_count":1,"area":null},{"id":"2202.10523","title":"Semi-Implicit Hybrid Gradient Methods with Application to Adversarial Robustness","created":"2022-02-21","cited_by_count":1,"area":null},{"id":"2205.14232","title":"Competitive Gradient Optimization","created":"2022-05-27","cited_by_count":1,"area":null},{"id":"2304.08389","title":"Beyond first-order methods for non-convex non-concave min-max optimization","created":"2023-04-17","cited_by_count":1,"area":null},{"id":"2405.11746","title":"Configurable Mirror Descent: Towards a Unification of Decision Making","created":"2024-05-20","cited_by_count":1,"area":null},{"id":"2405.13392","title":"Local convergence of simultaneous min-max algorithms to differential equilibrium on Riemannian manifold","created":"2024-05-22","cited_by_count":1,"area":null},{"id":"2408.12209","title":"Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization","created":"2024-08-22","cited_by_count":1,"area":null},{"id":"2501.16600","title":"On the Power of Perturbation under Sampling in Solving Extensive-Form Games","created":"2025-01-28","cited_by_count":1,"area":null}],"next_cursor":"100"}