{"total":76,"rows":[{"id":"2102.12660","title":"Distributionally Robust Federated Averaging","created":"2021-02-25","cited_by_count":104,"area":null},{"id":"2101.04233","title":"Independent Policy Gradient Methods for Competitive Reinforcement Learning","created":"2021-01-11","cited_by_count":101,"area":null},{"id":"2205.02215","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","created":"2022-05-04","cited_by_count":60,"area":null},{"id":"2309.01753","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","created":"2023-09-04","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":"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":"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":"2105.03793","title":"Stability and Generalization of Stochastic Gradient Methods for Minimax Problems","created":"2021-05-08","cited_by_count":36,"area":null},{"id":"2312.10336","title":"Certified Minimax Unlearning with Generalization Rates and Deletion Capacity","created":"2023-12-16","cited_by_count":29,"area":"safety"},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24,"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":"2104.13326","title":"Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization","created":"2021-04-27","cited_by_count":19,"area":null},{"id":"2106.01761","title":"Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization","created":"2021-06-03","cited_by_count":16,"area":null},{"id":"2305.19004","title":"Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets","created":"2023-05-30","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":"2210.07588","title":"Distributed Distributionally Robust Optimization with Non-Convex Objectives","created":"2022-10-14","cited_by_count":14,"area":null},{"id":"2201.07427","title":"Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization","created":"2022-01-19","cited_by_count":13,"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":"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":"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":"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":"2110.05192","title":"Convex-Concave Min-Max Stackelberg Games","created":"2021-10-05","cited_by_count":9,"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":"2207.00957","title":"On Convergence of Gradient Descent Ascent: A Tight Local Analysis","created":"2022-07-03","cited_by_count":9,"area":null},{"id":"2303.03095","title":"Can We Find Nash Equilibria at a Linear Rate in Markov Games?","created":"2023-03-03","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":"2110.03950","title":"Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain","created":"2021-10-08","cited_by_count":8,"area":null},{"id":"2206.08627","title":"RECAPP: Crafting a More Efficient Catalyst for Convex Optimization","created":"2022-06-17","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":"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":"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":"2304.02441","title":"Decentralized gradient descent maximization method for composite nonconvex strongly-concave minimax problems","created":"2023-04-05","cited_by_count":6,"area":null},{"id":"2111.01262","title":"Minimax Optimization: The Case of Convex-Submodular","created":"2021-11-01","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":"2110.07959","title":"Low-rank Matrix Recovery With Unknown Correspondence","created":"2021-10-15","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":"2504.19000","title":"Unveiling and Mitigating Adversarial Vulnerabilities in Iterative Optimizers","created":"2025-04-26","cited_by_count":4,"area":null},{"id":"2209.04604","title":"Accelerated Primal-Dual Methods for Convex-Strongly-Concave Saddle Point Problems","created":"2022-09-10","cited_by_count":3,"area":null},{"id":"2303.13326","title":"Decentralized Adversarial Training over Graphs","created":"2023-03-23","cited_by_count":3,"area":null},{"id":"2310.17759","title":"Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization","created":"2023-10-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":"2204.04090","title":"Single-level Adversarial Data Synthesis based on Neural Tangent Kernels","created":"2022-04-08","cited_by_count":2,"area":null},{"id":"2303.01936","title":"Multi-Agent Adversarial Training Using Diffusion Learning","created":"2023-03-03","cited_by_count":2,"area":null},{"id":"2307.07113","title":"Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems","created":"2023-07-14","cited_by_count":2,"area":null},{"id":"2310.16791","title":"Covert Planning against Imperfect Observers","created":"2023-10-25","cited_by_count":2,"area":null},{"id":"2402.09807","title":"Two trust region type algorithms for solving nonconvex-strongly concave minimax problems","created":"2024-02-15","cited_by_count":2,"area":null},{"id":"2601.21243","title":"Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach","created":"2026-01-29","cited_by_count":2,"area":null},{"id":"2202.09688","title":"A Variance-Reduced Stochastic Accelerated Primal Dual Algorithm","created":"2022-02-19","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":"2202.13863","title":"Provably Efficient Convergence of Primal-Dual Actor-Critic with Nonlinear Function Approximation","created":"2022-02-28","cited_by_count":1,"area":null},{"id":"2310.02459","title":"Distributionally Safe Reinforcement Learning under Model Uncertainty: A Single-Level Approach by Differentiable Convex Programming","created":"2023-10-03","cited_by_count":1,"area":null},{"id":"2310.15448","title":"An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems","created":"2023-10-24","cited_by_count":1,"area":null},{"id":"2408.12505","title":"Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees","created":"2024-08-22","cited_by_count":1,"area":null},{"id":"2410.08497","title":"Towards Sharper Risk Bounds for Minimax Problems","created":"2024-10-11","cited_by_count":1,"area":null},{"id":"2502.17602","title":"A stochastic smoothing framework for nonconvex-nonconcave minEmax problems with applications to Wasserstein distributionally robust optimization","created":"2025-02-24","cited_by_count":1,"area":null},{"id":"2507.16008","title":"Enhancing Stability of Physics-Informed Neural Network Training Through Saddle-Point Reformulation","created":"2025-07-21","cited_by_count":1,"area":null},{"id":"2508.12479","title":"EXOTIC: An Exact, Optimistic, Tree-Based Algorithm for Min-Max Optimization","created":"2025-08-17","cited_by_count":1,"area":null},{"id":"2110.02457","title":"GDA-AM: On the effectiveness of solving minimax optimization via Anderson Acceleration","created":"2021-10-06","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":"2312.00991","title":"Convergences for Minimax Optimization Problems over Infinite-Dimensional Spaces Towards Stability in Adversarial Training","created":"2023-12-02","cited_by_count":0,"area":null},{"id":"2407.14618","title":"SOREL: A Stochastic Algorithm for Spectral Risks Minimization","created":"2024-07-19","cited_by_count":0,"area":null},{"id":"2407.21372","title":"Completely Parameter-Free Single-Loop Algorithms for Nonconvex-Concave Minimax Problems","created":"2024-07-31","cited_by_count":0,"area":null},{"id":"2411.15769","title":"Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems","created":"2024-11-24","cited_by_count":0,"area":null},{"id":"2501.14652","title":"Decoupled SGDA for Games with Intermittent Strategy Communication","created":"2025-01-24","cited_by_count":0,"area":null},{"id":"2509.11337","title":"On the Escaping Efficiency of Distributed Adversarial Training Algorithms","created":"2025-09-14","cited_by_count":0,"area":null},{"id":"2606.11804","title":"Toward Trustworthy AI: Multi-Target Adversarial Attacks and Robust Defenses for Continuous Data Summarization","created":"2026-06-10","cited_by_count":0,"area":null},{"id":"2609.17973","title":"Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization","created":"2026-09-16","cited_by_count":0,"area":null},{"id":"2610.07814","title":"Stochastic Gradient Descent Ascent is Suboptimal for Nonconvex-P{\\L} Min-Max Games","created":"2026-10-06","cited_by_count":0,"area":null}],"next_cursor":null}