{"total":293,"rows":[{"id":"2502.07529","title":"Training Deep Learning Models with Norm-Constrained LMOs","created":"2025-02-11","cited_by_count":192,"area":null},{"id":"2402.03293","title":"Flora: Low-Rank Adapters Are Secretly Gradient Compressors","created":"2024-02-05","cited_by_count":108,"area":null},{"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":"2106.04692","title":"Provably Faster Algorithms for Bilevel Optimization","created":"2021-06-08","cited_by_count":106,"area":null},{"id":"2203.15046","title":"AUC Maximization in the Era of Big Data and AI: A Survey","created":"2022-03-28","cited_by_count":100,"area":null},{"id":"2201.13409","title":"A framework for bilevel optimization that enables stochastic and global variance reduction algorithms","created":"2022-01-31","cited_by_count":99,"area":null},{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99,"area":null},{"id":"2208.11195","title":"Robustness to Unbounded Smoothness of Generalized SignSGD","created":"2022-08-23","cited_by_count":81,"area":null},{"id":"2107.11433","title":"A general sample complexity analysis of vanilla policy gradient","created":"2021-07-23","cited_by_count":76,"area":null},{"id":"2102.04671","title":"A Single-Timescale Method for Stochastic Bilevel Optimization","created":"2021-02-09","cited_by_count":69,"area":null},{"id":"2207.14130","title":"FedVARP: Tackling the Variance Due to Partial Client Participation in Federated Learning","created":"2022-07-28","cited_by_count":64,"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":"2205.12173","title":"Byzantine Machine Learning Made Easy by Resilient Averaging of Momentums","created":"2022-05-24","cited_by_count":63,"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":"2112.04660","title":"A Fully Single Loop Algorithm for Bilevel Optimization without Hessian Inverse","created":"2021-12-09","cited_by_count":53,"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":"2102.03926","title":"Lower Bounds and Accelerated Algorithms for Bilevel Optimization","created":"2021-02-07","cited_by_count":46,"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":"2308.00788","title":"An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning","created":"2023-08-01","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":"2306.16504","title":"Momentum Benefits Non-IID Federated Learning Simply and Provably","created":"2023-06-28","cited_by_count":38,"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":"2212.00974","title":"Faster Adaptive Federated Learning","created":"2022-12-02","cited_by_count":35,"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":"2106.11396","title":"BiAdam: Fast Adaptive Bilevel Optimization Methods","created":"2021-06-21","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":"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":"2301.13139","title":"A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergence","created":"2023-01-30","cited_by_count":30,"area":null},{"id":"2107.12301","title":"Enhanced Bilevel Optimization via Bregman Distance","created":"2021-07-26","cited_by_count":28,"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":"2110.10116","title":"On the Global Optimum Convergence of Momentum-based Policy Gradient","created":"2021-10-19","cited_by_count":26,"area":null},{"id":"2507.20016","title":"FedSWA: Improving Generalization in Federated Learning with Highly Heterogeneous Data via Momentum-Based Stochastic Controlled Weight Averaging","created":"2025-07-26","cited_by_count":25,"area":null},{"id":"2201.03172","title":"Communication-Efficient Federated Learning with Accelerated Client Gradient","created":"2022-01-10","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":"2509.14562","title":"LiMuon: Light and Fast Muon Optimizer for Large Models","created":"2025-09-18","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":"2102.11866","title":"Doubly Robust Off-Policy Actor-Critic: Convergence and Optimality","created":"2021-02-23","cited_by_count":21,"area":null},{"id":"2204.13169","title":"FedShuffle: Recipes for Better Use of Local Work in Federated Learning","created":"2022-04-27","cited_by_count":21,"area":null},{"id":"2303.00565","title":"AdaSAM: Boosting Sharpness-Aware Minimization with Adaptive Learning Rate and Momentum for Training Deep Neural Networks","created":"2023-03-01","cited_by_count":21,"area":null},{"id":"2205.01608","title":"Local Stochastic Bilevel Optimization with Momentum-Based Variance Reduction","created":"2022-05-03","cited_by_count":20,"area":null},{"id":"2205.12856","title":"Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Function","created":"2022-05-25","cited_by_count":20,"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":"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":"2306.01854","title":"Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space","created":"2023-06-02","cited_by_count":18,"area":null},{"id":"2307.15196","title":"The Marginal Value of Momentum for Small Learning Rate SGD","created":"2023-07-27","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":"2106.12112","title":"Bregman Gradient Policy Optimization","created":"2021-06-23","cited_by_count":17,"area":null},{"id":"2201.08518","title":"Optimal variance-reduced stochastic approximation in Banach spaces","created":"2022-01-21","cited_by_count":17,"area":null},{"id":"2202.00308","title":"PAGE-PG: A Simple and Loopless Variance-Reduced Policy Gradient Method with Probabilistic Gradient Estimation","created":"2022-02-01","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":"2301.06428","title":"Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization","created":"2023-01-16","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":"2603.28254","title":"MuonEq: Balancing Before Orthogonalization with Lightweight Equilibration","created":"2026-03-30","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":"2302.08766","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","created":"2023-02-17","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":"2102.09700","title":"AI-SARAH: Adaptive and Implicit Stochastic Recursive Gradient Methods","created":"2021-02-19","cited_by_count":15,"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":"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":"2206.15025","title":"On the Convergence of Distributed Stochastic Bilevel Optimization Algorithms over a Network","created":"2022-06-30","cited_by_count":14,"area":null},{"id":"2303.03944","title":"On Momentum-Based Gradient Methods for Bilevel Optimization with Nonconvex Lower-Level","created":"2023-03-07","cited_by_count":14,"area":null},{"id":"2312.01082","title":"A Survey on Stability of Learning with Limited Labelled Data and its Sensitivity to the Effects of Randomness","created":"2023-12-02","cited_by_count":14,"area":null},{"id":"2102.09645","title":"SVRG Meets AdaGrad: Painless Variance Reduction","created":"2021-02-18","cited_by_count":13,"area":null},{"id":"2103.01338","title":"Acceleration via Fractal Learning Rate Schedules","created":"2021-03-01","cited_by_count":13,"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":"2205.08253","title":"Momentum-Based Policy Gradient with Second-Order Information","created":"2022-05-17","cited_by_count":13,"area":null},{"id":"2206.00395","title":"Optimization with Access to Auxiliary Information","created":"2022-06-01","cited_by_count":13,"area":null},{"id":"2308.07536","title":"Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem","created":"2023-08-15","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":"2209.10931","title":"Robust Collaborative Learning with Linear Gradient Overhead","created":"2022-09-22","cited_by_count":12,"area":null},{"id":"2302.09699","title":"Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks","created":"2023-02-20","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.07101","title":"On the Complexity of First-Order Methods in Stochastic Bilevel Optimization","created":"2024-02-11","cited_by_count":12,"area":null},{"id":"2201.12332","title":"On the Hidden Biases of Policy Mirror Ascent in Continuous Action Spaces","created":"2022-01-28","cited_by_count":11,"area":null},{"id":"2206.00260","title":"Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization","created":"2022-06-01","cited_by_count":11,"area":null},{"id":"2212.02724","title":"Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems","created":"2022-12-06","cited_by_count":11,"area":null},{"id":"2409.09906","title":"Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees","created":"2024-09-16","cited_by_count":11,"area":null},{"id":"2410.03883","title":"DiSK: Differentially Private Optimizer with Simplified Kalman Filter for Noise Reduction","created":"2024-10-04","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":"2102.07002","title":"On the Last Iterate Convergence of Momentum Methods","created":"2021-02-13","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":"2302.03884","title":"DIFF2: Differential Private Optimization via Gradient Differences for Nonconvex Distributed Learning","created":"2023-02-08","cited_by_count":10,"area":null},{"id":"2310.03234","title":"Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization","created":"2023-10-05","cited_by_count":10,"area":null},{"id":"2310.03613","title":"Solving a Class of Non-Convex Minimax Optimization in Federated Learning","created":"2023-10-05","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":"2603.14315","title":"Enhancing LLM Training via Spectral Clipping","created":"2026-03-15","cited_by_count":10,"area":null},{"id":"2604.14108","title":"Momentum Further Constrains Sharpness at the Edge of Stochastic Stability","created":"2026-04-15","cited_by_count":10,"area":null},{"id":"2102.03970","title":"Coordinating Momenta for Cross-silo Federated Learning","created":"2021-02-08","cited_by_count":9,"area":null},{"id":"2111.05968","title":"Linear Speedup in Personalized Collaborative Learning","created":"2021-11-10","cited_by_count":9,"area":null},{"id":"2206.10032","title":"Communication-Efficient Federated Learning With Data and Client Heterogeneity","created":"2022-06-20","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}],"next_cursor":"100"}