{"total":63,"rows":[{"id":"2102.07367","title":"A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentum","created":"2021-02-15","cited_by_count":106,"area":null},{"id":"2411.10438","title":"MARS: Unleashing the Power of Variance Reduction for Training Large Models","created":"2024-11-15","cited_by_count":64,"area":null},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"area":null},{"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":"2102.03198","title":"Bias-Variance Reduced Local SGD for Less Heterogeneous Federated Learning","created":"2021-02-05","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":"2103.01447","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","created":"2021-03-02","cited_by_count":29,"area":null},{"id":"2107.12301","title":"Enhanced Bilevel Optimization via Bregman Distance","created":"2021-07-26","cited_by_count":28,"area":null},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24,"area":null},{"id":"2303.00883","title":"Variance-reduced Clipping for Non-convex Optimization","created":"2023-03-02","cited_by_count":22,"area":null},{"id":"2102.06752","title":"A Hybrid Variance-Reduced Method for Decentralized Stochastic Non-Convex Optimization","created":"2021-02-12","cited_by_count":21,"area":null},{"id":"2106.13792","title":"Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descent","created":"2021-06-25","cited_by_count":21,"area":null},{"id":"2108.04755","title":"FedPAGE: A Fast Local Stochastic Gradient Method for Communication-Efficient Federated Learning","created":"2021-08-10","cited_by_count":20,"area":null},{"id":"2104.13326","title":"Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization","created":"2021-04-27","cited_by_count":19,"area":null},{"id":"2203.09436","title":"Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions","created":"2022-03-17","cited_by_count":19,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"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":"2110.01663","title":"Global Convergence and Stability of Stochastic Gradient Descent","created":"2021-10-04","cited_by_count":17,"area":null},{"id":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17,"area":null},{"id":"2603.28254","title":"MuonEq: Balancing Before Orthogonalization with Lightweight Equilibration","created":"2026-03-30","cited_by_count":17,"area":null},{"id":"2110.01165","title":"DESTRESS: Computation-Optimal and Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization","created":"2021-10-04","cited_by_count":16,"area":null},{"id":"2103.03265","title":"Better SGD using Second-order Momentum","created":"2021-03-04","cited_by_count":15,"area":null},{"id":"2211.01851","title":"Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization","created":"2022-11-03","cited_by_count":15,"area":null},{"id":"2112.13097","title":"Faster Rates for Compressed Federated Learning with Client-Variance Reduction","created":"2021-12-24","cited_by_count":14,"area":null},{"id":"2206.05891","title":"Anchor Sampling for Federated Learning with Partial Client Participation","created":"2022-06-13","cited_by_count":14,"area":null},{"id":"2406.00489","title":"Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction","created":"2024-06-01","cited_by_count":13,"area":null},{"id":"2403.12338","title":"Stochastic Halpern iteration in normed spaces and applications to reinforcement learning","created":"2024-03-19","cited_by_count":12,"area":"deeprl"},{"id":"2111.14069","title":"Escape saddle points by a simple gradient-descent based algorithm","created":"2021-11-28","cited_by_count":11,"area":null},{"id":"2206.02275","title":"Sharper Rates and Flexible Framework for Nonconvex SGD with Client and Data Sampling","created":"2022-06-05","cited_by_count":10,"area":null},{"id":"2210.06328","title":"Momentum Aggregation for Private Non-convex ERM","created":"2022-10-12","cited_by_count":10,"area":null},{"id":"2510.21800","title":"MARS-M: When Variance Reduction Meets Matrices","created":"2025-10-20","cited_by_count":10,"area":null},{"id":"2103.11333","title":"ANITA: An Optimal Loopless Accelerated Variance-Reduced Gradient Method","created":"2021-03-21","cited_by_count":9,"area":null},{"id":"2212.05088","title":"Cyclic Block Coordinate Descent With Variance Reduction for Composite Nonconvex Optimization","created":"2022-12-09","cited_by_count":9,"area":null},{"id":"2109.00534","title":"The Minimax Complexity of Distributed Optimization","created":"2021-09-01","cited_by_count":7,"area":null},{"id":"2311.05589","title":"A Coefficient Makes SVRG Effective","created":"2023-11-09","cited_by_count":7,"area":null},{"id":"2106.10708","title":"Memory Augmented Optimizers for Deep Learning","created":"2021-06-20","cited_by_count":5,"area":null},{"id":"2110.15601","title":"Whole Brain Segmentation with Full Volume Neural Network","created":"2021-10-29","cited_by_count":5,"area":null},{"id":"2208.10025","title":"Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization","created":"2022-08-22","cited_by_count":5,"area":null},{"id":"2307.15868","title":"Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\\L}ojasiewicz Conditions","created":"2023-07-29","cited_by_count":5,"area":null},{"id":"2405.15545","title":"Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations","created":"2024-05-24","cited_by_count":5,"area":null},{"id":"2105.12062","title":"Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums","created":"2021-05-25","cited_by_count":4,"area":null},{"id":"2111.01040","title":"STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization","created":"2021-11-01","cited_by_count":4,"area":null},{"id":"2201.12302","title":"Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction","created":"2022-01-28","cited_by_count":4,"area":null},{"id":"2301.00631","title":"Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimization","created":"2023-01-02","cited_by_count":3,"area":null},{"id":"2406.02413","title":"Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems","created":"2024-06-04","cited_by_count":3,"area":null},{"id":"2406.16666","title":"Cubic regularized subspace Newton for non-convex optimization","created":"2024-06-24","cited_by_count":3,"area":null},{"id":"2510.03167","title":"Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism","created":"2025-10-03","cited_by_count":3,"area":null},{"id":"2310.15976","title":"Convergence of Sign-based Random Reshuffling Algorithms for Nonconvex Optimization","created":"2023-10-24","cited_by_count":2,"area":null},{"id":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2403.15244","title":"A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness","created":"2024-03-22","cited_by_count":1,"area":null},{"id":"2409.00459","title":"Gradient-Free Method for Heavily Constrained Nonconvex Optimization","created":"2024-08-31","cited_by_count":1,"area":null},{"id":"2410.06878","title":"Noise is All You Need: Private Second-Order Convergence of Noisy SGD","created":"2024-10-09","cited_by_count":1,"area":null},{"id":"2605.09331","title":"Dimension-Free Saddle-Point Escape in Muon","created":"2026-05-10","cited_by_count":1,"area":null},{"id":"2606.05438","title":"Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2607.14536","title":"Muse: Representation Geometry of Muon Beyond Normalized Momentum","created":"2026-07-16","cited_by_count":1,"area":null},{"id":"2205.13753","title":"HOUDINI: Escaping from Moderately Constrained Saddles","created":"2022-05-27","cited_by_count":0,"area":null},{"id":"2209.00361","title":"Versatile Single-Loop Method for Gradient Estimator: First and Second Order Optimality, and its Application to Federated Learning","created":"2022-09-01","cited_by_count":0,"area":null},{"id":"2301.12174","title":"Stochastic Dimension-reduced Second-order Methods for Policy Optimization","created":"2023-01-28","cited_by_count":0,"area":null},{"id":"2306.01648","title":"Federated Multi-Sequence Stochastic Approximation with Local Hypergradient Estimation","created":"2023-06-02","cited_by_count":0,"area":null},{"id":"2410.05807","title":"Extended convexity and smoothness and their applications in deep learning","created":"2024-10-08","cited_by_count":0,"area":null},{"id":"2505.01258","title":"A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization","created":"2025-05-02","cited_by_count":0,"area":null},{"id":"2605.05577","title":"Accelerating LMO-Based Optimization via Implicit Gradient Transport","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.08871","title":"Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction","created":"2026-05-09","cited_by_count":0,"area":null}],"next_cursor":null}