{"list":"other","total":54,"rows":[{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"id":"1412.6572","title":"Explaining and Harnessing Adversarial Examples","created":"2014-12-20","cited_by_count":7364},{"id":"1806.07572","title":"Neural Tangent Kernel: Convergence and Generalization in Neural Networks","created":"2018-06-20","cited_by_count":2621},{"id":"1801.04406","title":"Which Training Methods for GANs do actually Converge?","created":"2018-01-13","cited_by_count":679},{"id":"1711.00165","title":"Deep Neural Networks as Gaussian Processes","created":"2017-11-01","cited_by_count":622},{"id":"1811.03804","title":"Gradient Descent Finds Global Minima of Deep Neural Networks","created":"2018-11-09","cited_by_count":574},{"id":"1911.10635","title":"Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms","created":"2019-11-24","cited_by_count":567},{"id":"1608.04636","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","created":"2016-08-16","cited_by_count":539},{"id":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1801.05039","title":"Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator","created":"2018-01-15","cited_by_count":250},{"id":"2003.00307","title":"Loss landscapes and optimization in over-parameterized non-linear systems and neural networks","created":"2020-02-29","cited_by_count":233},{"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":"1807.02629","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","created":"2018-07-07","cited_by_count":136},{"id":"1710.11606","title":"Lower Bounds for Finding Stationary Points I","created":"2017-10-31","cited_by_count":126},{"id":"2002.02417","title":"Near-Optimal Algorithms for Minimax Optimization","created":"2020-02-05","cited_by_count":119},{"id":"1705.10461","title":"The Numerics of GANs","created":"2017-05-30","cited_by_count":105},{"id":"1807.03907","title":"The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization","created":"2018-07-11","cited_by_count":101},{"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":"1706.04156","title":"Gradient descent GAN optimization is locally stable","created":"2017-06-13","cited_by_count":67},{"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":"1605.00125","title":"Efficiency of minimizing compositions of convex functions and smooth maps","created":"2016-04-30","cited_by_count":59},{"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":"2006.09065","title":"The limits of min-max optimization algorithms: convergence to spurious non-critical sets","created":"2020-06-16","cited_by_count":50},{"id":"1804.05464","title":"On Gradient-Based Learning in Continuous Games","created":"2018-04-16","cited_by_count":48},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45},{"id":"2107.00052","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","created":"2021-06-30","cited_by_count":43},{"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":"1803.08832","title":"Golden Ratio Algorithms for Variational Inequalities","created":"2018-03-23","cited_by_count":38},{"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":"1910.07512","title":"On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach","created":"2019-10-16","cited_by_count":34},{"id":"2007.04202","title":"Stochastic Hamiltonian Gradient Methods for Smooth Games","created":"2020-07-08","cited_by_count":32},{"id":"1912.11940","title":"Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets","created":"2019-12-26","cited_by_count":29},{"id":"2103.04410","title":"Optimistic Dual Extrapolation for Coherent Non-monotone Variational Inequalities","created":"2021-03-07","cited_by_count":29},{"id":"1805.05751","title":"Local Saddle Point Optimization: A Curvature Exploitation Approach","created":"2018-05-15","cited_by_count":28},{"id":"2005.02426","title":"Communication-Efficient Distributed Stochastic AUC Maximization with Deep Neural Networks","created":"2020-05-05","cited_by_count":27},{"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":"1411.2168","title":"On the Characterization of Local Nash Equilibria in Continuous Games","created":"2014-11-08","cited_by_count":22},{"id":"1901.03674","title":"On the Global Convergence of Imitation Learning: A Case for Linear Quadratic Regulator","created":"2019-01-11","cited_by_count":21},{"id":"2006.06889","title":"Fast Objective & Duality Gap Convergence for Non-Convex Strongly-Concave Min-Max Problems with PL Condition","created":"2020-06-12","cited_by_count":19},{"id":"1910.07030","title":"SGD Learns One-Layer Networks in WGANs","created":"2019-10-15","cited_by_count":16},{"id":"2005.12649","title":"On the Impossibility of Global Convergence in Multi-Loss Optimization","created":"2020-05-26","cited_by_count":16},{"id":"2106.01761","title":"Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization","created":"2021-06-03","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":"2106.16101","title":"AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization","created":"2021-06-30","cited_by_count":13},{"id":"2110.03950","title":"Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain","created":"2021-10-08","cited_by_count":8},{"id":"2102.11386","title":"Direct-Search for a Class of Stochastic Min-Max Problems","created":"2021-02-22","cited_by_count":7}],"next_cursor":null}