{"total":287,"rows":[{"id":"2101.12699","title":"Exploring Deep Neural Networks via Layer-Peeled Model: Minority Collapse in Imbalanced Training","created":"2021-01-29","cited_by_count":166,"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":"2103.01516","title":"Private Stochastic Convex Optimization: Optimal Rates in $\\ell_1$ Geometry","created":"2021-03-02","cited_by_count":83,"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":"2107.11433","title":"A general sample complexity analysis of vanilla policy gradient","created":"2021-07-23","cited_by_count":76,"area":null},{"id":"2102.08607","title":"On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method","created":"2021-02-17","cited_by_count":70,"area":null},{"id":"2107.07467","title":"Only Train Once: A One-Shot Neural Network Training And Pruning Framework","created":"2021-07-15","cited_by_count":70,"area":null},{"id":"2211.07937","title":"An Improved Analysis of (Variance-Reduced) Policy Gradient and Natural Policy Gradient Methods","created":"2022-11-15","cited_by_count":68,"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":"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":"2103.01278","title":"Non-Euclidean Differentially Private Stochastic Convex Optimization: Optimal Rates in Linear Time","created":"2021-03-01","cited_by_count":51,"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":"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":"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":"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":"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":"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":"2110.03300","title":"Permutation Compressors for Provably Faster Distributed Nonconvex Optimization","created":"2021-10-07","cited_by_count":32,"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.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":"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":"2203.06735","title":"Private Non-Convex Federated Learning Without a Trusted Server","created":"2022-03-13","cited_by_count":26,"area":null},{"id":"2302.00924","title":"LMC: Fast Training of GNNs via Subgraph Sampling with Provable Convergence","created":"2023-02-02","cited_by_count":26,"area":null},{"id":"2310.09639","title":"DPZero: Private Fine-Tuning of Language Models without Backpropagation","created":"2023-10-14","cited_by_count":26,"area":null},{"id":"2206.07082","title":"Stability and Generalization of Stochastic Optimization with Nonconvex and Nonsmooth Problems","created":"2022-06-14","cited_by_count":25,"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":"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":"2212.14370","title":"Can 5th Generation Local Training Methods Support Client Sampling? Yes!","created":"2022-12-29","cited_by_count":22,"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":"2302.09029","title":"Solving stochastic weak Minty variational inequalities without increasing batch size","created":"2023-02-17","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":"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":"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":"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":"2106.12112","title":"Bregman Gradient Policy Optimization","created":"2021-06-23","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":"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":"2106.01761","title":"Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization","created":"2021-06-03","cited_by_count":16,"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":"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":"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":"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":"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.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":"2102.09026","title":"Optimizing Large-Scale Hyperparameters via Automated Learning Algorithm","created":"2021-02-17","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":"2305.15659","title":"How to escape sharp minima with random perturbations","created":"2023-05-25","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":"2207.01578","title":"Quantum Neural Network Compression","created":"2022-07-04","cited_by_count":12,"area":null},{"id":"2208.08490","title":"NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data","created":"2022-08-17","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":"2302.12909","title":"Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap","created":"2023-02-24","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":"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":"2211.13668","title":"Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems","created":"2022-11-24","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":"2310.02987","title":"Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions","created":"2023-10-04","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":"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":"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":"2302.11147","title":"Stochastic Approximation Beyond Gradient for Signal Processing and Machine Learning","created":"2023-02-22","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":"2101.06070","title":"Efficient Semi-Implicit Variational Inference","created":"2021-01-15","cited_by_count":9,"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":"2209.14501","title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","created":"2022-09-29","cited_by_count":9,"area":null}],"next_cursor":"100"}