{"list":"other","total":55,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1608.06993","title":"Densely Connected Convolutional Networks","created":"2016-08-25","cited_by_count":6720},{"id":"1904.09237","title":"On the Convergence of Adam and Beyond","created":"2019-04-19","cited_by_count":841},{"id":"1509.01240","title":"Train faster, generalize better: Stability of stochastic gradient descent","created":"2015-09-03","cited_by_count":552},{"id":"2003.10422","title":"A Unified Theory of Decentralized SGD with Changing Topology and Local Updates","created":"2020-03-23","cited_by_count":367},{"id":"1901.09401","title":"SGD: General Analysis and Improved Rates","created":"2019-01-27","cited_by_count":207},{"id":"1808.00387","title":"Just Interpolate: Kernel \"Ridgeless\" Regression Can Generalize","created":"2018-08-01","cited_by_count":190},{"id":"1806.01811","title":"AdaGrad stepsizes: Sharp convergence over nonconvex landscapes","created":"2018-06-05","cited_by_count":182},{"id":"2003.02395","title":"A Simple Convergence Proof of Adam and Adagrad","created":"2020-03-05","cited_by_count":171},{"id":"2301.11235","title":"Handbook of Convergence Theorems for (Stochastic) Gradient Methods","created":"2023-01-26","cited_by_count":163},{"id":"1805.08114","title":"On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizes","created":"2018-05-21","cited_by_count":156},{"id":"1811.10792","title":"Stochastic Gradient Push for Distributed Deep Learning","created":"2018-11-27","cited_by_count":152},{"id":"1712.06559","title":"The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learning","created":"2017-12-18","cited_by_count":150},{"id":"1810.07288","title":"Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptron","created":"2018-10-16","cited_by_count":143},{"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":"1310.5715","title":"Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithm","created":"2013-10-21","cited_by_count":133},{"id":"1905.09997","title":"Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates","created":"2019-05-24","cited_by_count":119},{"id":"2007.07989","title":"An Improved Analysis of Stochastic Gradient Descent with Momentum","created":"2020-07-15","cited_by_count":119},{"id":"1802.03801","title":"SGD and Hogwild! Convergence Without the Bounded Gradients Assumption","created":"2018-02-11","cited_by_count":95},{"id":"2006.10311","title":"SGD for Structured Nonconvex Functions: Learning Rates, Minibatching and Interpolation","created":"2020-06-18","cited_by_count":67},{"id":"1412.7457","title":"Global convergence of the Heavy-ball method for convex optimization","created":"2014-12-23","cited_by_count":61},{"id":"1810.05633","title":"Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity","created":"2018-10-12","cited_by_count":61},{"id":"1808.10396","title":"A Unified Analysis of Stochastic Momentum Methods for Deep Learning","created":"2018-08-30","cited_by_count":55},{"id":"1905.00313","title":"Revisiting the Polyak step size","created":"2019-05-01","cited_by_count":55},{"id":"1308.6370","title":"Fast Convergence of Stochastic Gradient Descent under a Strong Growth Condition","created":"2013-08-29","cited_by_count":54},{"id":"1712.09677","title":"Momentum and Stochastic Momentum for Stochastic Gradient, Newton, Proximal Point and Subspace Descent Methods","created":"2017-12-27","cited_by_count":49},{"id":"1803.05591","title":"On the insufficiency of existing momentum schemes for Stochastic Optimization","created":"2018-03-15","cited_by_count":49},{"id":"1810.06801","title":"Quasi-hyperbolic momentum and Adam for deep learning","created":"2018-10-16","cited_by_count":48},{"id":"1906.05661","title":"Training Neural Networks for and by Interpolation","created":"2019-06-13","cited_by_count":45},{"id":"1910.13962","title":"Understanding the Role of Momentum in Stochastic Gradient Methods","created":"2019-10-30","cited_by_count":44},{"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":"2006.11573","title":"Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimization","created":"2020-06-20","cited_by_count":36},{"id":"1605.04131","title":"Barzilai-Borwein Step Size for Stochastic Gradient Descent","created":"2016-05-13","cited_by_count":33},{"id":"1803.02461","title":"Subgradient methods for sharp weakly convex functions","created":"2018-03-06","cited_by_count":33},{"id":"1903.08619","title":"The importance of better models in stochastic optimization","created":"2019-03-20","cited_by_count":32},{"id":"2007.04202","title":"Stochastic Hamiltonian Gradient Methods for Smooth Games","created":"2020-07-08","cited_by_count":32},{"id":"2111.08611","title":"Stochastic Extragradient: General Analysis and Improved Rates","created":"2021-11-16","cited_by_count":31},{"id":"1802.05074","title":"L4: Practical loss-based stepsize adaptation for deep learning","created":"2018-02-14","cited_by_count":26},{"id":"2305.07583","title":"MoMo: Momentum Models for Adaptive Learning Rates","created":"2023-05-12","cited_by_count":24},{"id":"2308.06058","title":"Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction","created":"2023-08-11","cited_by_count":23},{"id":"2110.15412","title":"Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize","created":"2021-10-28","cited_by_count":22},{"id":"2202.12328","title":"Cutting Some Slack for SGD with Adaptive Polyak Stepsizes","created":"2022-02-24","cited_by_count":18},{"id":"2102.09700","title":"AI-SARAH: Adaptive and Implicit Stochastic Recursive Gradient Methods","created":"2021-02-19","cited_by_count":15},{"id":"2301.04935","title":"A Stochastic Proximal Polyak Step Size","created":"2023-01-12","cited_by_count":15},{"id":"2305.12939","title":"Generalized Polyak Step Size for First Order Optimization with Momentum","created":"2023-05-22","cited_by_count":15},{"id":"2101.02696","title":"Accelerated, Optimal, and Parallel: Some Results on Model-Based Stochastic Optimization","created":"2021-01-07","cited_by_count":14},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","cited_by_count":14},{"id":"2207.08171","title":"SP2: A Second Order Stochastic Polyak Method","created":"2022-07-17","cited_by_count":13},{"id":"1903.08688","title":"Stochastic Gradient Descent with Polyak's Learning Rate","created":"2019-03-20","cited_by_count":11},{"id":"2206.11872","title":"Provable Acceleration of Heavy Ball beyond Quadratics for a Class of Polyak-\\L{}ojasiewicz Functions when the Non-Convexity is Averaged-Out","created":"2022-06-22","cited_by_count":11},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-26","cited_by_count":8},{"id":"2403.02648","title":"Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad","created":"2024-03-05","cited_by_count":8},{"id":"2002.00915","title":"Complexity Guarantees for Polyak Steps with Momentum","created":"2020-02-03","cited_by_count":7},{"id":"2312.17369","title":"SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms","created":"2023-12-28","cited_by_count":5},{"id":"2305.05482","title":"On adaptive stochastic heavy ball momentum for solving linear systems","created":"2023-05-09","cited_by_count":3}],"next_cursor":null}