{"list":"other","total":53,"rows":[{"id":"1412.6572","title":"Explaining and Harnessing Adversarial Examples","created":"2014-12-20","cited_by_count":7364},{"id":"1606.03498","title":"Improved Techniques for Training GANs","created":"2016-06-10","cited_by_count":2970},{"id":"1704.00028","title":"Improved Training of Wasserstein GANs","created":"2017-03-31","cited_by_count":2235},{"id":"2010.01412","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","created":"2020-10-03","cited_by_count":1417},{"id":"1904.09237","title":"On the Convergence of Adam and Beyond","created":"2019-04-19","cited_by_count":841},{"id":"2103.00065","title":"Gradient Descent on Neural Networks Typically Occurs at the Edge of Stability","created":"2021-02-26","cited_by_count":427},{"id":"1711.00141","title":"Training GANs with Optimism","created":"2017-10-31","cited_by_count":217},{"id":"1503.01243","title":"A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights","created":"2015-03-04","cited_by_count":206},{"id":"1808.02941","title":"On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimization","created":"2018-08-08","cited_by_count":174},{"id":"2003.02395","title":"A Simple Convergence Proof of Adam and Adagrad","created":"2020-03-05","cited_by_count":171},{"id":"2009.11162","title":"Implicit Gradient Regularization","created":"2020-09-23","cited_by_count":146},{"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":"1811.09358","title":"A Sufficient Condition for Convergences of Adam and RMSProp","created":"2018-11-23","cited_by_count":126},{"id":"2208.09632","title":"Adam Can Converge Without Any Modification On Update Rules","created":"2022-08-20","cited_by_count":114},{"id":"1603.04245","title":"A Variational Perspective on Accelerated Methods in Optimization","created":"2016-03-14","cited_by_count":110},{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99},{"id":"1810.08907","title":"Understanding the Acceleration Phenomenon via High-Resolution Differential Equations","created":"2018-10-21","cited_by_count":69},{"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":"1706.04156","title":"Gradient descent GAN optimization is locally stable","created":"2017-06-13","cited_by_count":67},{"id":"2410.24206","title":"Understanding Optimization in Deep Learning with Central Flows","created":"2024-10-31","cited_by_count":64},{"id":"1807.04740","title":"Negative Momentum for Improved Game Dynamics","created":"2018-07-12","cited_by_count":60},{"id":"2106.07631","title":"Improved Transformer for High-Resolution GANs","created":"2021-06-14","cited_by_count":59},{"id":"2303.03108","title":"Gradient Norm Aware Minimization Seeks First-Order Flatness and Improves Generalization","created":"2023-03-03","cited_by_count":57},{"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":"2012.06244","title":"The Implicit Bias for Adaptive Optimization Algorithms on Homogeneous Neural Networks","created":"2020-12-11","cited_by_count":46},{"id":"1905.04926","title":"Differentiable Game Mechanics","created":"2019-05-13","cited_by_count":43},{"id":"2310.17998","title":"Closing the Gap Between the Upper Bound and the Lower Bound of Adam's Iteration Complexity","created":"2023-10-27","cited_by_count":38},{"id":"2406.10650","title":"The Implicit Bias of Adam on Separable Data","created":"2024-06-15","cited_by_count":36},{"id":"2009.06125","title":"A Qualitative Study of the Dynamic Behavior for Adaptive Gradient Algorithms","created":"2020-09-14","cited_by_count":33},{"id":"2102.09468","title":"Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization","created":"2021-02-18","cited_by_count":31},{"id":"2208.09900","title":"Provable Adaptivity of Adam under Non-uniform Smoothness","created":"2022-08-21","cited_by_count":30},{"id":"1907.04392","title":"Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent","created":"2019-07-09","cited_by_count":29},{"id":"2307.11108","title":"Flatness-Aware Minimization for Domain Generalization","created":"2023-07-20","cited_by_count":27},{"id":"2309.00079","title":"On the Implicit Bias of Adam","created":"2023-08-31","cited_by_count":27},{"id":"2302.00849","title":"Implicit regularization in Heavy-ball momentum accelerated stochastic gradient descent","created":"2023-02-02","cited_by_count":25},{"id":"2411.15958","title":"Adaptive Methods through the Lens of SDEs: Theoretical Insights on the Role of Noise","created":"2024-11-24","cited_by_count":23},{"id":"2110.03891","title":"Does Momentum Change the Implicit Regularization on Separable Data?","created":"2021-10-08","cited_by_count":22},{"id":"2402.03982","title":"On Convergence of Adam for Stochastic Optimization under Relaxed Assumptions","created":"2024-02-06","cited_by_count":21},{"id":"2005.13996","title":"Chaos, Extremism and Optimism: Volume Analysis of Learning in Games","created":"2020-05-28","cited_by_count":16},{"id":"2012.05640","title":"Asymptotic study of stochastic adaptive algorithm in non-convex landscape","created":"2020-12-10","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":"2105.13922","title":"Discretization Drift in Two-Player Games","created":"2021-05-28","cited_by_count":14},{"id":"2207.00957","title":"On Convergence of Gradient Descent Ascent: A Tight Local Analysis","created":"2022-07-03","cited_by_count":9},{"id":"2107.08341","title":"New First-Order Algorithms for Stochastic Variational Inequalities","created":"2021-07-18","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":"2003.07886","title":"A Relaxed Inertial Forward-Backward-Forward Algorithm for Solving Monotone Inclusions with Application to GANs","created":"2020-03-17","cited_by_count":6},{"id":"2106.03579","title":"Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games","created":"2021-06-07","cited_by_count":6},{"id":"2402.12508","title":"SDEs for Minimax Optimization","created":"2024-02-19","cited_by_count":6},{"id":"2102.09804","title":"Local Convergence of Adaptive Gradient Descent Optimizers","created":"2021-02-19","cited_by_count":5},{"id":"2304.00771","title":"Continuous-time Analysis of Anchor Acceleration","created":"2023-04-03","cited_by_count":4},{"id":"2505.19537","title":"Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games","created":"2025-05-26","cited_by_count":3},{"id":"2412.20365","title":"Accelerated regularized learning in finite N-person games","created":"2024-12-29","cited_by_count":2},{"id":"2405.13392","title":"Local convergence of simultaneous min-max algorithms to differential equilibrium on Riemannian manifold","created":"2024-05-22","cited_by_count":1}],"next_cursor":null}