{"total":145,"rows":[{"id":"2103.00065","title":"Gradient Descent on Neural Networks Typically Occurs at the Edge of Stability","created":"2021-02-26","cited_by_count":427,"area":null},{"id":"2504.14945","title":"Learning to Reason under Off-Policy Guidance","created":"2025-04-21","cited_by_count":281,"area":"lr"},{"id":"2104.11375","title":"Decentralized Federated Averaging","created":"2021-04-23","cited_by_count":114,"area":null},{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99,"area":null},{"id":"2512.24695","title":"Nested Learning: The Illusion of Deep Learning Architectures","created":"2025-12-31","cited_by_count":72,"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":"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":"2110.14074","title":"Fault-Tolerant Federated Reinforcement Learning with Theoretical Guarantee","created":"2021-10-26","cited_by_count":54,"area":null},{"id":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47,"area":null},{"id":"2304.14647","title":"An Adaptive Policy to Employ Sharpness-Aware Minimization","created":"2023-04-28","cited_by_count":43,"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.12832","title":"Deep networks for system identification: a Survey","created":"2023-01-30","cited_by_count":37,"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":"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":"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":"2110.10116","title":"On the Global Optimum Convergence of Momentum-based Policy Gradient","created":"2021-10-19","cited_by_count":26,"area":null},{"id":"2303.00883","title":"Variance-reduced Clipping for Non-convex Optimization","created":"2023-03-02","cited_by_count":22,"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":"2104.13326","title":"Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization","created":"2021-04-27","cited_by_count":19,"area":null},{"id":"2111.15139","title":"Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures","created":"2021-11-30","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":"2103.01089","title":"A Biased Graph Neural Network Sampler with Near-Optimal Regret","created":"2021-03-01","cited_by_count":17,"area":null},{"id":"2104.05245","title":"Distributed Learning Systems with First-order Methods","created":"2021-04-12","cited_by_count":17,"area":null},{"id":"2110.01663","title":"Global Convergence and Stability of Stochastic Gradient Descent","created":"2021-10-04","cited_by_count":17,"area":null},{"id":"2108.00365","title":"A Decentralized Federated Learning Framework via Committee Mechanism with Convergence Guarantee","created":"2021-08-01","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.06338","title":"Auto-FedRL: Federated Hyperparameter Optimization for Multi-institutional Medical Image Segmentation","created":"2022-03-12","cited_by_count":16,"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":"2304.05397","title":"Accelerating Hybrid Federated Learning Convergence under Partial Participation","created":"2023-04-10","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":"2102.09026","title":"Optimizing Large-Scale Hyperparameters via Automated Learning Algorithm","created":"2021-02-17","cited_by_count":13,"area":null},{"id":"2102.09645","title":"SVRG Meets AdaGrad: Painless Variance Reduction","created":"2021-02-18","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":"2305.15659","title":"How to escape sharp minima with random perturbations","created":"2023-05-25","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":"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":"2305.17581","title":"Knowledge Distillation Performs Partial Variance Reduction","created":"2023-05-27","cited_by_count":11,"area":"distill"},{"id":"2403.03562","title":"Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond","created":"2024-03-06","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":"2406.01116","title":"Accelerating Heterogeneous Federated Learning with Closed-form Classifiers","created":"2024-06-03","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":"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":"2310.11291","title":"An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent","created":"2023-10-17","cited_by_count":9,"area":null},{"id":"2402.05155","title":"Non-convergence to global minimizers for Adam and stochastic gradient descent optimization and constructions of local minimizers in the training of artificial neural networks","created":"2024-02-07","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":"2402.11215","title":"AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods","created":"2024-02-17","cited_by_count":8,"area":null},{"id":"2102.06759","title":"Stochastic Gradient Langevin Dynamics with Variance Reduction","created":"2021-02-12","cited_by_count":7,"area":null},{"id":"2110.01543","title":"Stochastic Anderson Mixing for Nonconvex Stochastic Optimization","created":"2021-10-04","cited_by_count":7,"area":null},{"id":"2111.00780","title":"Pseudo-Spherical Contrastive Divergence","created":"2021-11-01","cited_by_count":7,"area":null},{"id":"2305.13187","title":"SignSVRG: fixing SignSGD via variance reduction","created":"2023-05-22","cited_by_count":7,"area":null},{"id":"2310.01366","title":"Window-based Model Averaging Improves Generalization in Heterogeneous Federated Learning","created":"2023-10-02","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":"2404.05555","title":"On the Convergence of Continual Learning with Adaptive Methods","created":"2024-04-08","cited_by_count":7,"area":null},{"id":"2209.07883","title":"Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimization","created":"2022-09-16","cited_by_count":6,"area":null},{"id":"2210.01496","title":"Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients","created":"2022-10-04","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":"2309.13278","title":"Distributional Shift-Aware Off-Policy Interval Estimation: A Unified Error Quantification Framework","created":"2023-09-23","cited_by_count":6,"area":null},{"id":"2101.02137","title":"Smoothed functional-based gradient algorithms for off-policy reinforcement learning: A non-asymptotic viewpoint","created":"2021-01-06","cited_by_count":5,"area":null},{"id":"2101.07413","title":"Dynamic Privacy Budget Allocation Improves Data Efficiency of Differentially Private Gradient Descent","created":"2021-01-19","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":"2209.14853","title":"META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions","created":"2022-09-29","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.13680","title":"High Probability Analysis for Non-Convex Stochastic Optimization with Clipping","created":"2023-07-25","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.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":"2501.04287","title":"ElasticZO: A Memory-Efficient On-Device Learning with Combined Zeroth- and First-Order Optimization","created":"2025-01-08","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":"2103.02696","title":"On the Importance of Sampling in Training GCNs: Tighter Analysis and Variance Reduction","created":"2021-03-03","cited_by_count":4,"area":null},{"id":"2105.13650","title":"Data Augmentation for Text Generation Without Any Augmented Data","created":"2021-05-28","cited_by_count":4,"area":null},{"id":"2111.01040","title":"STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization","created":"2021-11-01","cited_by_count":4,"area":null},{"id":"2306.00026","title":"Efficient Stochastic Approximation of Minimax Excess Risk Optimization","created":"2023-05-31","cited_by_count":4,"area":null},{"id":"2406.03006","title":"Quantum Algorithms and Lower Bounds for Finite-Sum Optimization","created":"2024-06-05","cited_by_count":4,"area":null},{"id":"2501.15941","title":"SAPPHIRE: Preconditioned Stochastic Variance Reduction for Faster Large-Scale Statistical Learning","created":"2025-01-27","cited_by_count":4,"area":null},{"id":"2509.05213","title":"An Efficient Subspace Algorithm for Federated Learning on Heterogeneous Data","created":"2025-09-05","cited_by_count":4,"area":null},{"id":"2512.13123","title":"Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences","created":"2025-12-15","cited_by_count":4,"area":null},{"id":"2301.00631","title":"Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimization","created":"2023-01-02","cited_by_count":3,"area":null},{"id":"2303.16279","title":"Accelerated Cyclic Coordinate Dual Averaging with Extrapolation for Composite Convex Optimization","created":"2023-03-28","cited_by_count":3,"area":null},{"id":"2304.09221","title":"Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks","created":"2023-04-18","cited_by_count":3,"area":null},{"id":"2407.03641","title":"Learning Scalable Model Soup on a Single GPU: An Efficient Subspace Training Strategy","created":"2024-07-04","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":"2603.15576","title":"Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions","created":"2026-03-16","cited_by_count":3,"area":null},{"id":"2102.09893","title":"A Variance Controlled Stochastic Method with Biased Estimation for Faster Non-convex Optimization","created":"2021-02-19","cited_by_count":2,"area":null},{"id":"2110.08902","title":"On the Convergence of Experience Replay in Policy Optimization: Characterizing Bias, Variance, and Finite-Time Convergence","created":"2021-10-17","cited_by_count":2,"area":null},{"id":"2202.03524","title":"Finite-Sum Optimization: A New Perspective for Convergence to a Global Solution","created":"2022-02-07","cited_by_count":2,"area":null},{"id":"2208.04075","title":"Pairwise Learning via Stagewise Training in Proximal Setting","created":"2022-08-08","cited_by_count":2,"area":null},{"id":"2212.06283","title":"Variance-Reduced Conservative Policy Iteration","created":"2022-12-12","cited_by_count":2,"area":null},{"id":"2310.11866","title":"Stochastic Optimization for Non-convex Problem with Inexact Hessian Matrix, Gradient, and Function","created":"2023-10-18","cited_by_count":2,"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":"2311.09065","title":"Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints","created":"2023-11-15","cited_by_count":2,"area":null},{"id":"2401.03489","title":"Decentralized Federated Policy Gradient with Byzantine Fault-Tolerance and Provably Fast Convergence","created":"2024-01-07","cited_by_count":2,"area":"deeprl"},{"id":"2401.15890","title":"Probabilistic Guarantees of Stochastic Recursive Gradient in Non-Convex Finite Sum Problems","created":"2024-01-29","cited_by_count":2,"area":null},{"id":"2402.02569","title":"On the Complexity of Finite-Sum Smooth Optimization under the Polyak-{\\L}ojasiewicz Condition","created":"2024-02-04","cited_by_count":2,"area":null},{"id":"2403.06677","title":"Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction","created":"2024-03-11","cited_by_count":2,"area":null},{"id":"2506.14929","title":"FedOne: Query-Efficient Federated Learning for Black-box Discrete Prompt Learning","created":"2025-06-17","cited_by_count":2,"area":null},{"id":"2508.04950","title":"Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization","created":"2025-08-07","cited_by_count":2,"area":null},{"id":"2508.09826","title":"RankList -- A Listwise Preference Learning Framework for Predicting Subjective Preferences","created":"2025-08-13","cited_by_count":2,"area":null}],"next_cursor":"100"}