{"total":51,"rows":[{"id":"2208.09632","title":"Adam Can Converge Without Any Modification On Update Rules","created":"2022-08-20","cited_by_count":114,"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.03183","title":"Last iterate convergence of SGD for Least-Squares in the Interpolation regime","created":"2021-02-05","cited_by_count":42,"area":null},{"id":"2208.09900","title":"Provable Adaptivity of Adam under Non-uniform Smoothness","created":"2022-08-21","cited_by_count":30,"area":null},{"id":"2106.13897","title":"Implicit Gradient Alignment in Distributed and Federated Learning","created":"2021-06-25","cited_by_count":29,"area":null},{"id":"2308.08977","title":"Hitting the High-Dimensional Notes: An ODE for SGD learning dynamics on GLMs and multi-index models","created":"2023-08-17","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":"2110.03891","title":"Does Momentum Change the Implicit Regularization on Separable Data?","created":"2021-10-08","cited_by_count":22,"area":null},{"id":"2106.04759","title":"Communication-efficient SGD: From Local SGD to One-Shot Averaging","created":"2021-06-09","cited_by_count":19,"area":null},{"id":"2110.11442","title":"Towards Noise-adaptive, Problem-adaptive (Accelerated) Stochastic Gradient Descent","created":"2021-10-21","cited_by_count":16,"area":null},{"id":"2306.12747","title":"Don't be so Monotone: Relaxing Stochastic Line Search in Over-Parameterized Models","created":"2023-06-22","cited_by_count":15,"area":null},{"id":"2102.09645","title":"SVRG Meets AdaGrad: Painless Variance Reduction","created":"2021-02-18","cited_by_count":13,"area":null},{"id":"2406.04142","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","created":"2024-06-06","cited_by_count":13,"area":null},{"id":"2306.11497","title":"Convergence and concentration properties of constant step-size SGD through Markov chains","created":"2023-06-20","cited_by_count":11,"area":null},{"id":"2106.02720","title":"An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning","created":"2021-06-04","cited_by_count":10,"area":null},{"id":"2108.04620","title":"A proof of convergence for the gradient descent optimization method with random initializations in the training of neural networks with ReLU activation for piecewise linear target functions","created":"2021-08-10","cited_by_count":10,"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":"2307.14642","title":"Linear Convergence of Black-Box Variational Inference: Should We Stick the Landing?","created":"2023-07-27","cited_by_count":10,"area":null},{"id":"2402.17235","title":"Stochastic Gradient Succeeds for Bandits","created":"2024-02-27","cited_by_count":10,"area":null},{"id":"2511.04622","title":"ODE approximation for the Adam algorithm: General and overparametrized setting","created":"2025-11-06","cited_by_count":10,"area":null},{"id":"2112.07369","title":"Convergence proof for stochastic gradient descent in the training of deep neural networks with ReLU activation for constant target functions","created":"2021-12-13","cited_by_count":9,"area":null},{"id":"2308.14929","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","created":"2023-08-28","cited_by_count":8,"area":null},{"id":"2306.11201","title":"Adaptive Federated Learning with Auto-Tuned Clients","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2303.10472","title":"Practical and Matching Gradient Variance Bounds for Black-Box Variational Bayesian Inference","created":"2023-03-18","cited_by_count":6,"area":null},{"id":"2111.08172","title":"Off-Policy Actor-Critic with Emphatic Weightings","created":"2021-11-16","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":"2506.00181","title":"On the Interaction of Batch Noise, Adaptivity, and Compression, under $(L_0,L_1)$-Smoothness: An SDE Approach","created":"2025-05-30","cited_by_count":4,"area":null},{"id":"2305.13471","title":"Fast Convergence in Learning Two-Layer Neural Networks with Separable Data","created":"2023-05-22","cited_by_count":3,"area":null},{"id":"2503.00229","title":"Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster","created":"2025-02-28","cited_by_count":3,"area":null},{"id":"2509.02970","title":"Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation","created":"2025-09-03","cited_by_count":3,"area":null},{"id":"2206.05869","title":"On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms","created":"2022-06-13","cited_by_count":2,"area":null},{"id":"2408.03199","title":"Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models","created":"2024-08-06","cited_by_count":2,"area":null},{"id":"2505.17965","title":"Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2304.00459","title":"Fast Convergence of Random Reshuffling under Over-Parameterization and the Polyak-\\L ojasiewicz Condition","created":"2023-04-02","cited_by_count":1,"area":null},{"id":"2408.05560","title":"Incremental Gauss-Newton Descent for Machine Learning","created":"2024-08-10","cited_by_count":1,"area":null},{"id":"2505.21721","title":"Nearly Dimension-Independent Convergence of Mean-Field Black-Box Variational Inference","created":"2025-05-27","cited_by_count":1,"area":null},{"id":"2604.10373","title":"Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD","created":"2026-04-11","cited_by_count":1,"area":null},{"id":"2605.07841","title":"\\mathsf{VISTA}: Decentralized Machine Learning in Adversary Dominated Environments","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2106.11548","title":"Adaptive Learning Rate and Momentum for Training Deep Neural Networks","created":"2021-06-22","cited_by_count":0,"area":null},{"id":"2303.16502","title":"Unified analysis of SGD-type methods","created":"2023-03-29","cited_by_count":0,"area":null},{"id":"2404.02378","title":"Faster Convergence of Stochastic Accelerated Gradient Descent under Interpolation","created":"2024-04-03","cited_by_count":0,"area":null},{"id":"2510.20608","title":"Convergence Analysis of SGD under Expected Smoothness","created":"2025-10-23","cited_by_count":0,"area":null},{"id":"2511.20207","title":"Adaptive SGD with Line-Search and Polyak Stepsizes: Nonconvex Convergence and Accelerated Rates","created":"2025-11-25","cited_by_count":0,"area":null},{"id":"2601.16812","title":"Sample-wise Constrained Learning via a Sequential Penalty Approach with Applications in Image Processing","created":"2026-01-23","cited_by_count":0,"area":null},{"id":"2602.18718","title":"Stochastic Gradient Variational Inference with Price's Gradient Estimator from Bures-Wasserstein to Parameter Space","created":"2026-02-21","cited_by_count":0,"area":null},{"id":"2602.22936","title":"Generalization Bounds of Stochastic Gradient Descent in Homogeneous Neural Networks","created":"2026-02-26","cited_by_count":0,"area":null},{"id":"2604.14017","title":"Stochastic Trust-Region Methods for Over-parameterized Models","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2606.28123","title":"Dangerous Liaisons of Convex Learning and Non-Affine Aggregation","created":"2026-06-26","cited_by_count":0,"area":null},{"id":"2607.12360","title":"Same Loss, Same Noise, Opposite Schedules: Noise Structure and Optimizer Normalization Jointly Determine Whether Learning-Rate Cooldown Helps","created":"2026-07-14","cited_by_count":0,"area":null},{"id":"2608.03001","title":"Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework","created":"2026-08-04","cited_by_count":0,"area":null},{"id":"2609.36668","title":"Stochastic Heavy Ball with Polyak Step Size and Armijo Line Search: A General Convergence Analysis","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}