{"total":61,"rows":[{"id":"2304.13972","title":"Convergence of Adam Under Relaxed Assumptions","created":"2023-04-27","cited_by_count":99,"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":"2110.14074","title":"Fault-Tolerant Federated Reinforcement Learning with Theoretical Guarantee","created":"2021-10-26","cited_by_count":54,"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":"2106.09779","title":"Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses","created":"2021-06-17","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":"2203.06735","title":"Private Non-Convex Federated Learning Without a Trusted Server","created":"2022-03-13","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":"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":"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":"2210.08781","title":"Stochastic Differentially Private and Fair Learning","created":"2022-10-17","cited_by_count":16,"area":null},{"id":"2103.02062","title":"Variance Reduced Training with Stratified Sampling for Forecasting Models","created":"2021-03-02","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":"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":"2305.17581","title":"Knowledge Distillation Performs Partial Variance Reduction","created":"2023-05-27","cited_by_count":11,"area":"distill"},{"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":"2302.11147","title":"Stochastic Approximation Beyond Gradient for Signal Processing and Machine Learning","created":"2023-02-22","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":"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":"2106.02985","title":"Escaping Saddle Points Faster with Stochastic Momentum","created":"2021-06-05","cited_by_count":8,"area":null},{"id":"2109.00534","title":"The Minimax Complexity of Distributed Optimization","created":"2021-09-01","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":"2210.01496","title":"Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients","created":"2022-10-04","cited_by_count":6,"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":"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":"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":"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":"2111.01040","title":"STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization","created":"2021-11-01","cited_by_count":4,"area":null},{"id":"2210.03843","title":"Differentially Private Deep Learning with ModelMix","created":"2022-10-07","cited_by_count":4,"area":null},{"id":"2410.18391","title":"Faster Algorithms for User-Level Private Stochastic Convex Optimization","created":"2024-10-24","cited_by_count":4,"area":null},{"id":"2203.12191","title":"An Adaptive Gradient Method with Energy and Momentum","created":"2022-03-23","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":"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":"2202.09052","title":"Tackling benign nonconvexity with smoothing and stochastic gradients","created":"2022-02-18","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":"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":"2407.20956","title":"An Effective Dynamic Gradient Calibration Method for Continual Learning","created":"2024-07-30","cited_by_count":2,"area":null},{"id":"2103.05138","title":"On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization","created":"2021-03-08","cited_by_count":1,"area":null},{"id":"2110.13144","title":"Faster Perturbed Stochastic Gradient Methods for Finding Local Minima","created":"2021-10-25","cited_by_count":1,"area":null},{"id":"2206.02001","title":"A PDE-based Explanation of Extreme Numerical Sensitivities and Edge of Stability in Training Neural Networks","created":"2022-06-04","cited_by_count":1,"area":null},{"id":"2403.15244","title":"A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness","created":"2024-03-22","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},{"id":"2505.13954","title":"VAMO: Efficient Zeroth-Order Variance Reduction for SGD with Faster Convergence","created":"2025-05-20","cited_by_count":1,"area":null},{"id":"2103.01484","title":"Online Orthogonal Dictionary Learning Based on Frank-Wolfe Method","created":"2021-03-02","cited_by_count":0,"area":null},{"id":"2103.04413","title":"Escaping Saddle Points with Stochastically Controlled Stochastic Gradient Methods","created":"2021-03-07","cited_by_count":0,"area":null},{"id":"2208.02208","title":"SGEM: stochastic gradient with energy and momentum","created":"2022-08-03","cited_by_count":0,"area":null},{"id":"2211.11710","title":"Adaptive Stochastic Optimisation of Nonconvex Composite Objectives","created":"2022-11-21","cited_by_count":0,"area":null},{"id":"2306.01648","title":"Federated Multi-Sequence Stochastic Approximation with Local Hypergradient Estimation","created":"2023-06-02","cited_by_count":0,"area":null},{"id":"2412.14488","title":"A stochastic first-order method with multi-extrapolated momentum for highly smooth unconstrained optimization","created":"2024-12-19","cited_by_count":0,"area":null},{"id":"2512.01930","title":"SVRG and Beyond via Posterior Correction","created":"2025-12-01","cited_by_count":0,"area":null},{"id":"2607.08137","title":"Securing Autonomous Vehicle Systems via Twin-Aware Federated Reinforcement Learning","created":"2026-07-09","cited_by_count":0,"area":"driving"}],"next_cursor":null}