{"total":24,"rows":[{"id":"2502.07529","title":"Training Deep Learning Models with Norm-Constrained LMOs","created":"2025-02-11","cited_by_count":192,"area":null},{"id":"2405.15682","title":"The Road Less Scheduled","created":"2024-05-24","cited_by_count":163,"area":null},{"id":"2310.07831","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","created":"2023-10-11","cited_by_count":43,"area":null},{"id":"2501.18965","title":"The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training","created":"2025-01-31","cited_by_count":33,"area":null},{"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":"2407.04358","title":"An Adaptive Stochastic Gradient Method with Non-negative Gauss-Newton Stepsizes","created":"2024-07-05","cited_by_count":10,"area":null},{"id":"2506.06501","title":"Optimal Rates in Continual Linear Regression via Increasing Regularization","created":"2025-06-06","cited_by_count":8,"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":"2403.12859","title":"Primal Methods for Variational Inequality Problems with Functional Constraints","created":"2024-03-19","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":"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":"2412.17082","title":"MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes","created":"2024-12-22","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":"2503.09411","title":"Learning Rate Annealing Improves Tuning Robustness in Stochastic Optimization","created":"2025-03-12","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":"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":"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}],"next_cursor":null}