{"list":"other","total":53,"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":"1505.07818","title":"Domain-Adversarial Training of Neural Networks","created":"2015-05-28","cited_by_count":3044},{"id":"1704.00028","title":"Improved Training of Wasserstein GANs","created":"2017-03-31","cited_by_count":2235},{"id":"1606.03476","title":"Generative Adversarial Imitation Learning","created":"2016-06-10","cited_by_count":1597},{"id":"1904.09237","title":"On the Convergence of Adam and Beyond","created":"2019-04-19","cited_by_count":841},{"id":"1705.07204","title":"Ensemble Adversarial Training: Attacks and Defenses","created":"2017-05-19","cited_by_count":840},{"id":"1908.03265","title":"On the Variance of the Adaptive Learning Rate and Beyond","created":"2019-08-08","cited_by_count":772},{"id":"1710.10571","title":"Certifying Some Distributional Robustness with Principled Adversarial Training","created":"2017-10-29","cited_by_count":337},{"id":"1701.00160","title":"NIPS 2016 Tutorial: Generative Adversarial Networks","created":"2016-12-31","cited_by_count":285},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1806.01811","title":"AdaGrad stepsizes: Sharp convergence over nonconvex landscapes","created":"2018-06-05","cited_by_count":182},{"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":"1805.08114","title":"On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizes","created":"2018-05-21","cited_by_count":156},{"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":"1802.10551","title":"A Variational Inequality Perspective on Generative Adversarial Networks","created":"2018-02-28","cited_by_count":144},{"id":"2002.10542","title":"Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence","created":"2020-02-24","cited_by_count":137},{"id":"1802.06293","title":"Black-Box Reductions for Parameter-free Online Learning in Banach Spaces","created":"2018-02-17","cited_by_count":125},{"id":"1905.09997","title":"Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates","created":"2019-05-24","cited_by_count":119},{"id":"1902.03736","title":"A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm","created":"2019-02-11","cited_by_count":106},{"id":"1601.01974","title":"Scale-Free Online Learning","created":"2016-01-08","cited_by_count":85},{"id":"2102.07035","title":"Model-free Representation Learning and Exploration in Low-rank MDPs","created":"2021-02-14","cited_by_count":82},{"id":"2002.08872","title":"Halpern Iteration for Near-Optimal and Parameter-Free Monotone Inclusion and Strong Solutions to Variational Inequalities","created":"2020-02-20","cited_by_count":61},{"id":"2007.14294","title":"A High Probability Analysis of Adaptive SGD with Momentum","created":"2020-07-28","cited_by_count":61},{"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":"1910.13857","title":"UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimization","created":"2019-10-30","cited_by_count":56},{"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":"1905.00313","title":"Revisiting the Polyak step size","created":"2019-05-01","cited_by_count":55},{"id":"1809.02864","title":"Online Adaptive Methods, Universality and Acceleration","created":"2018-09-08","cited_by_count":51},{"id":"1706.05507","title":"Variants of RMSProp and Adagrad with Logarithmic Regret Bounds","created":"2017-06-17","cited_by_count":50},{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45},{"id":"2204.02833","title":"High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize","created":"2022-04-06","cited_by_count":40},{"id":"2205.04583","title":"Dynamics of SGD with Stochastic Polyak Stepsizes: Truly Adaptive Variants and Convergence to Exact Solution","created":"2022-05-09","cited_by_count":40},{"id":"1705.10499","title":"Online to Offline Conversions, Universality and Adaptive Minibatch Sizes","created":"2017-05-30","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":"2006.05610","title":"High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise","created":"2020-06-10","cited_by_count":31},{"id":"2010.12100","title":"Adaptive extra-gradient methods for min-max optimization and games","created":"2020-10-22","cited_by_count":30},{"id":"1908.10525","title":"Linear Convergence of Adaptive Stochastic Gradient Descent","created":"2019-08-28","cited_by_count":29},{"id":"1912.11940","title":"Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets","created":"2019-12-26","cited_by_count":29},{"id":"1909.00843","title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent","created":"2019-09-02","cited_by_count":27},{"id":"1902.01637","title":"A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise","created":"2019-02-05","cited_by_count":26},{"id":"2007.13605","title":"Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems","created":"2020-07-27","cited_by_count":26},{"id":"2006.06835","title":"Adaptive Gradient Methods Converge Faster with Over-Parameterization (but you should do a line-search)","created":"2020-06-11","cited_by_count":15},{"id":"2106.16101","title":"AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization","created":"2021-06-30","cited_by_count":13},{"id":"2010.07799","title":"Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence","created":"2020-10-15","cited_by_count":12},{"id":"2109.14213","title":"On the One-sided Convergence of Adam-type Algorithms in Non-convex Non-concave Min-max Optimization","created":"2021-09-29","cited_by_count":9},{"id":"1806.05140","title":"Generalized Mirror Prox for Monotone Variational Inequalities: Universality and Inexact Oracle","created":"2018-06-13","cited_by_count":4},{"id":"2107.08011","title":"Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements","created":"2021-07-16","cited_by_count":4},{"id":"2111.13162","title":"Randomized Stochastic Gradient Descent Ascent","created":"2021-11-25","cited_by_count":3}],"next_cursor":null}