{"total":32,"rows":[{"id":"2106.10435","title":"STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning","created":"2021-06-19","cited_by_count":43,"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":"2302.06570","title":"Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD","created":"2023-02-13","cited_by_count":41,"area":null},{"id":"2102.06704","title":"Proximal and Federated Random Reshuffling","created":"2021-02-12","cited_by_count":33,"area":null},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"area":null},{"id":"2402.02009","title":"Robust Multi-Task Learning with Excess Risks","created":"2024-02-03","cited_by_count":24,"area":null},{"id":"2305.12475","title":"Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods","created":"2023-05-21","cited_by_count":23,"area":null},{"id":"2102.09393","title":"On the Convergence of Step Decay Step-Size for Stochastic Optimization","created":"2021-02-18","cited_by_count":21,"area":null},{"id":"2104.09342","title":"Random Reshuffling with Variance Reduction: New Analysis and Better Rates","created":"2021-04-19","cited_by_count":19,"area":null},{"id":"2411.02853","title":"ADOPT: Modified Adam Can Converge with Any $\\beta_2$ with the Optimal Rate","created":"2024-11-05","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":"2306.08553","title":"Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach","created":"2023-06-14","cited_by_count":14,"area":null},{"id":"2305.15659","title":"How to escape sharp minima with random perturbations","created":"2023-05-25","cited_by_count":13,"area":null},{"id":"2301.13314","title":"Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization","created":"2023-01-30","cited_by_count":11,"area":null},{"id":"2305.16569","title":"Accelerating Value Iteration with Anchoring","created":"2023-05-26","cited_by_count":11,"area":null},{"id":"2210.09382","title":"Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems","created":"2022-10-17","cited_by_count":7,"area":null},{"id":"2301.08940","title":"Quasi-optimal Reinforcement Learning with Continuous Actions","created":"2023-01-21","cited_by_count":7,"area":null},{"id":"2110.04844","title":"Frequency-aware SGD for Efficient Embedding Learning with Provable Benefits","created":"2021-10-10","cited_by_count":6,"area":null},{"id":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2208.11879","title":"A simplified convergence theory for Byzantine resilient stochastic gradient descent","created":"2022-08-25","cited_by_count":3,"area":null},{"id":"2410.00242","title":"Quantized and Asynchronous Federated Learning","created":"2024-09-30","cited_by_count":3,"area":null},{"id":"2106.02888","title":"Bandwidth-based Step-Sizes for Non-Convex Stochastic Optimization","created":"2021-06-05","cited_by_count":2,"area":null},{"id":"2111.03820","title":"Distributed stochastic proximal algorithm with random reshuffling for non-smooth finite-sum optimization","created":"2021-11-06","cited_by_count":2,"area":null},{"id":"2502.14648","title":"Variance Reduction Methods Do Not Need to Compute Full Gradients: Improved Efficiency through Shuffling","created":"2025-02-20","cited_by_count":2,"area":null},{"id":"2605.06615","title":"When and Why SignSGD Outperforms SGD: A Theoretical Study Based on $\\ell_1$-norm Lower Bounds","created":"2026-05-07","cited_by_count":2,"area":null},{"id":"2206.00632","title":"Computing the Variance of Shuffling Stochastic Gradient Algorithms via Power Spectral Density Analysis","created":"2022-06-01","cited_by_count":1,"area":null},{"id":"2305.03547","title":"Over-the-Air Federated Averaging with Limited Power and Privacy Budgets","created":"2023-05-05","cited_by_count":1,"area":null},{"id":"2604.10373","title":"Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD","created":"2026-04-11","cited_by_count":1,"area":null},{"id":"2605.15388","title":"Unified High-Probability Analysis of Stochastic Variance-Reduced Estimation","created":"2026-05-14","cited_by_count":1,"area":null},{"id":"2311.13877","title":"Locally Optimal Descent for Dynamic Stepsize Scheduling","created":"2023-11-23","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":"2609.39114","title":"The Row Normalization Puzzle in Muon","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}