{"list":"other","total":58,"rows":[{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"1607.00133","title":"Deep Learning with Differential Privacy","created":"2016-07-01","cited_by_count":2728},{"id":"1606.04838","title":"Optimization Methods for Large-Scale Machine Learning","created":"2016-06-15","cited_by_count":1150},{"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":"1407.0202","title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","created":"2014-07-01","cited_by_count":402},{"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":"1901.06053","title":"A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networks","created":"2019-01-18","cited_by_count":214},{"id":"1312.2139","title":"Optimal rates for zero-order convex optimization: the power of two function evaluations","created":"2013-12-07","cited_by_count":198},{"id":"2006.06914","title":"Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses","created":"2020-06-12","cited_by_count":173},{"id":"2002.03305","title":"Momentum Improves Normalized SGD","created":"2020-02-09","cited_by_count":139},{"id":"1804.07795","title":"Stochastic subgradient method converges on tame functions","created":"2018-04-20","cited_by_count":124},{"id":"2006.08157","title":"Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descent","created":"2020-06-15","cited_by_count":119},{"id":"2008.10898","title":"PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization","created":"2020-08-25","cited_by_count":119},{"id":"2005.10785","title":"Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping","created":"2020-05-21","cited_by_count":104},{"id":"1710.08402","title":"Stability and Generalization of Learning Algorithms that Converge to Global Optima","created":"2017-10-23","cited_by_count":100},{"id":"1902.10710","title":"High probability generalization bounds for uniformly stable algorithms with nearly optimal rate","created":"2019-02-27","cited_by_count":98},{"id":"1910.07833","title":"Sharper bounds for uniformly stable algorithms","created":"2019-10-17","cited_by_count":93},{"id":"1703.01678","title":"Data-Dependent Stability of Stochastic Gradient Descent","created":"2017-03-05","cited_by_count":92},{"id":"1607.06534","title":"The Landscape of Empirical Risk for Non-convex Losses","created":"2016-07-22","cited_by_count":86},{"id":"2102.00931","title":"Information-Theoretic Generalization Bounds for Stochastic Gradient Descent","created":"2021-02-01","cited_by_count":84},{"id":"2305.01588","title":"Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees","created":"2023-05-02","cited_by_count":83},{"id":"2106.14343","title":"High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails","created":"2021-06-28","cited_by_count":80},{"id":"1507.02030","title":"Beyond Convexity: Stochastic Quasi-Convex Optimization","created":"2015-07-08","cited_by_count":76},{"id":"2102.12470","title":"On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)","created":"2021-02-24","cited_by_count":73},{"id":"2302.00999","title":"High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance","created":"2023-02-02","cited_by_count":61},{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","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":"2103.12024","title":"Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$","created":"2021-03-22","cited_by_count":42},{"id":"2412.19529","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","created":"2024-12-27","cited_by_count":42},{"id":"1702.08712","title":"Algorithmic stability and hypothesis complexity","created":"2017-02-28","cited_by_count":39},{"id":"1705.10499","title":"Online to Offline Conversions, Universality and Adaptive Minibatch Sizes","created":"2017-05-30","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":"1810.11059","title":"Uniform Convergence of Gradients for Non-Convex Learning and Optimization","created":"2018-10-25","cited_by_count":38},{"id":"1607.01231","title":"Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization","created":"2016-07-05","cited_by_count":37},{"id":"2102.06489","title":"Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothness","created":"2021-02-12","cited_by_count":37},{"id":"2303.02749","title":"Revisiting the Noise Model of Stochastic Gradient Descent","created":"2023-03-05","cited_by_count":36},{"id":"2305.20057","title":"Three-Way Trade-Off in Multi-Objective Learning: Optimization, Generalization and Conflict-Avoidance","created":"2023-05-31","cited_by_count":36},{"id":"1907.02707","title":"Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method","created":"2019-07-05","cited_by_count":32},{"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":"2202.13441","title":"Stability vs Implicit Bias of Gradient Methods on Separable Data and Beyond","created":"2022-02-27","cited_by_count":29},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29},{"id":"2302.06763","title":"Breaking the Lower Bound with (Little) Structure: Acceleration in Non-Convex Stochastic Optimization with Heavy-Tailed Noise","created":"2023-02-14","cited_by_count":27},{"id":"2206.07082","title":"Stability and Generalization of Stochastic Optimization with Nonconvex and Nonsmooth Problems","created":"2022-06-14","cited_by_count":25},{"id":"2305.12475","title":"Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods","created":"2023-05-21","cited_by_count":23},{"id":"2307.04504","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","created":"2023-07-10","cited_by_count":23},{"id":"2410.16561","title":"Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration","created":"2024-10-21","cited_by_count":18},{"id":"1810.07590","title":"Graphical Convergence of Subgradients in Nonconvex Optimization and Learning","created":"2018-10-17","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":"2508.07473","title":"Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications","created":"2025-08-10","cited_by_count":17},{"id":"2301.11885","title":"Algorithmic Stability of Heavy-Tailed SGD with General Loss Functions","created":"2023-01-27","cited_by_count":15},{"id":"2206.01274","title":"Algorithmic Stability of Heavy-Tailed Stochastic Gradient Descent on Least Squares","created":"2022-06-02","cited_by_count":12},{"id":"2006.06782","title":"Convergence Analysis of Accelerated Stochastic Gradient Descent under the Growth Condition","created":"2020-06-11","cited_by_count":7},{"id":"2205.14278","title":"Generalization Bounds of Nonconvex-(Strongly)-Concave Stochastic Minimax Optimization","created":"2022-05-28","cited_by_count":7},{"id":"2410.05880","title":"Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization","created":"2024-10-08","cited_by_count":4},{"id":"2512.18713","title":"Tight Lower Bounds and Optimal Algorithms for Stochastic Nonconvex Optimization with Heavy-Tailed Noise","created":"2025-12-21","cited_by_count":3},{"id":"2502.00885","title":"Algorithmic Stability of Stochastic Gradient Descent with Momentum under Heavy-Tailed Noise","created":"2025-02-02","cited_by_count":2}],"next_cursor":null}