{"total":39,"rows":[{"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":"2109.06141","title":"On Tilted Losses in Machine Learning: Theory and Applications","created":"2021-09-13","cited_by_count":43,"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.12586","title":"A Stochastic Optimization Framework for Fair Risk Minimization","created":"2021-02-24","cited_by_count":26,"area":null},{"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":"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":"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":"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":"2108.11832","title":"Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization","created":"2021-08-26","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":"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":"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":"2110.05192","title":"Convex-Concave Min-Max Stackelberg Games","created":"2021-10-05","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":"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":"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":"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":"2203.14126","title":"Robust No-Regret Learning in Min-Max Stackelberg Games","created":"2022-03-26","cited_by_count":5,"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":"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":"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":"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":"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":"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":"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":"2605.13806","title":"Min-Max Optimization Requires Exponentially Many Queries","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2606.17000","title":"The Complexity of Min-Max Optimization for Quadratic Polynomials","created":"2026-06-15","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":"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":"2512.22909","title":"A first-order method for nonconvex-strongly-concave constrained minimax optimization","created":"2025-12-28","cited_by_count":0,"area":null}],"next_cursor":null}