{"total":47,"rows":[{"id":"2406.15244","title":"AdaGrad under Anisotropic Smoothness","created":"2024-06-21","cited_by_count":22,"area":null},{"id":"2402.03982","title":"On Convergence of Adam for Stochastic Optimization under Relaxed Assumptions","created":"2024-02-06","cited_by_count":21,"area":null},{"id":"2406.04592","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","created":"2024-06-07","cited_by_count":16,"area":null},{"id":"2402.13794","title":"Revisiting Convergence of AdaGrad with Relaxed Assumptions","created":"2024-02-21","cited_by_count":15,"area":null},{"id":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2402.03126","title":"How Free is Parameter-Free Stochastic Optimization?","created":"2024-02-05","cited_by_count":12,"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":"2411.07724","title":"Convergence Rate Analysis of LION","created":"2024-11-12","cited_by_count":11,"area":null},{"id":"2308.04077","title":"Federated Zeroth-Order Optimization using Trajectory-Informed Surrogate Gradients","created":"2023-08-08","cited_by_count":8,"area":null},{"id":"2311.02000","title":"High Probability Convergence of Adam Under Unbounded Gradients and Affine Variance Noise","created":"2023-11-03","cited_by_count":8,"area":null},{"id":"2402.11215","title":"AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods","created":"2024-02-17","cited_by_count":8,"area":null},{"id":"2406.01870","title":"Understanding Stochastic Natural Gradient Variational Inference","created":"2024-06-04","cited_by_count":8,"area":null},{"id":"2505.11840","title":"On the $O(\\frac{\\sqrt{d}}{K^{1/4}})$ Convergence Rate of AdamW Measured by $\\ell_1$ Norm","created":"2025-05-17","cited_by_count":8,"area":null},{"id":"2310.18784","title":"High-probability Convergence Bounds for Nonlinear Stochastic Gradient Descent Under Heavy-tailed Noise","created":"2023-10-28","cited_by_count":7,"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":"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":"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":"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":"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":"2311.07411","title":"A Large Deviations Perspective on Policy Gradient Algorithms","created":"2023-11-13","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":"2509.15399","title":"Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization","created":"2025-09-18","cited_by_count":2,"area":null},{"id":"2510.12013","title":"Statistical Guarantees for High-Dimensional Stochastic Gradient Descent","created":"2025-10-13","cited_by_count":2,"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":"2405.02726","title":"A Mathematical Model of the Hidden Feedback Loop Effect in Machine Learning Systems","created":"2024-05-04","cited_by_count":1,"area":null},{"id":"2408.07503","title":"Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching","created":"2024-08-14","cited_by_count":1,"area":null},{"id":"2408.09891","title":"Differential Private Stochastic Optimization with Heavy-tailed Data: Towards Optimal Rates","created":"2024-08-19","cited_by_count":1,"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":"2502.02544","title":"Addressing Label Shift in Distributed Learning via Entropy Regularization","created":"2025-02-04","cited_by_count":1,"area":null},{"id":"2506.08419","title":"Online Learning-guided Learning Rate Adaptation via Gradient Alignment","created":"2025-06-10","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":"2601.20399","title":"Convergence Analysis of Randomized Subspace Normalized SGD under Heavy-Tailed Noise","created":"2026-01-28","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":"2402.00389","title":"On the $O(\\frac{\\sqrt{d}}{T^{1/4}})$ Convergence Rate of RMSProp and Its Momentum Extension Measured by $\\ell_1$ Norm","created":"2024-02-01","cited_by_count":0,"area":null},{"id":"2402.11427","title":"OptEx: Expediting First-Order Optimization with Approximately Parallelized Iterations","created":"2024-02-18","cited_by_count":0,"area":null},{"id":"2503.09411","title":"Learning Rate Annealing Improves Tuning Robustness in Stochastic Optimization","created":"2025-03-12","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":"2602.05304","title":"A Short and Unified Convergence Analysis of the SAG, SAGA, and IAG Algorithms","created":"2026-02-05","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":"2609.12765","title":"High-Probability Convergence of SGD via Batched Updates","created":"2026-09-11","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.31614","title":"Gap-free Differentially Private PCA for Gaussian Data","created":"2026-09-25","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.37425","title":"A stochastic subgradient method with optimal failure exponent","created":"2026-09-29","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}