{"total":93,"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.04671","title":"A Single-Timescale Method for Stochastic Bilevel Optimization","created":"2021-02-09","cited_by_count":69,"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":"2111.01207","title":"Sig-Wasserstein GANs for Time Series Generation","created":"2021-11-01","cited_by_count":60,"area":null},{"id":"2205.02215","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","created":"2022-05-04","cited_by_count":60,"area":null},{"id":"2202.04129","title":"Independent Policy Gradient for Large-Scale Markov Potential Games: Sharper Rates, Function Approximation, and Game-Agnostic Convergence","created":"2022-02-08","cited_by_count":57,"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":"2111.06008","title":"Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games","created":"2021-11-11","cited_by_count":43,"area":null},{"id":"2312.10256","title":"Multi-agent Reinforcement Learning: A Comprehensive Survey","created":"2023-12-15","cited_by_count":33,"area":null},{"id":"2106.13781","title":"Tighter Analysis of Alternating Stochastic Gradient Method for Stochastic Nested Problems","created":"2021-06-25","cited_by_count":22,"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":"2202.03684","title":"Efficiently Escaping Saddle Points in Bilevel Optimization","created":"2022-02-08","cited_by_count":19,"area":null},{"id":"2102.04653","title":"Proximal Gradient Descent-Ascent: Variable Convergence under K{\\L} Geometry","created":"2021-02-09","cited_by_count":18,"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":"2102.12013","title":"Understanding and Mitigating Accuracy Disparity in Regression","created":"2021-02-24","cited_by_count":17,"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":"2101.01041","title":"Derivative-Free Policy Optimization for Linear Risk-Sensitive and Robust Control Design: Implicit Regularization and Sample Complexity","created":"2021-01-04","cited_by_count":15,"area":null},{"id":"2105.13922","title":"Discretization Drift in Two-Player Games","created":"2021-05-28","cited_by_count":14,"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":"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":"2103.03405","title":"Learning in Matrix Games can be Arbitrarily Complex","created":"2021-03-05","cited_by_count":11,"area":null},{"id":"2211.13668","title":"Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems","created":"2022-11-24","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":"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":"2202.06950","title":"Sion's Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm","created":"2022-02-13","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":"2106.01488","title":"Minimax Optimization with Smooth Algorithmic Adversaries","created":"2021-06-02","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":"2102.11386","title":"Direct-Search for a Class of Stochastic Min-Max Problems","created":"2021-02-22","cited_by_count":7,"area":null},{"id":"2108.00473","title":"Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems","created":"2021-08-01","cited_by_count":7,"area":null},{"id":"2110.07098","title":"A Cubic Regularization Approach for Finding Local Minimax Points in Nonconvex Minimax Optimization","created":"2021-10-14","cited_by_count":5,"area":null},{"id":"2203.14126","title":"Robust No-Regret Learning in Min-Max Stackelberg Games","created":"2022-03-26","cited_by_count":5,"area":null},{"id":"2208.02083","title":"Gradient descent provably escapes saddle points in the training of shallow ReLU networks","created":"2022-08-03","cited_by_count":5,"area":null},{"id":"2501.08263","title":"Multiplayer Federated Learning: Reaching Equilibrium with Less Communication","created":"2025-01-14","cited_by_count":5,"area":null},{"id":"2110.07959","title":"Low-rank Matrix Recovery With Unknown Correspondence","created":"2021-10-15","cited_by_count":4,"area":null},{"id":"2112.11663","title":"Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning","created":"2021-12-22","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":"2305.16242","title":"Two-timescale Extragradient for Finding Local Minimax Points","created":"2023-05-25","cited_by_count":4,"area":null},{"id":"2406.10214","title":"Universal randomised signatures for generative time series modelling","created":"2024-06-14","cited_by_count":4,"area":null},{"id":"2202.06152","title":"Analysis of Dual-Based PID Controllers through Convolutional Mirror Descent","created":"2022-02-12","cited_by_count":3,"area":null},{"id":"2204.00762","title":"Do learned representations respect causal relationships?","created":"2022-04-02","cited_by_count":3,"area":null},{"id":"2303.12981","title":"Connected Superlevel Set in (Deep) Reinforcement Learning and its Application to Minimax Theorems","created":"2023-03-23","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":"2501.18582","title":"A Control Perspective on Training PINNs","created":"2025-01-30","cited_by_count":3,"area":null},{"id":"2504.03069","title":"Properties of Fixed Points of Generalised Extra Gradient Methods Applied to Min-Max Problems","created":"2025-04-03","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":"2109.05535","title":"Adversarial Representation Learning With Closed-Form Solvers","created":"2021-09-12","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":"2204.03187","title":"Distributed Statistical Min-Max Learning in the Presence of Byzantine Agents","created":"2022-04-07","cited_by_count":2,"area":null},{"id":"2303.00970","title":"PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium","created":"2023-03-02","cited_by_count":2,"area":null},{"id":"2505.07642","title":"Convergence of Time-Averaged Mean Field Gradient Descent Dynamics for Continuous Multi-Player Zero-Sum Games","created":"2025-05-12","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":"2110.13452","title":"On the Optimization Landscape of Maximum Mean Discrepancy","created":"2021-10-26","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":"2111.08565","title":"Polymatrix Competitive Gradient Descent","created":"2021-11-16","cited_by_count":1,"area":null},{"id":"2205.11030","title":"HessianFR: An Efficient Hessian-based Follow-the-Ridge Algorithm for Minimax Optimization","created":"2022-05-23","cited_by_count":1,"area":null},{"id":"2205.14232","title":"Competitive Gradient Optimization","created":"2022-05-27","cited_by_count":1,"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":"2211.04659","title":"When is Momentum Extragradient Optimal? A Polynomial-Based Analysis","created":"2022-11-09","cited_by_count":1,"area":null},{"id":"2301.08015","title":"Global Nash Equilibrium in Non-convex Multi-player Game: Theory and Algorithms","created":"2023-01-19","cited_by_count":1,"area":null},{"id":"2404.03084","title":"Rethinking Teacher-Student Curriculum Learning through the Cooperative Mechanics of Experience","created":"2024-04-03","cited_by_count":1,"area":null},{"id":"2404.07172","title":"A Gauss-Newton Approach for Min-Max Optimization in Generative Adversarial Networks","created":"2024-04-10","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":"2509.22500","title":"Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguise","created":"2025-09-26","cited_by_count":1,"area":null},{"id":"2603.01430","title":"On the Stability Connection Between Discrete-Time Algorithms and Their Resolution ODEs: Applications to Min-Max Optimisation","created":"2026-03-02","cited_by_count":1,"area":null},{"id":"2604.15392","title":"Lightweight Geometric Adaptation for Training Physics-Informed Neural Networks","created":"2026-04-16","cited_by_count":1,"area":null},{"id":"2605.13806","title":"Min-Max Optimization Requires Exponentially Many Queries","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2111.05486","title":"Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms","created":"2021-11-10","cited_by_count":0,"area":null},{"id":"2203.07136","title":"On the Nash equilibrium of moment-matching GANs for stationary Gaussian processes","created":"2022-03-14","cited_by_count":0,"area":null},{"id":"2204.00611","title":"Learning the conditional law: signatures and conditional GANs in filtering and prediction of diffusion processes","created":"2022-04-01","cited_by_count":0,"area":null},{"id":"2212.04672","title":"Iterative Minimax Games with Coupled Linear Constraints","created":"2022-12-09","cited_by_count":0,"area":null},{"id":"2302.04099","title":"Extragradient-Type Methods with $\\mathcal{O} (1/k)$ Last-Iterate Convergence Rates for Co-Hypomonotone Inclusions","created":"2023-02-08","cited_by_count":0,"area":null},{"id":"2306.01648","title":"Federated Multi-Sequence Stochastic Approximation with Local Hypergradient Estimation","created":"2023-06-02","cited_by_count":0,"area":null},{"id":"2405.03158","title":"Decentralized Online Learning in General-Sum Stackelberg Games","created":"2024-05-06","cited_by_count":0,"area":null},{"id":"2408.17246","title":"(Un)supervised Learning of Maximal Lyapunov Functions","created":"2024-08-30","cited_by_count":0,"area":null},{"id":"2411.03999","title":"ParaGAN: A Scalable Distributed Training Framework for Generative Adversarial Networks","created":"2024-11-06","cited_by_count":0,"area":null},{"id":"2506.23734","title":"Governing Strategic Dynamics: Equilibrium Stabilization via Divergence-Driven Control","created":"2025-06-30","cited_by_count":0,"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":"2602.15252","title":"Decision Making under Imperfect Recall: Algorithms and Benchmarks","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2604.17145","title":"Negative Momentum for Convex-Concave Optimization","created":"2026-04-18","cited_by_count":0,"area":null},{"id":"2604.25372","title":"From Cursed to Competitive: Closing the ZO-FO Gap via Input-to-State Stability","created":"2026-04-28","cited_by_count":0,"area":null},{"id":"2605.29919","title":"On the Geometry of Games and their Solvers","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2606.04031","title":"Pseudospectral Bounds for Transient Amplification in Coupled Gradient Descent","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2610.02716","title":"Differential Privacy of Gradient Descent on Perturbed Objectives","created":"2026-10-02","cited_by_count":0,"area":null},{"id":"2610.12915","title":"Controlled-Minimax: Stabilizing Adversarial Optimization via Control Theory","created":"2026-10-09","cited_by_count":0,"area":null},{"id":"2610.19322","title":"Generalization Analysis of Biased Stochastic Gradient Methods for Minimax Problems","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}