{"total":307,"rows":[{"id":"2502.07529","title":"Training Deep Learning Models with Norm-Constrained LMOs","created":"2025-02-11","cited_by_count":192,"area":null},{"id":"2208.06677","title":"Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models","created":"2022-08-13","cited_by_count":174,"area":null},{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99,"area":null},{"id":"2503.12645","title":"Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization","created":"2025-03-16","cited_by_count":92,"area":null},{"id":"2106.14343","title":"High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails","created":"2021-06-28","cited_by_count":80,"area":null},{"id":"2206.08307","title":"Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning","created":"2022-06-16","cited_by_count":79,"area":null},{"id":"2102.07845","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","created":"2021-02-15","cited_by_count":78,"area":null},{"id":"2106.04159","title":"Fast Federated Learning in the Presence of Arbitrary Device Unavailability","created":"2021-06-08","cited_by_count":72,"area":null},{"id":"2102.04761","title":"Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Data","created":"2021-02-09","cited_by_count":69,"area":null},{"id":"2111.14580","title":"Amortized Implicit Differentiation for Stochastic Bilevel Optimization","created":"2021-11-29","cited_by_count":63,"area":null},{"id":"2206.07638","title":"Asynchronous SGD Beats Minibatch SGD Under Arbitrary Delays","created":"2022-06-15","cited_by_count":63,"area":null},{"id":"2202.05791","title":"The Power of Adaptivity in SGD: Self-Tuning Step Sizes with Unbounded Gradients and Affine Variance","created":"2022-02-11","cited_by_count":61,"area":null},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49,"area":null},{"id":"2410.13849","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","created":"2024-10-17","cited_by_count":49,"area":null},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45,"area":null},{"id":"2107.05585","title":"Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings","created":"2021-07-12","cited_by_count":45,"area":null},{"id":"2205.13648","title":"A Unified Analysis of Federated Learning with Arbitrary Client Participation","created":"2022-05-26","cited_by_count":45,"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":"2306.01264","title":"Convex and Non-convex Optimization Under Generalized Smoothness","created":"2023-06-02","cited_by_count":44,"area":null},{"id":"2209.05045","title":"Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","created":"2022-09-12","cited_by_count":43,"area":null},{"id":"2412.19529","title":"Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping","created":"2024-12-27","cited_by_count":42,"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":"2506.04192","title":"Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise","created":"2025-06-04","cited_by_count":41,"area":null},{"id":"2106.08208","title":"SUPER-ADAM: Faster and Universal Framework of Adaptive Gradients","created":"2021-06-15","cited_by_count":40,"area":null},{"id":"2110.12459","title":"Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis","created":"2021-10-24","cited_by_count":39,"area":null},{"id":"2301.00712","title":"On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis","created":"2023-01-02","cited_by_count":39,"area":null},{"id":"2306.16504","title":"Momentum Benefits Non-IID Federated Learning Simply and Provably","created":"2023-06-28","cited_by_count":38,"area":null},{"id":"2310.17998","title":"Closing the Gap Between the Upper Bound and the Lower Bound of Adam's Iteration Complexity","created":"2023-10-27","cited_by_count":38,"area":null},{"id":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37,"area":null},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36,"area":null},{"id":"2110.05707","title":"On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning","created":"2021-10-12","cited_by_count":36,"area":null},{"id":"2202.04428","title":"Adapting to Mixing Time in Stochastic Optimization with Markovian Data","created":"2022-02-09","cited_by_count":36,"area":null},{"id":"2206.13033","title":"Normalized/Clipped SGD with Perturbation for Differentially Private Non-Convex Optimization","created":"2022-06-27","cited_by_count":36,"area":null},{"id":"2105.02266","title":"Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization","created":"2021-05-05","cited_by_count":33,"area":null},{"id":"2206.03665","title":"Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression","created":"2022-06-08","cited_by_count":33,"area":null},{"id":"2206.00846","title":"Faster Rates of Convergence to Stationary Points in Differentially Private Optimization","created":"2022-06-02","cited_by_count":32,"area":null},{"id":"2102.01583","title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","created":"2021-02-02","cited_by_count":31,"area":null},{"id":"2305.15155","title":"Momentum Provably Improves Error Feedback!","created":"2023-05-24","cited_by_count":31,"area":null},{"id":"2306.12067","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","created":"2023-06-21","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":"2302.08783","title":"SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variance","created":"2023-02-17","cited_by_count":30,"area":null},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"area":null},{"id":"2302.06763","title":"Breaking the Lower Bound with (Little) Structure: Acceleration in Non-Convex Stochastic Optimization with Heavy-Tailed Noise","created":"2023-02-14","cited_by_count":27,"area":null},{"id":"2510.19933","title":"Beyond the Ideal: Analyzing the Inexact Muon Update","created":"2025-10-22","cited_by_count":27,"area":null},{"id":"2203.06735","title":"Private Non-Convex Federated Learning Without a Trusted Server","created":"2022-03-13","cited_by_count":26,"area":null},{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"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":"2203.16462","title":"Convergence of gradient descent for deep neural networks","created":"2022-03-30","cited_by_count":24,"area":null},{"id":"2210.07863","title":"Revisiting Optimal Convergence Rate for Smooth and Non-convex Stochastic Decentralized Optimization","created":"2022-10-14","cited_by_count":23,"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":"2307.04504","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","created":"2023-07-10","cited_by_count":23,"area":null},{"id":"2405.18199","title":"Adam with model exponential moving average is effective for nonconvex optimization","created":"2024-05-28","cited_by_count":23,"area":null},{"id":"2410.08198","title":"Adam Exploits $\\ell_\\infty$-geometry of Loss Landscape via Coordinate-wise Adaptivity","created":"2024-10-10","cited_by_count":23,"area":null},{"id":"2509.02981","title":"AdaGrad Meets Muon: Adaptive Stepsizes for Orthogonal Updates","created":"2025-09-03","cited_by_count":23,"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":"2302.09029","title":"Solving stochastic weak Minty variational inequalities without increasing batch size","created":"2023-02-17","cited_by_count":21,"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":"2306.00144","title":"Mechanic: A Learning Rate Tuner","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2212.09513","title":"Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimization","created":"2022-12-19","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":"2405.01031","title":"The Privacy Power of Correlated Noise in Decentralized Learning","created":"2024-05-02","cited_by_count":18,"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":"2501.16168","title":"Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity","created":"2025-01-27","cited_by_count":18,"area":null},{"id":"2105.01778","title":"Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss","created":"2021-05-04","cited_by_count":17,"area":null},{"id":"2202.03397","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","created":"2022-02-07","cited_by_count":17,"area":null},{"id":"2202.07530","title":"Optimal Algorithms for Stochastic Multi-Level Compositional Optimization","created":"2022-02-15","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":"2504.09951","title":"Towards Weaker Variance Assumptions for Stochastic Optimization","created":"2025-04-14","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":"2202.01268","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization","created":"2022-02-02","cited_by_count":16,"area":null},{"id":"2207.08540","title":"Multi-block-Single-probe Variance Reduced Estimator for Coupled Compositional Optimization","created":"2022-07-18","cited_by_count":16,"area":null},{"id":"2210.05740","title":"Stochastic Constrained DRO with a Complexity Independent of Sample Size","created":"2022-10-11","cited_by_count":16,"area":null},{"id":"2311.00678","title":"Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints","created":"2023-11-01","cited_by_count":16,"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":"2103.03265","title":"Better SGD using Second-order Momentum","created":"2021-03-04","cited_by_count":15,"area":null},{"id":"2110.06256","title":"Neural Network Weights Do Not Converge to Stationary Points: An Invariant Measure Perspective","created":"2021-10-12","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":"2312.02828","title":"Convergence Rates for Stochastic Approximation: Biased Noise with Unbounded Variance, and Applications","created":"2023-12-05","cited_by_count":15,"area":null},{"id":"2401.09587","title":"Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis","created":"2024-01-17","cited_by_count":15,"area":null},{"id":"2402.13794","title":"Revisiting Convergence of AdaGrad with Relaxed Assumptions","created":"2024-02-21","cited_by_count":15,"area":null},{"id":"2411.07061","title":"General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization","created":"2024-11-11","cited_by_count":15,"area":null},{"id":"2603.20527","title":"RMNP: Row-Momentum Normalized Preconditioning for Scalable Matrix-Based Optimization","created":"2026-03-20","cited_by_count":15,"area":null},{"id":"2303.09261","title":"Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold","created":"2023-03-16","cited_by_count":14,"area":null},{"id":"2305.16297","title":"Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?","created":"2023-05-25","cited_by_count":14,"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":"2310.18535","title":"Contextual Stochastic Bilevel Optimization","created":"2023-10-27","cited_by_count":14,"area":null},{"id":"2403.15146","title":"On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyond","created":"2024-03-22","cited_by_count":14,"area":null},{"id":"2404.01436","title":"Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance","created":"2024-04-01","cited_by_count":14,"area":null},{"id":"2602.17080","title":"Adam Improves Muon: Adaptive Moment Estimation with Orthogonalized Momentum","created":"2026-02-19","cited_by_count":14,"area":null},{"id":"2104.14840","title":"Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator","created":"2021-04-30","cited_by_count":13,"area":null},{"id":"2106.16101","title":"AdaGDA: Faster Adaptive Gradient Descent Ascent Methods for Minimax Optimization","created":"2021-06-30","cited_by_count":13,"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":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"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":"2502.07923","title":"Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness","created":"2025-02-11","cited_by_count":13,"area":null},{"id":"2510.12402","title":"Cautious Weight Decay","created":"2025-10-14","cited_by_count":13,"area":null},{"id":"2306.02159","title":"Gradient-free optimization of highly smooth functions: improved analysis and a new algorithm","created":"2023-06-03","cited_by_count":12,"area":null},{"id":"2310.09804","title":"Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates","created":"2023-10-15","cited_by_count":12,"area":null},{"id":"2402.03126","title":"How Free is Parameter-Free Stochastic Optimization?","created":"2024-02-05","cited_by_count":12,"area":null}],"next_cursor":"100"}