{"total":140,"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":"2111.10603","title":"Reasonable Effectiveness of Random Weighting: A Litmus Test for Multi-Task Learning","created":"2021-11-20","cited_by_count":101,"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":"2112.10775","title":"HarmoFL: Harmonizing Local and Global Drifts in Federated Learning on Heterogeneous Medical Images","created":"2021-12-20","cited_by_count":64,"area":null},{"id":"2305.18471","title":"Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptions","created":"2023-05-29","cited_by_count":57,"area":null},{"id":"2107.00052","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","created":"2021-06-30","cited_by_count":43,"area":null},{"id":"2302.05882","title":"From high-dimensional & mean-field dynamics to dimensionless ODEs: A unifying approach to SGD in two-layers networks","created":"2023-02-12","cited_by_count":43,"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":"2105.01650","title":"Stochastic gradient descent with noise of machine learning type. Part I: Discrete time analysis","created":"2021-05-04","cited_by_count":39,"area":null},{"id":"2206.12680","title":"Topology-aware Generalization of Decentralized SGD","created":"2022-06-25","cited_by_count":38,"area":null},{"id":"2202.07262","title":"Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methods","created":"2022-02-15","cited_by_count":37,"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":"2102.09385","title":"Convergence of stochastic gradient descent schemes for Lojasiewicz-landscapes","created":"2021-02-16","cited_by_count":28,"area":null},{"id":"2309.13591","title":"Robust Distributed Learning: Tight Error Bounds and Breakdown Point under Data Heterogeneity","created":"2023-09-24","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":"2110.03891","title":"Does Momentum Change the Implicit Regularization on Separable Data?","created":"2021-10-08","cited_by_count":22,"area":null},{"id":"2110.15412","title":"Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize","created":"2021-10-28","cited_by_count":22,"area":null},{"id":"2305.15349","title":"On the Convergence of Black-Box Variational Inference","created":"2023-05-24","cited_by_count":22,"area":null},{"id":"2306.02601","title":"Aiming towards the minimizers: fast convergence of SGD for overparametrized problems","created":"2023-06-05","cited_by_count":22,"area":null},{"id":"2211.15943","title":"Fully Stochastic Trust-Region Sequential Quadratic Programming for Equality-Constrained Optimization Problems","created":"2022-11-29","cited_by_count":21,"area":null},{"id":"2106.11851","title":"Stochastic Polyak Stepsize with a Moving Target","created":"2021-06-22","cited_by_count":19,"area":null},{"id":"2110.15784","title":"Convergence of Uncertainty Sampling for Active Learning","created":"2021-10-29","cited_by_count":19,"area":null},{"id":"2107.00464","title":"On the Convergence of Stochastic Extragradient for Bilinear Games using Restarted Iteration Averaging","created":"2021-06-30","cited_by_count":18,"area":null},{"id":"2405.01031","title":"The Privacy Power of Correlated Noise in Decentralized Learning","created":"2024-05-02","cited_by_count":18,"area":null},{"id":"2106.03696","title":"Dynamics of Stochastic Momentum Methods on Large-scale, Quadratic Models","created":"2021-06-07","cited_by_count":16,"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.11442","title":"Towards Noise-adaptive, Problem-adaptive (Accelerated) Stochastic Gradient Descent","created":"2021-10-21","cited_by_count":16,"area":null},{"id":"2211.00188","title":"Adaptive Compression for Communication-Efficient Distributed Training","created":"2022-10-31","cited_by_count":16,"area":null},{"id":"2106.07644","title":"A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossip","created":"2021-06-10","cited_by_count":15,"area":null},{"id":"2312.02828","title":"Convergence Rates for Stochastic Approximation: Biased Noise with Unbounded Variance, and Applications","created":"2023-12-05","cited_by_count":15,"area":null},{"id":"2402.13794","title":"Revisiting Convergence of AdaGrad with Relaxed Assumptions","created":"2024-02-21","cited_by_count":15,"area":null},{"id":"2209.08005","title":"Stability and Generalization for Markov Chain Stochastic Gradient Methods","created":"2022-09-16","cited_by_count":14,"area":null},{"id":"2302.14043","title":"Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions","created":"2023-02-27","cited_by_count":14,"area":null},{"id":"2305.15938","title":"First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities","created":"2023-05-25","cited_by_count":14,"area":null},{"id":"2402.18551","title":"Implicit Optimization Bias of Next-Token Prediction in Linear Models","created":"2024-02-28","cited_by_count":14,"area":null},{"id":"2404.01436","title":"Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance","created":"2024-04-01","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":"2206.07553","title":"On the fast convergence of minibatch heavy ball momentum","created":"2022-06-15","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":"2102.07586","title":"On Riemannian Stochastic Approximation Schemes with Fixed Step-Size","created":"2021-02-15","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":"2404.08634","title":"When Attention Collapses: How Degenerate Layers in LLMs Enable Smaller, Stronger Models","created":"2024-04-12","cited_by_count":12,"area":null},{"id":"2504.04579","title":"From Continual Learning to SGD and Back: Better Rates for Continual Linear Models","created":"2025-04-06","cited_by_count":12,"area":null},{"id":"2507.11274","title":"Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime","created":"2025-07-15","cited_by_count":12,"area":null},{"id":"2306.08393","title":"Provably Personalized and Robust Federated Learning","created":"2023-06-14","cited_by_count":11,"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":"2405.14432","title":"Adaptive Gradient Clipping for Robust Federated Learning","created":"2024-05-23","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":"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":"2202.03525","title":"Nesterov Accelerated Shuffling Gradient Method for Convex Optimization","created":"2022-02-07","cited_by_count":10,"area":null},{"id":"2205.15142","title":"Special Properties of Gradient Descent with Large Learning Rates","created":"2022-05-30","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":"2405.17834","title":"Revisiting Step-Size Assumptions in Stochastic Approximation","created":"2024-05-28","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":"2106.03524","title":"Theoretically Better and Numerically Faster Distributed Optimization with Smoothness-Aware Quantization Techniques","created":"2021-06-07","cited_by_count":9,"area":null},{"id":"2203.01744","title":"Accelerated SGD for Non-Strongly-Convex Least Squares","created":"2022-03-03","cited_by_count":9,"area":null},{"id":"2211.01914","title":"FedGen: Generalizable Federated Learning for Sequential Data","created":"2022-11-03","cited_by_count":9,"area":null},{"id":"2305.18285","title":"Partially Personalized Federated Learning: Breaking the Curse of Data Heterogeneity","created":"2023-05-29","cited_by_count":9,"area":null},{"id":"2107.11774","title":"SGD with a Constant Large Learning Rate Can Converge to Local Maxima","created":"2021-07-25","cited_by_count":8,"area":null},{"id":"2110.09057","title":"Training Deep Neural Networks with Adaptive Momentum Inspired by the Quadratic Optimization","created":"2021-10-18","cited_by_count":8,"area":null},{"id":"2203.03159","title":"Risk Bounds of Multi-Pass SGD for Least Squares in the Interpolation Regime","created":"2022-03-07","cited_by_count":8,"area":null},{"id":"2210.05607","title":"Divergence Results and Convergence of a Variance Reduced Version of ADAM","created":"2022-10-11","cited_by_count":8,"area":null},{"id":"2302.03550","title":"Exponential convergence rates for momentum stochastic gradient descent in the overparametrized setting","created":"2023-02-07","cited_by_count":8,"area":null},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-26","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":"2410.12455","title":"Loss Landscape Characterization of Neural Networks without Over-Parametrization","created":"2024-10-16","cited_by_count":8,"area":null},{"id":"2511.11466","title":"Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates","created":"2025-11-14","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":"2111.13322","title":"Random-reshuffled SARAH does not need a full gradient computations","created":"2021-11-26","cited_by_count":7,"area":null},{"id":"2306.11201","title":"Adaptive Federated Learning with Auto-Tuned Clients","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2410.08395","title":"Nesterov acceleration in benignly non-convex landscapes","created":"2024-10-10","cited_by_count":7,"area":null},{"id":"2208.11246","title":"Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion","created":"2022-08-24","cited_by_count":6,"area":null},{"id":"2210.14560","title":"Hierarchical Federated Learning with Momentum Acceleration in Multi-Tier Networks","created":"2022-10-26","cited_by_count":6,"area":null},{"id":"2302.07851","title":"Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization","created":"2023-02-15","cited_by_count":6,"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":"2303.10758","title":"Lower Generalization Bounds for GD and SGD in Smooth Stochastic Convex Optimization","created":"2023-03-19","cited_by_count":6,"area":null},{"id":"2405.00017","title":"Queuing dynamics of asynchronous Federated Learning","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2108.11872","title":"Comparing Classes of Estimators: When does Gradient Descent Beat Ridge Regression in Linear Models?","created":"2021-08-26","cited_by_count":5,"area":null},{"id":"2110.06910","title":"On the Double Descent of Random Features Models Trained with SGD","created":"2021-10-13","cited_by_count":5,"area":null},{"id":"2209.00771","title":"Optimizing the Performative Risk under Weak Convexity Assumptions","created":"2022-09-02","cited_by_count":5,"area":null},{"id":"2308.02001","title":"Memory capacity of two layer neural networks with smooth activations","created":"2023-08-03","cited_by_count":5,"area":null},{"id":"2504.01898","title":"Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation","created":"2025-04-02","cited_by_count":5,"area":null},{"id":"2201.12719","title":"Faster Convergence of Local SGD for Over-Parameterized Models","created":"2022-01-30","cited_by_count":4,"area":null},{"id":"2405.15941","title":"A Unified Theory of Stochastic Proximal Point Methods without Smoothness","created":"2024-05-24","cited_by_count":4,"area":null},{"id":"2406.13936","title":"Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods","created":"2024-06-20","cited_by_count":4,"area":null},{"id":"2111.13162","title":"Randomized Stochastic Gradient Descent Ascent","created":"2021-11-25","cited_by_count":3,"area":null},{"id":"2201.12678","title":"A Stochastic Bundle Method for Interpolating Networks","created":"2022-01-29","cited_by_count":3,"area":null},{"id":"2210.17070","title":"Private optimization in the interpolation regime: faster rates and hardness results","created":"2022-10-31","cited_by_count":3,"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":"2311.17539","title":"Critical Influence of Overparameterization on Sharpness-aware Minimization","created":"2023-11-29","cited_by_count":3,"area":null},{"id":"2402.17890","title":"From Inverse Optimization to Feasibility to ERM","created":"2024-02-27","cited_by_count":3,"area":null},{"id":"2407.02322","title":"Stochastic Differential Equations models for Least-Squares Stochastic Gradient Descent","created":"2024-07-02","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":"2603.09355","title":"SHANG++: Robust Stochastic Acceleration under Multiplicative Noise","created":"2026-03-10","cited_by_count":3,"area":null},{"id":"2102.03112","title":"DeepReduce: A Sparse-tensor Communication Framework for Distributed Deep Learning","created":"2021-02-05","cited_by_count":2,"area":null},{"id":"2105.00602","title":"OCTOPUS: Overcoming Performance andPrivatization Bottlenecks in Distributed Learning","created":"2021-05-03","cited_by_count":2,"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":"2303.16241","title":"Convergence of the Stochastic Heavy Ball Method With Approximate Gradients and/or Block Updating","created":"2023-03-28","cited_by_count":2,"area":null},{"id":"2305.05675","title":"UAdam: Unified Adam-Type Algorithmic Framework for Non-Convex Stochastic Optimization","created":"2023-05-09","cited_by_count":2,"area":null}],"next_cursor":"100"}