{"list":"other","total":53,"rows":[{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1711.00141","title":"Training GANs with Optimism","created":"2017-10-31","cited_by_count":217},{"id":"1803.06523","title":"Stochastic model-based minimization of weakly convex functions","created":"2018-03-17","cited_by_count":159},{"id":"1902.08297","title":"Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods","created":"2019-02-21","cited_by_count":148},{"id":"1901.08511","title":"A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach","created":"2019-01-24","cited_by_count":143},{"id":"1807.02629","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","created":"2018-07-07","cited_by_count":136},{"id":"1509.09259","title":"Distributionally Robust Logistic Regression","created":"2015-09-30","cited_by_count":126},{"id":"1709.02738","title":"Cycles in adversarial regularized learning","created":"2017-09-08","cited_by_count":124},{"id":"2002.02417","title":"Near-Optimal Algorithms for Minimax Optimization","created":"2020-02-05","cited_by_count":119},{"id":"1802.05642","title":"The Mechanics of n-Player Differentiable Games","created":"2018-02-15","cited_by_count":118},{"id":"1807.03907","title":"The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization","created":"2018-07-11","cited_by_count":101},{"id":"1807.04252","title":"Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization","created":"2018-07-11","cited_by_count":98},{"id":"2011.00364","title":"Efficient Methods for Structured Nonconvex-Nonconcave Min-Max Optimization","created":"2020-10-31","cited_by_count":96},{"id":"2009.09623","title":"The Complexity of Constrained Min-Max Optimization","created":"2020-09-21","cited_by_count":82},{"id":"2001.03724","title":"Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problems","created":"2020-01-11","cited_by_count":77},{"id":"1907.01543","title":"Efficient Algorithms for Smooth Minimax Optimization","created":"2019-07-02","cited_by_count":76},{"id":"1802.06132","title":"Interaction Matters: A Note on Non-asymptotic Local Convergence of Generative Adversarial Networks","created":"2018-02-16","cited_by_count":68},{"id":"1705.05933","title":"Sub-sampled Cubic Regularization for Non-convex Optimization","created":"2017-05-16","cited_by_count":63},{"id":"1810.02060","title":"Weakly-Convex Concave Min-Max Optimization: Provable Algorithms and Applications in Machine Learning","created":"2018-10-04","cited_by_count":63},{"id":"2010.15768","title":"A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems","created":"2020-10-29","cited_by_count":58},{"id":"2006.02032","title":"A Unified Single-loop Alternating Gradient Projection Algorithm for Nonconvex-Concave and Convex-Nonconcave Minimax Problems","created":"2020-06-03","cited_by_count":57},{"id":"1902.08294","title":"Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications","created":"2019-02-21","cited_by_count":55},{"id":"1802.08249","title":"On the Convergence and Robustness of Training GANs with Regularized Optimal Transport","created":"2018-02-22","cited_by_count":51},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49},{"id":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45},{"id":"2008.08170","title":"Accelerated Zeroth-Order and First-Order Momentum Methods from Mini to Minimax Optimization","created":"2020-08-18","cited_by_count":40},{"id":"2002.07919","title":"Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems","created":"2020-02-18","cited_by_count":39},{"id":"2110.04261","title":"Extragradient Method: $O(1/K)$ Last-Iterate Convergence for Monotone Variational Inequalities and Connections With Cocoercivity","created":"2021-10-08","cited_by_count":39},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36},{"id":"1810.10207","title":"First-order Convergence Theory for Weakly-Convex-Weakly-Concave Min-max Problems","created":"2018-10-24","cited_by_count":34},{"id":"2007.04202","title":"Stochastic Hamiltonian Gradient Methods for Smooth Games","created":"2020-07-08","cited_by_count":32},{"id":"1905.13433","title":"An accelerated inexact proximal point method for solving nonconvex-concave min-max problems","created":"2019-05-31","cited_by_count":30},{"id":"1805.05751","title":"Local Saddle Point Optimization: A Curvature Exploitation Approach","created":"2018-05-15","cited_by_count":28},{"id":"2007.13605","title":"Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems","created":"2020-07-27","cited_by_count":26},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24},{"id":"2206.05248","title":"Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion","created":"2022-06-10","cited_by_count":20},{"id":"1510.02145","title":"Saddle-point dynamics: conditions for asymptotic stability of saddle points","created":"2015-10-07","cited_by_count":18},{"id":"1910.07030","title":"SGD Learns One-Layer Networks in WGANs","created":"2019-10-15","cited_by_count":16},{"id":"2206.00743","title":"Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization","created":"2022-06-01","cited_by_count":16},{"id":"2003.04375","title":"A Primal-Dual Smoothing Framework for Max-Structured Non-Convex Optimization","created":"2020-03-09","cited_by_count":14},{"id":"1706.03269","title":"An Online Learning Approach to Generative Adversarial Networks","created":"2017-06-10","cited_by_count":13},{"id":"2002.04130","title":"Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions","created":"2020-02-10","cited_by_count":13},{"id":"2212.12978","title":"Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization","created":"2022-12-26","cited_by_count":12},{"id":"2003.08093","title":"Solving Non-Convex Non-Differentiable Min-Max Games using Proximal Gradient Method","created":"2020-03-18","cited_by_count":10},{"id":"2207.00957","title":"On Convergence of Gradient Descent Ascent: A Tight Local Analysis","created":"2022-07-03","cited_by_count":9},{"id":"2106.01488","title":"Minimax Optimization with Smooth Algorithmic Adversaries","created":"2021-06-02","cited_by_count":8},{"id":"2110.03950","title":"Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain","created":"2021-10-08","cited_by_count":8},{"id":"2210.17478","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","created":"2022-10-31","cited_by_count":8},{"id":"2105.15042","title":"Semi-Anchored Multi-Step Gradient Descent Ascent Method for Structured Nonconvex-Nonconcave Composite Minimax Problems","created":"2021-05-31","cited_by_count":6},{"id":"2203.10914","title":"Optimality conditions for nonsmooth nonconvex-nonconcave min-max problems and generative adversarial networks","created":"2022-03-21","cited_by_count":5},{"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}],"next_cursor":null}