{"total":140,"rows":[{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"area":null},{"id":"2201.12091","title":"Linear Adversarial Concept Erasure","created":"2022-01-28","cited_by_count":101,"area":null},{"id":"2302.05185","title":"On Penalty-based Bilevel Gradient Descent Method","created":"2023-02-10","cited_by_count":87,"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.11144","title":"Improved OOD Generalization via Adversarial Training and Pre-training","created":"2021-05-24","cited_by_count":66,"area":null},{"id":"2205.02215","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","created":"2022-05-04","cited_by_count":60,"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":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2109.06141","title":"On Tilted Losses in Machine Learning: Theory and Applications","created":"2021-09-13","cited_by_count":43,"area":null},{"id":"2102.11494","title":"Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games","created":"2021-02-23","cited_by_count":40,"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":"2212.10439","title":"Policy Gradient in Robust MDPs with Global Convergence Guarantee","created":"2022-12-20","cited_by_count":38,"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":"2212.00974","title":"Faster Adaptive Federated Learning","created":"2022-12-02","cited_by_count":35,"area":null},{"id":"2210.03096","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","created":"2022-10-06","cited_by_count":32,"area":null},{"id":"2303.13087","title":"Robust Generalization against Photon-Limited Corruptions via Worst-Case Sharpness Minimization","created":"2023-03-23","cited_by_count":29,"area":null},{"id":"2106.10517","title":"A Max-Min Entropy Framework for Reinforcement Learning","created":"2021-06-19","cited_by_count":28,"area":null},{"id":"2206.02346","title":"Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs","created":"2022-06-06","cited_by_count":27,"area":null},{"id":"2206.04804","title":"Theoretical Error Performance Analysis for Variational Quantum Circuit Based Functional Regression","created":"2022-06-08","cited_by_count":26,"area":null},{"id":"2201.09046","title":"Differentially Private SGDA for Minimax Problems","created":"2022-01-22","cited_by_count":23,"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.09831","title":"Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems","created":"2023-02-20","cited_by_count":21,"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":"2106.09082","title":"Zeroth-Order Methods for Convex-Concave Minmax Problems: Applications to Decision-Dependent Risk Minimization","created":"2021-06-16","cited_by_count":18,"area":null},{"id":"2205.13746","title":"Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games","created":"2022-05-27","cited_by_count":18,"area":null},{"id":"2202.07530","title":"Optimal Algorithms for Stochastic Multi-Level Compositional Optimization","created":"2022-02-15","cited_by_count":17,"area":null},{"id":"2206.00743","title":"Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization","created":"2022-06-01","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":"2210.08781","title":"Stochastic Differentially Private and Fair Learning","created":"2022-10-17","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":"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":"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":"2305.17568","title":"Scalable Primal-Dual Actor-Critic Method for Safe Multi-Agent RL with General Utilities","created":"2023-05-27","cited_by_count":15,"area":null},{"id":"2307.00126","title":"Accelerating Inexact HyperGradient Descent for Bilevel Optimization","created":"2023-06-30","cited_by_count":15,"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":"2104.14840","title":"Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator","created":"2021-04-30","cited_by_count":13,"area":null},{"id":"2106.16101","title":"AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization","created":"2021-06-30","cited_by_count":13,"area":null},{"id":"2206.02468","title":"An Optimal Transport Approach to Personalized Federated Learning","created":"2022-06-06","cited_by_count":12,"area":null},{"id":"2209.10825","title":"Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis","created":"2022-09-22","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":"2102.08431","title":"Complex Momentum for Optimization in Games","created":"2021-02-16","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":"2212.02724","title":"Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems","created":"2022-12-06","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":"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":"2206.02953","title":"Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization","created":"2022-06-07","cited_by_count":10,"area":null},{"id":"2310.03613","title":"Solving a Class of Non-Convex Minimax Optimization in Federated Learning","created":"2023-10-05","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":"2110.05192","title":"Convex-Concave Min-Max Stackelberg Games","created":"2021-10-05","cited_by_count":9,"area":null},{"id":"2110.08477","title":"FedMM: Saddle Point Optimization for Federated Adversarial Domain Adaptation","created":"2021-10-16","cited_by_count":9,"area":null},{"id":"2206.01132","title":"A Communication-efficient Algorithm with Linear Convergence for Federated Minimax Learning","created":"2022-06-02","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":"2305.18285","title":"Partially Personalized Federated Learning: Breaking the Curse of Data Heterogeneity","created":"2023-05-29","cited_by_count":9,"area":null},{"id":"2106.01488","title":"Minimax Optimization with Smooth Algorithmic Adversaries","created":"2021-06-02","cited_by_count":8,"area":null},{"id":"2107.10706","title":"Distributed Saddle-Point Problems Under Similarity","created":"2021-07-22","cited_by_count":8,"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":"2210.05995","title":"SGDA with shuffling: faster convergence for nonconvex-P{\\L} minimax optimization","created":"2022-10-12","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":"2210.17478","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","created":"2022-10-31","cited_by_count":8,"area":null},{"id":"2301.02060","title":"A first-order augmented Lagrangian method for constrained minimax optimization","created":"2023-01-05","cited_by_count":8,"area":null},{"id":"2302.04249","title":"Federated Minimax Optimization with Client Heterogeneity","created":"2023-02-08","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":"2205.14278","title":"Generalization Bounds of Nonconvex-(Strongly)-Concave Stochastic Minimax Optimization","created":"2022-05-28","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":"2306.13800","title":"A First Order Meta Stackelberg Method for Robust Federated Learning","created":"2023-06-23","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":"2212.02387","title":"An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization","created":"2022-12-05","cited_by_count":6,"area":null},{"id":"2303.03984","title":"Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization","created":"2023-03-07","cited_by_count":6,"area":null},{"id":"2506.07804","title":"Enhancing Adversarial Robustness with Conformal Prediction: A Framework for Guaranteed Model Reliability","created":"2025-06-09","cited_by_count":6,"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":"2111.01262","title":"Minimax Optimization: The Case of Convex-Submodular","created":"2021-11-01","cited_by_count":5,"area":null},{"id":"2202.07868","title":"Data-Driven Minimax Optimization with Expectation Constraints","created":"2022-02-16","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.00081","title":"Sampling Attacks on Meta Reinforcement Learning: A Minimax Formulation and Complexity Analysis","created":"2022-07-29","cited_by_count":5,"area":null},{"id":"2209.00771","title":"Optimizing the Performative Risk under Weak Convexity Assumptions","created":"2022-09-02","cited_by_count":5,"area":null},{"id":"2211.07303","title":"Adaptive Federated Minimax Optimization with Lower Complexities","created":"2022-11-14","cited_by_count":5,"area":null},{"id":"2211.07767","title":"Learning to Optimize with Stochastic Dominance Constraints","created":"2022-11-14","cited_by_count":5,"area":null},{"id":"2306.02422","title":"A Generalized Alternating Method for Bilevel Learning under the Polyak-{\\L}ojasiewicz Condition","created":"2023-06-04","cited_by_count":5,"area":null},{"id":"2307.15868","title":"Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\\L}ojasiewicz Conditions","created":"2023-07-29","cited_by_count":5,"area":null},{"id":"2503.18317","title":"Improved Rates of Differentially Private Nonconvex-Strongly-Concave Minimax Optimization","created":"2025-03-24","cited_by_count":5,"area":null},{"id":"2106.07289","title":"Decentralized Personalized Federated Learning for Min-Max Problems","created":"2021-06-14","cited_by_count":4,"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":"2301.03662","title":"On adversarial robustness and the use of Wasserstein ascent-descent dynamics to enforce it","created":"2023-01-09","cited_by_count":4,"area":null},{"id":"2304.10902","title":"Near-Optimal Decentralized Momentum Method for Nonconvex-PL Minimax Problems","created":"2023-04-21","cited_by_count":4,"area":null},{"id":"2311.00944","title":"Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization","created":"2023-11-02","cited_by_count":4,"area":null},{"id":"2312.03259","title":"f-FERM: A Scalable Framework for Robust Fair Empirical Risk Minimization","created":"2023-12-06","cited_by_count":4,"area":null},{"id":"2509.14952","title":"Stochastic Bilevel Optimization with Heavy-Tailed Noise","created":"2025-09-18","cited_by_count":4,"area":null},{"id":"2103.12685","title":"Generative Minimization Networks: Training GANs Without Competition","created":"2021-03-23","cited_by_count":3,"area":null},{"id":"2105.04801","title":"On Characterizing GAN Convergence Through Proximal Duality Gap","created":"2021-05-11","cited_by_count":3,"area":null},{"id":"2111.13162","title":"Randomized Stochastic Gradient Descent Ascent","created":"2021-11-25","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":"2402.16397","title":"Investigating Deep Watermark Security: An Adversarial Transferability Perspective","created":"2024-02-26","cited_by_count":3,"area":null},{"id":"2407.03571","title":"A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems","created":"2024-07-04","cited_by_count":3,"area":null},{"id":"2511.08417","title":"NeuCLIP: Efficient Large-Scale CLIP Training with Neural Normalizer Optimization","created":"2025-11-11","cited_by_count":3,"area":null},{"id":"2606.04401","title":"TANDEM: Bi-Level Data Mixture Optimization with Twin Networks","created":"2026-06-03","cited_by_count":3,"area":null}],"next_cursor":"100"}