{"list":"other","total":58,"rows":[{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"id":"1608.03983","title":"SGDR: Stochastic Gradient Descent with Warm Restarts","created":"2016-08-13","cited_by_count":5045},{"id":"1706.02677","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","created":"2017-06-08","cited_by_count":1492},{"id":"1909.05207","title":"Introduction to Online Convex Optimization","created":"2019-09-07","cited_by_count":803},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1904.00962","title":"Large Batch Optimization for Deep Learning: Training BERT in 76 minutes","created":"2019-04-01","cited_by_count":674},{"id":"1405.4980","title":"Convex Optimization: Algorithms and Complexity","created":"2014-05-20","cited_by_count":575},{"id":"1912.13213","title":"Online Learning: A Modern Introduction Using Convex Optimization","created":"2019-12-31","cited_by_count":417},{"id":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1905.10018","title":"Momentum-Based Variance Reduction in Non-Convex SGD","created":"2019-05-24","cited_by_count":306},{"id":"1807.01695","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator","created":"2018-07-04","cited_by_count":287},{"id":"1805.08114","title":"On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizes","created":"2018-05-21","cited_by_count":156},{"id":"2008.03606","title":"Mime: Mimicking Centralized Stochastic Algorithms in Federated Learning","created":"2020-08-08","cited_by_count":154},{"id":"2002.03305","title":"Momentum Improves Normalized SGD","created":"2020-02-09","cited_by_count":139},{"id":"1810.10815","title":"Adaptive Online Learning in Dynamic Environments","created":"2018-10-25","cited_by_count":133},{"id":"1710.11606","title":"Lower Bounds for Finding Stationary Points I","created":"2017-10-31","cited_by_count":126},{"id":"1802.06293","title":"Black-Box Reductions for Parameter-free Online Learning in Banach Spaces","created":"2018-02-17","cited_by_count":125},{"id":"1502.07073","title":"Strongly Adaptive Online Learning","created":"2015-02-25","cited_by_count":107},{"id":"1806.07811","title":"Stochastic Nested Variance Reduction for Nonconvex Optimization","created":"2018-06-20","cited_by_count":63},{"id":"2202.05791","title":"The Power of Adaptivity in SGD: Self-Tuning Step Sizes with Unbounded Gradients and Affine Variance","created":"2022-02-11","cited_by_count":61},{"id":"1711.00841","title":"Lower Bounds for Finding Stationary Points II: First-Order Methods","created":"2017-11-02","cited_by_count":58},{"id":"2002.12242","title":"Lipschitz and Comparator-Norm Adaptivity in Online Learning","created":"2020-02-27","cited_by_count":57},{"id":"1711.02838","title":"Stochastic Cubic Regularization for Fast Nonconvex Optimization","created":"2017-11-08","cited_by_count":55},{"id":"2102.01046","title":"Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications","created":"2021-02-01","cited_by_count":52},{"id":"1610.04578","title":"Improved Strongly Adaptive Online Learning using Coin Betting","created":"2016-10-14","cited_by_count":50},{"id":"1708.08694","title":"Natasha 2: Faster Non-Convex Optimization Than SGD","created":"2017-08-29","cited_by_count":49},{"id":"1705.02766","title":"\"Convex Until Proven Guilty\": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions","created":"2017-05-08","cited_by_count":46},{"id":"2203.00444","title":"Parameter-free Mirror Descent","created":"2022-02-26","cited_by_count":45},{"id":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43},{"id":"1902.00247","title":"Sharp Analysis for Nonconvex SGD Escaping from Saddle Points","created":"2019-02-01","cited_by_count":40},{"id":"2006.13476","title":"Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations","created":"2020-06-24","cited_by_count":40},{"id":"2104.06763","title":"Oracle Complexity in Nonsmooth Nonconvex Optimization","created":"2021-04-14","cited_by_count":39},{"id":"2112.06969","title":"A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions","created":"2021-12-13","cited_by_count":39},{"id":"1802.07543","title":"The Many Faces of Exponential Weights in Online Learning","created":"2018-02-21","cited_by_count":33},{"id":"2112.09002","title":"On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions","created":"2021-12-16","cited_by_count":31},{"id":"1502.05744","title":"Scale-Free Algorithms for Online Linear Optimization","created":"2015-02-19","cited_by_count":30},{"id":"1708.00075","title":"Efficient Regret Minimization in Non-Convex Games","created":"2017-07-31","cited_by_count":28},{"id":"2201.08905","title":"Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond","created":"2022-01-21","cited_by_count":28},{"id":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28},{"id":"2005.08513","title":"Convergence of constant step stochastic gradient descent for non-smooth non-convex functions","created":"2020-05-18","cited_by_count":27},{"id":"2002.05273","title":"A Second look at Exponential and Cosine Step Sizes: Simplicity, Adaptivity, and Performance","created":"2020-02-12","cited_by_count":26},{"id":"1902.09003","title":"Combining Online Learning Guarantees","created":"2019-02-24","cited_by_count":22},{"id":"2202.06151","title":"Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits","created":"2022-02-12","cited_by_count":22},{"id":"2202.07554","title":"Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness","created":"2022-02-15","cited_by_count":21},{"id":"2201.11411","title":"Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the $O(\\epsilon^{-7/4})$ Complexity","created":"2022-01-27","cited_by_count":17},{"id":"2301.06428","title":"Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization","created":"2023-01-16","cited_by_count":17},{"id":"2210.06907","title":"No Dimension-Free Deterministic Algorithm Computes Approximate Stationarities of Lipschitzians","created":"2022-10-13","cited_by_count":16},{"id":"1906.10851","title":"Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions","created":"2019-06-26","cited_by_count":15},{"id":"2102.01623","title":"Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory","created":"2021-02-02","cited_by_count":14},{"id":"2205.15235","title":"Non-convex online learning via algorithmic equivalence","created":"2022-05-30","cited_by_count":11},{"id":"2210.02418","title":"Gradient Descent in the Absence of Global Lipschitz Continuity of the Gradients","created":"2022-10-05","cited_by_count":11},{"id":"1611.01146","title":"Finding Approximate Local Minima Faster than Gradient Descent","created":"2016-11-03","cited_by_count":8},{"id":"2203.01400","title":"Adaptive Gradient Methods with Local Guarantees","created":"2022-03-02","cited_by_count":8},{"id":"2209.10346","title":"On the Complexity of Finding Small Subgradients in Nonsmooth Optimization","created":"2022-09-21","cited_by_count":8},{"id":"2210.09385","title":"Adaptive Oracle-Efficient Online Learning","created":"2022-10-17","cited_by_count":7},{"id":"2209.12463","title":"On the Complexity of Deterministic Nonsmooth and Nonconvex Optimization","created":"2022-09-26","cited_by_count":6},{"id":"2209.14853","title":"META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions","created":"2022-09-29","cited_by_count":5},{"id":"1901.09068","title":"Surrogate Losses for Online Learning of Stepsizes in Stochastic Non-Convex Optimization","created":"2019-01-25","cited_by_count":3}],"next_cursor":null}