{"total":80,"rows":[{"id":"2208.11195","title":"Robustness to Unbounded Smoothness of Generalized SignSGD","created":"2022-08-23","cited_by_count":81,"area":null},{"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":"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":"2204.02833","title":"High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize","created":"2022-04-06","cited_by_count":40,"area":null},{"id":"2206.13033","title":"Normalized/Clipped SGD with Perturbation for Differentially Private Non-Convex Optimization","created":"2022-06-27","cited_by_count":36,"area":null},{"id":"2305.15155","title":"Momentum Provably Improves Error Feedback!","created":"2023-05-24","cited_by_count":31,"area":null},{"id":"2509.15816","title":"On the Convergence of Muon and Beyond","created":"2025-09-19","cited_by_count":31,"area":null},{"id":"2302.08783","title":"SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variance","created":"2023-02-17","cited_by_count":30,"area":null},{"id":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28,"area":null},{"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,"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":"2303.12277","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","created":"2023-03-22","cited_by_count":20,"area":null},{"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,"area":null},{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17,"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":"2206.11872","title":"Provable Acceleration of Heavy Ball beyond Quadratics for a Class of Polyak-\\L{}ojasiewicz Functions when the Non-Convexity is Averaged-Out","created":"2022-06-22","cited_by_count":11,"area":null},{"id":"2305.18929","title":"Clip21: Error Feedback for Gradient Clipping","created":"2023-05-30","cited_by_count":11,"area":null},{"id":"2506.11214","title":"Complexity of normalized stochastic first-order methods with momentum under heavy-tailed noise","created":"2025-06-12","cited_by_count":11,"area":null},{"id":"2306.11455","title":"Provably Robust Temporal Difference Learning for Heavy-Tailed Rewards","created":"2023-06-20","cited_by_count":9,"area":null},{"id":"2302.06032","title":"Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness","created":"2023-02-13","cited_by_count":7,"area":null},{"id":"2302.07155","title":"EPISODE: Episodic Gradient Clipping with Periodic Resampled Corrections for Federated Learning with Heterogeneous Data","created":"2023-02-14","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":"2302.07851","title":"Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization","created":"2023-02-15","cited_by_count":6,"area":null},{"id":"2307.13680","title":"High Probability Analysis for Non-Convex Stochastic Optimization with Clipping","created":"2023-07-25","cited_by_count":5,"area":null},{"id":"2311.11841","title":"High Probability Guarantees for Random Reshuffling","created":"2023-11-20","cited_by_count":5,"area":null},{"id":"2410.16340","title":"Limit Theorems for Stochastic Gradient Descent with Infinite Variance","created":"2024-10-21","cited_by_count":4,"area":null},{"id":"2510.11676","title":"Accelerated stochastic first-order method for convex optimization under heavy-tailed noise","created":"2025-10-13","cited_by_count":4,"area":null},{"id":"2512.13123","title":"Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences","created":"2025-12-15","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":"2310.10006","title":"Soft ascent-descent as a stable and flexible alternative to flooding","created":"2023-10-16","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":"2510.14009","title":"Noise-Adaptive Layerwise Learning Rates: Accelerating Geometry-Aware Optimization for Deep Neural Network Training","created":"2025-10-15","cited_by_count":3,"area":null},{"id":"2605.18694","title":"Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad","created":"2026-05-18","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":"2607.09097","title":"Solving Stochastic Fixed-Point Equations with High Probability","created":"2026-07-10","cited_by_count":3,"area":null},{"id":"2310.12969","title":"Demystifying the Myths and Legends of Nonconvex Convergence of SGD","created":"2023-10-19","cited_by_count":2,"area":null},{"id":"2311.08745","title":"Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2411.07120","title":"Lean and Mean Adaptive Optimization via Subset-Norm and Subspace-Momentum with Convergence Guarantees","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2511.04456","title":"Federated Stochastic Minimax Optimization under Heavy-Tailed Noises","created":"2025-11-06","cited_by_count":2,"area":null},{"id":"2511.14501","title":"Improved Convergence in Parameter-Agnostic Error Feedback through Momentum","created":"2025-11-18","cited_by_count":2,"area":null},{"id":"2602.01746","title":"Rethinking LoRA for Data Heterogeneous Federated Learning: Subspace and State Alignment","created":"2026-02-02","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":"2603.15059","title":"Muon Converges under Heavy-Tailed Noise: Nonconvex H\\\"{o}lder-Smooth Empirical Risk Minimization","created":"2026-03-16","cited_by_count":2,"area":null},{"id":"2605.18528","title":"Tight Complexity of Muon under Heavy-Tailed Noise","created":"2026-05-18","cited_by_count":2,"area":null},{"id":"2605.26000","title":"Statistical Inference for Stochastic Gradient Descent: Beyond Finite Variance","created":"2026-05-25","cited_by_count":2,"area":null},{"id":"2606.14560","title":"Free Heavy-Tailed Lunch for Muon: A Theoretical Justification of Empirical Success","created":"2026-06-12","cited_by_count":2,"area":null},{"id":"2606.15268","title":"When to use what Schatten-$p$ norm in deep learning?","created":"2026-06-13","cited_by_count":2,"area":null},{"id":"2305.06743","title":"Implicitly normalized forecaster with clipping for linear and non-linear heavy-tailed multi-armed bandits","created":"2023-05-11","cited_by_count":1,"area":null},{"id":"2403.02873","title":"A General Reduction for High-Probability Analysis with General Light-Tailed Distributions","created":"2024-03-05","cited_by_count":1,"area":null},{"id":"2411.06770","title":"Sketched Adaptive Federated Deep Learning: A Sharp Convergence Analysis","created":"2024-11-11","cited_by_count":1,"area":null},{"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,"area":null},{"id":"2509.15543","title":"Nonconvex Decentralized Stochastic Bilevel Optimization under Heavy-Tailed Noise","created":"2025-09-19","cited_by_count":1,"area":null},{"id":"2602.05657","title":"Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization","created":"2026-02-05","cited_by_count":1,"area":null},{"id":"2605.02701","title":"Robust and Fast Training via Per-Sample Clipping","created":"2026-05-04","cited_by_count":1,"area":null},{"id":"2606.14259","title":"Beyond a Single Explanation of the Adam--SGD Gap","created":"2026-06-12","cited_by_count":1,"area":null},{"id":"2607.08104","title":"Vanilla SGD with Momentum Survives Heavy-Tailed Noise: Convergence Analysis without Gradient Clipping or Normalization","created":"2026-07-09","cited_by_count":1,"area":null},{"id":"2306.10278","title":"Adaptive Strategies in Non-convex Optimization","created":"2023-06-17","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":"2408.03619","title":"Making Robust Generalizers Less Rigid with Loss Concentration","created":"2024-08-07","cited_by_count":0,"area":null},{"id":"2507.13283","title":"Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises","created":"2025-07-17","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":"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":"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":"2605.11850","title":"Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives","created":"2026-05-12","cited_by_count":0,"area":null},{"id":"2605.27733","title":"Can Entry-Wise Clipping Give Spectral Control of Stochastic Gradients?","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2606.13287","title":"Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers","created":"2026-06-11","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},{"id":"2607.25785","title":"Variance-Reduced Conditional Gradient Methods under Markovian Sampling for Nonconvex Composite Optimization","created":"2026-07-28","cited_by_count":0,"area":null},{"id":"2609.22115","title":"ZoAQ: Adaptive Zeroth-Order Querying via Query-Reuse Coupling","created":"2026-08-19","cited_by_count":0,"area":null},{"id":"2609.30276","title":"Why Clipping Matters in AdaGrad? Toward a High-Probability Theory under Generalized Smoothness","created":"2026-08-12","cited_by_count":0,"area":null},{"id":"2609.30499","title":"Ordinary Nonconvex SGD under Distance-Dependent Moments: Finite-Horizon Stationarity and Nagaev Bounds","created":"2026-09-24","cited_by_count":0,"area":null},{"id":"2609.30732","title":"TR-SSQP: A Trust-Region Method for Constrained Stochastic Optimization under Heavy-Tailed Noise","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.32195","title":"High-Probability Guarantees for SGD under $\\beta$-Heavy-Tailed Gradient Noise","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.32729","title":"Revisiting AdaGrad in Stochastic Convex Optimization: Last Iterates, High Probability, and Lower Bounds","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.37787","title":"Adam under Generalized Smoothness with Second-Moment-Type Stochastic Gradients","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}