{"total":21,"rows":[{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49,"area":null},{"id":"2412.19529","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","created":"2024-12-27","cited_by_count":42,"area":null},{"id":"2506.04192","title":"Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise","created":"2025-06-04","cited_by_count":41,"area":null},{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17,"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":"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,"area":null},{"id":"2502.04164","title":"Efficient Distributed Optimization under Heavy-Tailed Noise","created":"2025-02-06","cited_by_count":7,"area":null},{"id":"2402.07062","title":"Fast UCB-type algorithms for stochastic bandits with heavy and super heavy symmetric noise","created":"2024-02-10","cited_by_count":3,"area":null},{"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,"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":"2606.00520","title":"In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise","created":"2026-05-30","cited_by_count":3,"area":null},{"id":"2512.21749","title":"Approximation Capabilities of Feedforward Neural Networks with GELU Activations","created":"2025-12-25","cited_by_count":2,"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":"2410.13954","title":"Nonlinear Stochastic Gradient Descent and Heavy-tailed Noise: A Unified Framework and High-probability Guarantees","created":"2024-10-17","cited_by_count":1,"area":null},{"id":"2510.06141","title":"High-Probability Convergence Guarantees of Decentralized SGD","created":"2025-10-07","cited_by_count":1,"area":null},{"id":"2402.12828","title":"Tracking the Median of Gradients with a Stochastic Proximal Point Method","created":"2024-02-20","cited_by_count":0,"area":null},{"id":"2405.14741","title":"Subsampled Ensemble Can Improve Generalization Tail Exponentially","created":"2024-05-23","cited_by_count":0,"area":null},{"id":"2512.14686","title":"Bias-Variance Trade-off for Clipped Stochastic First-Order Methods: From Bounded Variance to Infinite Mean","created":"2025-12-16","cited_by_count":0,"area":null},{"id":"2605.00281","title":"High-Probability Convergence in Decentralized Stochastic Optimization with Gradient Tracking","created":"2026-04-30","cited_by_count":0,"area":null},{"id":"2605.07634","title":"Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2606.26316","title":"High-Probability PL-SGD with Markovian Noise: Optimal Mixing and Tail Dependence","created":"2026-06-24","cited_by_count":0,"area":null}],"next_cursor":null}