{"total":32,"rows":[{"id":"2302.14843","title":"High Probability Convergence of Stochastic Gradient Methods","created":"2023-02-28","cited_by_count":49,"area":null},{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49,"area":null},{"id":"2102.10346","title":"Convergence Rates of Stochastic Gradient Descent under Infinite Noise Variance","created":"2021-02-20","cited_by_count":35,"area":null},{"id":"2202.11632","title":"Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance","created":"2022-02-23","cited_by_count":24,"area":null},{"id":"2202.06915","title":"Stochastic linear optimization never overfits with quadratically-bounded losses on general data","created":"2022-02-14","cited_by_count":17,"area":null},{"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,"area":null},{"id":"2206.01095","title":"Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise","created":"2022-06-02","cited_by_count":14,"area":null},{"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,"area":null},{"id":"2305.18929","title":"Clip21: Error Feedback for Gradient Clipping","created":"2023-05-30","cited_by_count":11,"area":null},{"id":"2402.10898","title":"The Price of Adaptivity in Stochastic Convex Optimization","created":"2024-02-16","cited_by_count":11,"area":null},{"id":"2402.17722","title":"Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence","created":"2024-02-27","cited_by_count":11,"area":null},{"id":"2108.11483","title":"Heavy-tailed Streaming Statistical Estimation","created":"2021-08-25","cited_by_count":10,"area":null},{"id":"2208.08567","title":"High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise","created":"2022-08-17","cited_by_count":9,"area":null},{"id":"2211.00969","title":"Large deviations rates for stochastic gradient descent with strongly convex functions","created":"2022-11-02","cited_by_count":9,"area":null},{"id":"2303.18047","title":"Differentially Private Stochastic Convex Optimization in (Non)-Euclidean Space Revisited","created":"2023-03-31","cited_by_count":8,"area":null},{"id":"2312.07142","title":"General Tail Bounds for Non-Smooth Stochastic Mirror Descent","created":"2023-12-12","cited_by_count":7,"area":null},{"id":"2502.04164","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","created":"2025-02-06","cited_by_count":7,"area":null},{"id":"2107.01881","title":"Robust Online Convex Optimization in the Presence of Outliers","created":"2021-07-05","cited_by_count":4,"area":null},{"id":"2509.14952","title":"Stochastic Bilevel Optimization with Heavy-Tailed Noise","created":"2025-09-18","cited_by_count":4,"area":null},{"id":"2203.14434","title":"Flexible risk design using bi-directional dispersion","created":"2022-03-28","cited_by_count":3,"area":null},{"id":"2309.17316","title":"Robust Stochastic Optimization via Gradient Quantile Clipping","created":"2023-09-29","cited_by_count":3,"area":null},{"id":"2510.10690","title":"Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits","created":"2025-10-12","cited_by_count":3,"area":null},{"id":"2602.13413","title":"Why is Normalization Preferred? A Worst-Case Complexity Theory for Stochastically Preconditioned SGD under Heavy-Tailed Noise","created":"2026-02-13","cited_by_count":2,"area":null},{"id":"2105.04129","title":"Parameter-free Gradient Temporal Difference Learning","created":"2021-05-10","cited_by_count":1,"area":null},{"id":"2402.08992","title":"Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method","created":"2024-02-14","cited_by_count":1,"area":null},{"id":"2603.16042","title":"Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2105.11135","title":"Robust learning with anytime-guaranteed feedback","created":"2021-05-24","cited_by_count":0,"area":null},{"id":"2408.03619","title":"Making Robust Generalizers Less Rigid with Loss Concentration","created":"2024-08-07","cited_by_count":0,"area":null},{"id":"2510.15222","title":"Stress-Aware Learning under KL Drift via Trust-Decayed Mirror Descent","created":"2025-10-17","cited_by_count":0,"area":null},{"id":"2601.19730","title":"Stability and Generalization of Stochastic Nonconvex Optimization under Heavy-Tailed Noise: From Gradient Norm to Goldstein Stationarity","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2602.18002","title":"Asynchronous Heavy-Tailed Optimization","created":"2026-02-20","cited_by_count":0,"area":null},{"id":"2606.18778","title":"Online Distributional Prediction via Latent Cluster Geometry Under Drift and Corruption","created":"2026-06-17","cited_by_count":0,"area":null}],"next_cursor":null}