{"total":37,"rows":[{"id":"2508.04860","title":"Can SGD Handle Heavy-Tailed Noise?","created":"2025-08-06","cited_by_count":17,"area":null},{"id":"2508.07473","title":"Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications","created":"2025-08-10","cited_by_count":17,"area":null},{"id":"2504.04579","title":"From Continual Learning to SGD and Back: Better Rates for Continual Linear Models","created":"2025-04-06","cited_by_count":12,"area":null},{"id":"2507.11274","title":"Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime","created":"2025-07-15","cited_by_count":12,"area":null},{"id":"2403.07723","title":"On the Last-Iterate Convergence of Shuffling Gradient Methods","created":"2024-03-12","cited_by_count":11,"area":null},{"id":"2403.06873","title":"Last Iterate Convergence of Incremental Methods and Applications in Continual Learning","created":"2024-03-11","cited_by_count":10,"area":null},{"id":"2501.02761","title":"Beyond $\\mathcal{O}(\\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming","created":"2025-01-06","cited_by_count":4,"area":null},{"id":"2509.07972","title":"Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence","created":"2025-09-09","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":"2604.13870","title":"Gradient Descent's Last Iterate is Often (slightly) Suboptimal","created":"2026-04-15","cited_by_count":4,"area":null},{"id":"2505.11434","title":"Controlling the Flow: Stability and Convergence for Stochastic Gradient Descent with Decaying Regularization","created":"2025-05-16","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":"2505.17965","title":"Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2604.09909","title":"Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size","created":"2026-04-10","cited_by_count":2,"area":null},{"id":"2507.04194","title":"Mixed-Sample SGD: an End-to-end Analysis of Supervised Transfer Learning","created":"2025-07-06","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":"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":"2607.27073","title":"Parameter-Free Dynamic Regret under Heavy-Tailed Noise","created":"2026-07-29","cited_by_count":1,"area":null},{"id":"2609.08537","title":"The Exact Time-Uniform Rate Frontier for Stochastic Gradient Descent on Smooth Convex Objectives","created":"2026-09-08","cited_by_count":1,"area":null},{"id":"2409.02052","title":"Robust Fourier Neural Networks","created":"2024-09-03","cited_by_count":0,"area":null},{"id":"2412.06070","title":"Stochastic Gradient Descent Revisited","created":"2024-12-08","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":"2505.24737","title":"Adapting to Linear Separable Subsets with Large-Margin in Differentially Private Learning","created":"2025-05-30","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.05489","title":"Convergence Rate of the Last Iterate of Stochastic Proximal 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":"2606.24879","title":"New Bounds for the Last Iterate of the Stochastic subGradient Method","created":"2026-06-23","cited_by_count":0,"area":null},{"id":"2606.28123","title":"Dangerous Liaisons of Convex Learning and Non-Affine Aggregation","created":"2026-06-26","cited_by_count":0,"area":null},{"id":"2606.29593","title":"How AI settled the complexity of the oldest SGD algorithm","created":"2026-06-28","cited_by_count":0,"area":null},{"id":"2607.10959","title":"WSqD: A Horizon-Free Learning Rate Schedule for Large Model Training","created":"2026-07-12","cited_by_count":0,"area":null},{"id":"2609.06064","title":"The Role of Gradient Modification in Heavy-Tailed Nonconvex Stochastic Min-Max Optimization","created":"2026-09-05","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.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":"2610.01599","title":"Convergence Analysis of STORM Under Different Geometries","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.06070","title":"Last-Iterate Convergence Rate of Normalized Gradient Descent under H\\\"older Smoothness","created":"2026-10-05","cited_by_count":0,"area":null},{"id":"2610.14942","title":"Probabilistic Multi-Source Data Selection via Learnable Categorical Priors: Variance Reduction and Guaranteed Derandomization","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}