{"total":135,"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":"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":"2206.07136","title":"Automatic Clipping: Differentially Private Deep Learning Made Easier and Stronger","created":"2022-06-14","cited_by_count":88,"area":null},{"id":"2208.11195","title":"Robustness to Unbounded Smoothness of Generalized SignSGD","created":"2022-08-23","cited_by_count":81,"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":"2310.15080","title":"Federated Learning of Large Language Models with Parameter-Efficient Prompt Tuning and Adaptive Optimization","created":"2023-10-23","cited_by_count":65,"area":null},{"id":"2302.01734","title":"Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policies","created":"2023-02-03","cited_by_count":58,"area":null},{"id":"2503.20762","title":"ASGO: Adaptive Structured Gradient Optimization","created":"2025-03-26","cited_by_count":57,"area":null},{"id":"2112.03459","title":"A Novel Convergence Analysis for Algorithms of the Adam Family","created":"2021-12-07","cited_by_count":50,"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":"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":"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":"2502.04664","title":"Implicit Bias of Spectral Descent and Muon on Multiclass Separable Data","created":"2025-02-07","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":"2207.05931","title":"Towards understanding how momentum improves generalization in deep learning","created":"2022-07-13","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":"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":"2102.06489","title":"Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothness","created":"2021-02-12","cited_by_count":37,"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":"2405.16002","title":"Does SGD really happen in tiny subspaces?","created":"2024-05-25","cited_by_count":36,"area":null},{"id":"2305.15155","title":"Momentum Provably Improves Error Feedback!","created":"2023-05-24","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":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"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":"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":"2509.02981","title":"AdaGrad Meets Muon: Adaptive Stepsizes for Orthogonal Updates","created":"2025-09-03","cited_by_count":23,"area":null},{"id":"2205.05040","title":"A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural Networks","created":"2022-05-10","cited_by_count":20,"area":null},{"id":"2209.15505","title":"Momentum Tracking: Momentum Acceleration for Decentralized Deep Learning on Heterogeneous Data","created":"2022-09-30","cited_by_count":20,"area":null},{"id":"2412.13148","title":"SWAN: SGD with Normalization and Whitening Enables Stateless LLM Training","created":"2024-12-17","cited_by_count":20,"area":null},{"id":"2306.09000","title":"When and Why Momentum Accelerates SGD:An Empirical Study","created":"2023-06-15","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":"2505.24749","title":"SUMO: Subspace-Aware Moment-Orthogonalization for Accelerating Memory-Efficient LLM Training","created":"2025-05-30","cited_by_count":19,"area":null},{"id":"2304.09762","title":"Practical Differentially Private and Byzantine-resilient Federated Learning","created":"2023-04-15","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":"2506.01913","title":"Generalized Gradient Norm Clipping & Non-Euclidean $(L_0,L_1)$-Smoothness","created":"2025-06-02","cited_by_count":17,"area":null},{"id":"2312.12670","title":"On the Role of Server Momentum in Federated Learning","created":"2023-12-19","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":"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":"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":"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":"2506.16659","title":"Memory-Efficient LLM Pretraining via Minimalist Optimizer Design","created":"2025-06-20","cited_by_count":13,"area":null},{"id":"2212.04486","title":"A New Linear Scaling Rule for Private Adaptive Hyperparameter Optimization","created":"2022-12-08","cited_by_count":11,"area":null},{"id":"2506.11214","title":"Complexity of normalized stochastic first-order methods with momentum under heavy-tailed noise","created":"2025-06-12","cited_by_count":11,"area":null},{"id":"2210.06328","title":"Momentum Aggregation for Private Non-convex ERM","created":"2022-10-12","cited_by_count":10,"area":null},{"id":"2603.15958","title":"Deriving Hyperparameter Scaling Laws via Modern Optimization Theory","created":"2026-03-16","cited_by_count":10,"area":null},{"id":"2403.02967","title":"Non-convex Stochastic Composite Optimization with Polyak Momentum","created":"2024-03-05","cited_by_count":9,"area":null},{"id":"2403.05293","title":"Leveraging Continuous Time to Understand Momentum When Training Diagonal Linear Networks","created":"2024-03-08","cited_by_count":9,"area":null},{"id":"2502.06742","title":"Gradient Multi-Normalization for Stateless and Scalable LLM Training","created":"2025-02-10","cited_by_count":9,"area":null},{"id":"2408.13460","title":"DOPPLER: Differentially Private Optimizers with Low-pass Filter for Privacy Noise Reduction","created":"2024-08-24","cited_by_count":8,"area":null},{"id":"2410.12455","title":"Loss Landscape Characterization of Neural Networks without Over-Parametrization","created":"2024-10-16","cited_by_count":8,"area":null},{"id":"2509.26337","title":"FedMuon: Federated Learning with Bias-corrected LMO-based Optimization","created":"2025-09-30","cited_by_count":8,"area":null},{"id":"2511.11466","title":"Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates","created":"2025-11-14","cited_by_count":8,"area":null},{"id":"2302.07155","title":"EPISODE: Episodic Gradient Clipping with Periodic Resampled Corrections for Federated Learning with Heterogeneous Data","created":"2023-02-14","cited_by_count":7,"area":null},{"id":"2310.18784","title":"High-probability Convergence Bounds for Nonlinear Stochastic Gradient Descent Under Heavy-tailed Noise","created":"2023-10-28","cited_by_count":7,"area":null},{"id":"2410.15637","title":"Large Deviation Upper Bounds and Improved MSE Rates of Nonlinear SGD: Heavy-tailed Noise and Power of Symmetry","created":"2024-10-21","cited_by_count":7,"area":null},{"id":"2510.17802","title":"Unbiased Gradient Low-Rank Projection","created":"2025-10-20","cited_by_count":7,"area":null},{"id":"2106.14956","title":"Robust Distributed Optimization With Randomly Corrupted Gradients","created":"2021-06-28","cited_by_count":6,"area":null},{"id":"2410.19644","title":"Improving Stochastic Cubic Newton with Momentum","created":"2024-10-25","cited_by_count":6,"area":null},{"id":"2505.16363","title":"AdamS: Momentum Itself Can Be A Normalizer for LLM Pretraining and Post-training","created":"2025-05-22","cited_by_count":6,"area":null},{"id":"2604.04891","title":"Muon Dynamics as a Spectral Wasserstein Flow","created":"2026-04-06","cited_by_count":6,"area":null},{"id":"2605.10797","title":"Muown: Row-Norm Control for Muon Optimization","created":"2026-05-11","cited_by_count":6,"area":null},{"id":"2106.07094","title":"On the Convergence of Differentially Private Federated Learning on Non-Lipschitz Objectives, and with Normalized Client Updates","created":"2021-06-13","cited_by_count":5,"area":null},{"id":"2307.13680","title":"High Probability Analysis for Non-Convex Stochastic Optimization with Clipping","created":"2023-07-25","cited_by_count":5,"area":null},{"id":"2405.17529","title":"Clip Body and Tail Separately: High Probability Guarantees for DPSGD with Heavy Tails","created":"2024-05-27","cited_by_count":5,"area":null},{"id":"2511.20584","title":"A Tale of Two Geometries: Adaptive Optimizers and Non-Euclidean Descent","created":"2025-11-25","cited_by_count":5,"area":null},{"id":"2512.00763","title":"Provable Benefit of SignGD: A Minimal Model Under Heavy-Tailed Class Imbalance","created":"2025-11-30","cited_by_count":5,"area":null},{"id":"2310.14616","title":"Rethinking SIGN Training: Provable Nonconvex Acceleration without First- and Second-Order Gradient Lipschitz","created":"2023-10-23","cited_by_count":4,"area":null},{"id":"2403.02833","title":"SOFIM: Stochastic Optimization Using Regularized Fisher Information Matrix","created":"2024-03-05","cited_by_count":4,"area":null},{"id":"2410.14054","title":"Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization","created":"2024-10-17","cited_by_count":4,"area":null},{"id":"2410.16871","title":"Error Feedback under $(L_0,L_1)$-Smoothness: Normalization and Momentum","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2509.14952","title":"Stochastic Bilevel Optimization with Heavy-Tailed Noise","created":"2025-09-18","cited_by_count":4,"area":null},{"id":"2510.00823","title":"Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization","created":"2025-10-01","cited_by_count":4,"area":null},{"id":"2510.01377","title":"DeMuon: A Decentralized Muon for Matrix Optimization over Graphs","created":"2025-10-01","cited_by_count":4,"area":null},{"id":"2210.04319","title":"Dissecting adaptive methods in GANs","created":"2022-10-09","cited_by_count":3,"area":null},{"id":"2307.10053","title":"Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization","created":"2023-07-19","cited_by_count":3,"area":null},{"id":"2503.22923","title":"Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization","created":"2025-03-29","cited_by_count":3,"area":null},{"id":"2507.09093","title":"Sharp High-Probability Rates for Nonlinear SGD under Heavy-Tailed Noise via Symmetrization","created":"2025-07-12","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":"2510.10690","title":"Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits","created":"2025-10-12","cited_by_count":3,"area":null},{"id":"2510.14009","title":"Noise-Adaptive Layerwise Learning Rates: Accelerating Geometry-Aware Optimization for Deep Neural Network Training","created":"2025-10-15","cited_by_count":3,"area":null},{"id":"2510.27153","title":"Exploring Landscapes for Better Minima along Valleys","created":"2025-10-31","cited_by_count":3,"area":null},{"id":"2605.18694","title":"Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad","created":"2026-05-18","cited_by_count":3,"area":null},{"id":"2606.23637","title":"Muown Implicitly Performs Angular Step-size Decay","created":"2026-06-22","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":"2406.13041","title":"Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum","created":"2024-06-18","cited_by_count":2,"area":null},{"id":"2408.09539","title":"Efficient Federated Learning against Byzantine Attacks and Data Heterogeneity via Aggregating Normalized Gradients","created":"2024-08-18","cited_by_count":2,"area":null},{"id":"2412.18790","title":"Torque-Aware Momentum","created":"2024-12-25","cited_by_count":2,"area":null},{"id":"2412.19444","title":"Towards Simple and Provable Parameter-Free Adaptive Gradient Methods","created":"2024-12-27","cited_by_count":2,"area":null},{"id":"2509.15399","title":"Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization","created":"2025-09-18","cited_by_count":2,"area":null},{"id":"2510.17503","title":"Stochastic Difference-of-Convex Optimization with Momentum","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2511.14501","title":"Improved Convergence in Parameter-Agnostic Error Feedback through Momentum","created":"2025-11-18","cited_by_count":2,"area":null},{"id":"2602.13413","title":"Why is Normalization Preferred? A Worst-Case Complexity Theory for Stochastically Preconditioned SGD under Heavy-Tailed Noise","created":"2026-02-13","cited_by_count":2,"area":null},{"id":"2605.18174","title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","created":"2026-05-18","cited_by_count":2,"area":null},{"id":"2605.18528","title":"Tight Complexity of Muon under Heavy-Tailed Noise","created":"2026-05-18","cited_by_count":2,"area":null},{"id":"2606.14560","title":"Free Heavy-Tailed Lunch for Muon: A Theoretical Justification of Empirical Success","created":"2026-06-12","cited_by_count":2,"area":null},{"id":"2103.11558","title":"Weighted Neural Tangent Kernel: A Generalized and Improved Network-Induced Kernel","created":"2021-03-22","cited_by_count":1,"area":null},{"id":"2311.02818","title":"Signal Processing Meets SGD: From Momentum to Filter","created":"2023-11-06","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}],"next_cursor":"100"}