{"total":220,"rows":[{"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":"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":"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":"2110.04645","title":"Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning","created":"2021-10-09","cited_by_count":53,"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":"2309.15639","title":"Enhancing Sharpness-Aware Optimization Through Variance Suppression","created":"2023-09-27","cited_by_count":37,"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":"2102.03198","title":"Bias-Variance Reduced Local SGD for Less Heterogeneous Federated Learning","created":"2021-02-05","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":"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":"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":"2110.10116","title":"On the Global Optimum Convergence of Momentum-based Policy Gradient","created":"2021-10-19","cited_by_count":26,"area":null},{"id":"2308.06058","title":"Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction","created":"2023-08-11","cited_by_count":23,"area":null},{"id":"2206.00363","title":"Bring Your Own Algorithm for Optimal Differentially Private Stochastic Minimax Optimization","created":"2022-06-01","cited_by_count":22,"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":"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":"2204.13170","title":"AdaBest: Minimizing Client Drift in Federated Learning via Adaptive Bias Estimation","created":"2022-04-27","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":"2203.09436","title":"Stochastic Halpern Iteration with Variance Reduction for Stochastic Monotone Inclusions","created":"2022-03-17","cited_by_count":19,"area":null},{"id":"2209.02257","title":"Faster federated optimization under second-order similarity","created":"2022-09-06","cited_by_count":18,"area":null},{"id":"2109.04522","title":"Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees","created":"2021-09-09","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":"2109.05198","title":"Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Information","created":"2021-09-11","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":"2203.16217","title":"Improved Convergence Rate of Stochastic Gradient Langevin Dynamics with Variance Reduction and its Application to Optimization","created":"2022-03-30","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":"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":"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":"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.09645","title":"SVRG Meets AdaGrad: Painless Variance Reduction","created":"2021-02-18","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":"2406.00489","title":"Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction","created":"2024-06-01","cited_by_count":13,"area":null},{"id":"2111.11556","title":"FLIX: A Simple and Communication-Efficient Alternative to Local Methods in Federated Learning","created":"2021-11-22","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":"2207.05377","title":"On the Generalization for Transfer Learning: An Information-Theoretic Analysis","created":"2022-07-12","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":"2310.02987","title":"Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions","created":"2023-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":"2202.03525","title":"Nesterov Accelerated Shuffling Gradient Method for Convex Optimization","created":"2022-02-07","cited_by_count":10,"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":"2207.03730","title":"Tackling Data Heterogeneity: A New Unified Framework for Decentralized SGD with Sample-induced Topology","created":"2022-07-08","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":"2302.11147","title":"Stochastic Approximation Beyond Gradient for Signal Processing and Machine Learning","created":"2023-02-22","cited_by_count":10,"area":null},{"id":"2405.05630","title":"Policy Gradient with Active Importance Sampling","created":"2024-05-09","cited_by_count":10,"area":"deeprl"},{"id":"2405.14402","title":"Exact Gauss-Newton Optimization for Training Deep Neural Networks","created":"2024-05-23","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":"2202.02491","title":"Distributed Learning With Sparsified Gradient Differences","created":"2022-02-05","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":"2302.07071","title":"Statistically Optimal Force Aggregation for Coarse-Graining Molecular Dynamics","created":"2023-02-14","cited_by_count":9,"area":null},{"id":"2501.19214","title":"A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization","created":"2025-01-31","cited_by_count":9,"area":null},{"id":"2105.01231","title":"GT-STORM: Taming Sample, Communication, and Memory Complexities in Decentralized Non-Convex Learning","created":"2021-05-04","cited_by_count":8,"area":null},{"id":"2305.15546","title":"Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time","created":"2023-05-24","cited_by_count":8,"area":null},{"id":"2305.18730","title":"Blockwise Stochastic Variance-Reduced Methods with Parallel Speedup for Multi-Block Bilevel Optimization","created":"2023-05-30","cited_by_count":8,"area":null},{"id":"2306.03240","title":"Improving Accelerated Federated Learning with Compression and Importance Sampling","created":"2023-06-05","cited_by_count":8,"area":null},{"id":"2403.02648","title":"Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad","created":"2024-03-05","cited_by_count":8,"area":null},{"id":"2405.12952","title":"Truncated Variance Reduced Value Iteration","created":"2024-05-21","cited_by_count":8,"area":null},{"id":"2410.07574","title":"Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition","created":"2024-10-10","cited_by_count":8,"area":"deeprl"},{"id":"2605.06884","title":"Muon with Nesterov Momentum: Heavy-Tailed Noise and (Randomized) Inexact Polar Decomposition","created":"2026-05-07","cited_by_count":8,"area":null},{"id":"2103.12293","title":"Stochastic Reweighted Gradient Descent","created":"2021-03-23","cited_by_count":7,"area":null},{"id":"2103.16377","title":"Greedy-GQ with Variance Reduction: Finite-time Analysis and Improved Complexity","created":"2021-03-30","cited_by_count":7,"area":null},{"id":"2111.13322","title":"Random-reshuffled SARAH does not need a full gradient computations","created":"2021-11-26","cited_by_count":7,"area":null},{"id":"2304.11737","title":"Sarah Frank-Wolfe: Methods for Constrained Optimization with Best Rates and Practical Features","created":"2023-04-23","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":"2112.02813","title":"MDPGT: Momentum-based Decentralized Policy Gradient Tracking","created":"2021-12-06","cited_by_count":6,"area":null},{"id":"2212.02387","title":"An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization","created":"2022-12-05","cited_by_count":6,"area":null},{"id":"2304.10613","title":"Debiasing Conditional Stochastic Optimization","created":"2023-04-20","cited_by_count":6,"area":null},{"id":"2306.07485","title":"Learning Unnormalized Statistical Models via Compositional Optimization","created":"2023-06-13","cited_by_count":6,"area":null},{"id":"2401.01084","title":"Global Convergence of Natural Policy Gradient with Hessian-aided Momentum Variance Reduction","created":"2024-01-02","cited_by_count":6,"area":"deeprl"},{"id":"2406.01959","title":"Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions","created":"2024-06-04","cited_by_count":6,"area":null},{"id":"2410.05106","title":"Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson-Romberg Extrapolation","created":"2024-10-07","cited_by_count":6,"area":null},{"id":"2508.12327","title":"Convergence Analysis of the Lion Optimizer in Centralized and Distributed Settings","created":"2025-08-17","cited_by_count":6,"area":null},{"id":"2106.10708","title":"Memory Augmented Optimizers for Deep Learning","created":"2021-06-20","cited_by_count":5,"area":null},{"id":"2111.02083","title":"Federated Expectation Maximization with heterogeneity mitigation and variance reduction","created":"2021-11-03","cited_by_count":5,"area":null},{"id":"2203.09607","title":"Learning Distributionally Robust Models at Scale via Composite Optimization","created":"2022-03-17","cited_by_count":5,"area":null},{"id":"2206.00285","title":"Stochastic Gradient Methods with Preconditioned Updates","created":"2022-06-01","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":"2211.07303","title":"Adaptive Federated Minimax Optimization with Lower Complexities","created":"2022-11-14","cited_by_count":5,"area":null},{"id":"2301.03573","title":"Balance is Essence: Accelerating Sparse Training via Adaptive Gradient Correction","created":"2023-01-09","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.04171","title":"FedStale: leveraging stale client updates in federated learning","created":"2024-05-07","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":"2408.11084","title":"Multi-level Monte-Carlo Gradient Methods for Stochastic Optimization with Biased Oracles","created":"2024-08-20","cited_by_count":5,"area":null},{"id":"2604.16620","title":"Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance","created":"2026-04-17","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":"2110.08577","title":"Nys-Newton: Nystr\\\"om-Approximated Curvature for Stochastic Optimization","created":"2021-10-16","cited_by_count":4,"area":null}],"next_cursor":"100"}