{"list":"other","total":54,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"2302.13971","title":"LLaMA: Open and Efficient Foundation Language Models","created":"2023-02-27","cited_by_count":14132},{"id":"2205.01068","title":"OPT: Open Pre-trained Transformer Language Models","created":"2022-05-02","cited_by_count":3512},{"id":"2203.15556","title":"Training Compute-Optimal Large Language Models","created":"2022-03-29","cited_by_count":3019},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1705.08551","title":"Safe Model-based Reinforcement Learning with Stability Guarantees","created":"2017-05-23","cited_by_count":366},{"id":"1905.11881","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","created":"2019-05-28","cited_by_count":341},{"id":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1906.04893","title":"Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networks","created":"2019-06-12","cited_by_count":293},{"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":"2006.04710","title":"The Lipschitz Constant of Self-Attention","created":"2020-06-08","cited_by_count":174},{"id":"2002.03329","title":"Better Theory for SGD in the Nonconvex World","created":"2020-02-09","cited_by_count":158},{"id":"1805.08114","title":"On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizes","created":"2018-05-21","cited_by_count":156},{"id":"2006.04740","title":"The Heavy-Tail Phenomenon in SGD","created":"2020-06-08","cited_by_count":124},{"id":"2007.07989","title":"An Improved Analysis of Stochastic Gradient Descent with Momentum","created":"2020-07-15","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":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99},{"id":"1812.05217","title":"Tight Analyses for Non-Smooth Stochastic Gradient Descent","created":"2018-12-13","cited_by_count":97},{"id":"2010.02519","title":"Improved Analysis of Clipping Algorithms for Non-convex Optimization","created":"2020-10-05","cited_by_count":89},{"id":"2006.11144","title":"On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems","created":"2020-06-19","cited_by_count":80},{"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":"2106.13673","title":"Understanding Clipping for Federated Learning: Convergence and Client-Level Differential Privacy","created":"2021-06-25","cited_by_count":69},{"id":"2007.14294","title":"A High Probability Analysis of Adaptive SGD with Momentum","created":"2020-07-28","cited_by_count":61},{"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":"1903.01014","title":"Lipschitz Certificates for Layered Network Structures Driven by Averaged Activation Operators","created":"2019-03-03","cited_by_count":55},{"id":"2210.01787","title":"Rethinking Lipschitz Neural Networks and Certified Robustness: A Boolean Function Perspective","created":"2022-10-04","cited_by_count":51},{"id":"2302.14843","title":"High Probability Convergence of Stochastic Gradient Methods","created":"2023-02-28","cited_by_count":49},{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49},{"id":"2306.01264","title":"Convex and Non-convex Optimization Under Generalized Smoothness","created":"2023-06-02","cited_by_count":44},{"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":"2312.08531","title":"Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods","created":"2023-12-13","cited_by_count":38},{"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":"1808.01415","title":"On Lipschitz Bounds of General Convolutional Neural Networks","created":"2018-08-04","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":"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":"2406.09241","title":"What is the long-run distribution of stochastic gradient descent? A large deviations analysis","created":"2024-06-13","cited_by_count":17},{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17},{"id":"2204.02593","title":"Nonlinear gradient mappings and stochastic optimization: A general framework with applications to heavy-tail noise","created":"2022-04-06","cited_by_count":16},{"id":"2502.07923","title":"Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness","created":"2025-02-11","cited_by_count":13},{"id":"2402.10898","title":"The Price of Adaptivity in Stochastic Convex Optimization","created":"2024-02-16","cited_by_count":11},{"id":"2208.08567","title":"High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise","created":"2022-08-17","cited_by_count":9},{"id":"2211.00969","title":"Large deviations rates for stochastic gradient descent with strongly convex functions","created":"2022-11-02","cited_by_count":9},{"id":"2503.16398","title":"The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations","created":"2025-03-20","cited_by_count":8},{"id":"2312.07142","title":"General Tail Bounds for Non-Smooth Stochastic Mirror Descent","created":"2023-12-12","cited_by_count":7},{"id":"2410.15637","title":"Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-tailed Noise and Power of Symmetry","created":"2024-10-21","cited_by_count":7},{"id":"2207.10939","title":"Statistical Hypothesis Testing Based on Machine Learning: Large Deviations Analysis","created":"2022-07-22","cited_by_count":6},{"id":"1601.07011","title":"Distributed Detection over Adaptive Networks: Refined Asymptotics and the Role of Connectivity","created":"2016-01-26","cited_by_count":5},{"id":"2202.00720","title":"Gradient Based Clustering","created":"2022-02-01","cited_by_count":5},{"id":"2208.05236","title":"Inaccuracy rates for distributed inference over random networks with applications to social learning","created":"2022-08-10","cited_by_count":5},{"id":"2507.09093","title":"Sharp High-Probability Rates for Nonlinear SGD under Heavy-Tailed Noise via Symmetrization","created":"2025-07-12","cited_by_count":3},{"id":"2311.07411","title":"A Large Deviations Perspective on Policy Gradient Algorithms","created":"2023-11-13","cited_by_count":2},{"id":"2509.13628","title":"Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds","created":"2025-09-17","cited_by_count":1}],"next_cursor":null}