{"total":111,"rows":[{"id":"2405.15682","title":"The Road Less Scheduled","created":"2024-05-24","cited_by_count":163,"area":null},{"id":"2310.08391","title":"How Many Pretraining Tasks Are Needed for In-Context Learning of Linear Regression?","created":"2023-10-12","cited_by_count":96,"area":null},{"id":"2103.12692","title":"Benign Overfitting of Constant-Stepsize SGD for Linear Regression","created":"2021-03-23","cited_by_count":71,"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":"2406.08466","title":"Scaling Laws in Linear Regression: Compute, Parameters, and Data","created":"2024-06-12","cited_by_count":57,"area":null},{"id":"2210.01400","title":"Linear Convergence of Natural Policy Gradient Methods with Log-Linear Policies","created":"2022-10-04","cited_by_count":46,"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":"2103.12024","title":"Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$","created":"2021-03-22","cited_by_count":42,"area":null},{"id":"2207.04475","title":"Finite-time High-probability Bounds for Polyak-Ruppert Averaged Iterates of Linear Stochastic Approximation","created":"2022-07-10","cited_by_count":41,"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":"2110.06198","title":"Last Iterate Risk Bounds of SGD with Decaying Stepsize for Overparameterized Linear Regression","created":"2021-10-12","cited_by_count":38,"area":null},{"id":"2102.04396","title":"SGD in the Large: Average-case Analysis, Asymptotics, and Stepsize Criticality","created":"2021-02-08","cited_by_count":35,"area":null},{"id":"2108.04552","title":"The Benefits of Implicit Regularization from SGD in Least Squares Problems","created":"2021-08-10","cited_by_count":32,"area":null},{"id":"2110.14427","title":"The ODE Method for Asymptotic Statistics in Stochastic Approximation and Reinforcement Learning","created":"2021-10-27","cited_by_count":32,"area":null},{"id":"2210.00953","title":"Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizes","created":"2022-10-03","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":"2106.03156","title":"Fast and Robust Online Inference with Stochastic Gradient Descent via Random Scaling","created":"2021-06-06","cited_by_count":28,"area":null},{"id":"2106.01257","title":"Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsize","created":"2021-06-02","cited_by_count":27,"area":null},{"id":"2206.02346","title":"Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs","created":"2022-06-06","cited_by_count":27,"area":null},{"id":"2208.01857","title":"The Power and Limitation of Pretraining-Finetuning for Linear Regression under Covariate Shift","created":"2022-08-03","cited_by_count":26,"area":null},{"id":"2310.11677","title":"Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes","created":"2023-10-18","cited_by_count":25,"area":null},{"id":"2203.16462","title":"Convergence of gradient descent for deep neural networks","created":"2022-03-30","cited_by_count":24,"area":null},{"id":"2206.07252","title":"Implicit Regularization or Implicit Conditioning? Exact Risk Trajectories of SGD in High Dimensions","created":"2022-06-15","cited_by_count":23,"area":null},{"id":"2310.06771","title":"Correlated Noise Provably Beats Independent Noise for Differentially Private Learning","created":"2023-10-10","cited_by_count":23,"area":null},{"id":"2101.08925","title":"Differentially Private SGD with Non-Smooth Losses","created":"2021-01-22","cited_by_count":22,"area":null},{"id":"2206.05850","title":"Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Conservative Natural Policy Gradient Primal-Dual Algorithm","created":"2022-06-12","cited_by_count":20,"area":null},{"id":"2405.16644","title":"Gaussian Approximation and Multiplier Bootstrap for Polyak-Ruppert Averaged Linear Stochastic Approximation with Applications to TD Learning","created":"2024-05-26","cited_by_count":19,"area":null},{"id":"2306.01854","title":"Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space","created":"2023-06-02","cited_by_count":18,"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":"2401.13884","title":"Constant Stepsize Q-learning: Distributional Convergence, Bias and Extrapolation","created":"2024-01-25","cited_by_count":17,"area":"deeprl"},{"id":"2110.14109","title":"Eigencurve: Optimal Learning Rate Schedule for SGD on Quadratic Objectives with Skewed Hessian Spectrums","created":"2021-10-27","cited_by_count":15,"area":null},{"id":"2203.08564","title":"An elementary analysis of ridge regression with random design","created":"2022-03-16","cited_by_count":15,"area":null},{"id":"2401.00364","title":"Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise","created":"2023-12-31","cited_by_count":15,"area":null},{"id":"2102.09924","title":"A proof of convergence for gradient descent in the training of artificial neural networks for constant target functions","created":"2021-02-19","cited_by_count":14,"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":"2103.06263","title":"Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution","created":"2021-03-10","cited_by_count":13,"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.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":"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":"2405.17834","title":"Revisiting Step-Size Assumptions in Stochastic Approximation","created":"2024-05-28","cited_by_count":10,"area":null},{"id":"2602.03702","title":"Anytime Pretraining: Horizon-Free Learning-Rate Schedules with Weight Averaging","created":"2026-02-03","cited_by_count":10,"area":null},{"id":"2104.00277","title":"A proof of convergence for stochastic gradient descent in the training of artificial neural networks with ReLU activation for constant target functions","created":"2021-04-01","cited_by_count":9,"area":null},{"id":"2108.08106","title":"Existence, uniqueness, and convergence rates for gradient flows in the training of artificial neural networks with ReLU activation","created":"2021-08-18","cited_by_count":9,"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":"2203.01744","title":"Accelerated SGD for Non-Strongly-Convex Least Squares","created":"2022-03-03","cited_by_count":9,"area":null},{"id":"2312.14567","title":"Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise","created":"2023-12-22","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":"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":"2409.09745","title":"The Optimality of (Accelerated) SGD for High-Dimensional Quadratic Optimization","created":"2024-09-15","cited_by_count":8,"area":null},{"id":"2502.06761","title":"When, Where and Why to Average Weights?","created":"2025-02-10","cited_by_count":8,"area":null},{"id":"2602.06797","title":"Optimal Learning Rate Schedules under Functional Scaling Laws: Power Decay and Warmup-Stable-Decay","created":"2026-02-06","cited_by_count":8,"area":null},{"id":"2111.06171","title":"Convergence and Stability of the Stochastic Proximal Point Algorithm with Momentum","created":"2021-11-11","cited_by_count":7,"area":null},{"id":"2303.01370","title":"Non asymptotic analysis of Adaptive stochastic gradient algorithms and applications","created":"2023-03-01","cited_by_count":7,"area":null},{"id":"2309.02944","title":"The case for and against fixed step-size: Stochastic approximation algorithms in optimization and machine learning","created":"2023-09-06","cited_by_count":7,"area":null},{"id":"2402.03839","title":"Random features models: a way to study the success of naive imputation","created":"2024-02-06","cited_by_count":7,"area":null},{"id":"2305.12056","title":"Uniform-in-Time Wasserstein Stability Bounds for (Noisy) Stochastic Gradient Descent","created":"2023-05-20","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":"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":"2109.07117","title":"Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Streaming Data","created":"2021-09-15","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":"2202.07960","title":"Temporal Difference Learning with Continuous Time and State in the Stochastic Setting","created":"2022-02-16","cited_by_count":5,"area":null},{"id":"2505.21796","title":"A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging","created":"2025-05-27","cited_by_count":4,"area":null},{"id":"2505.22048","title":"Learning Curves of Stochastic Gradient Descent in Kernel Regression","created":"2025-05-28","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":"2205.13255","title":"Active Labeling: Streaming Stochastic Gradients","created":"2022-05-26","cited_by_count":3,"area":null},{"id":"2310.02941","title":"Hoeffding's Inequality for Markov Chains under Generalized Concentrability Condition","created":"2023-10-04","cited_by_count":3,"area":null},{"id":"2403.08585","title":"Improving Implicit Regularization of SGD with Preconditioning for Least Square Problems","created":"2024-03-13","cited_by_count":3,"area":null},{"id":"2504.08178","title":"A Piecewise Lyapunov Analysis of Sub-quadratic SGD: Applications to Robust and Quantile Regression","created":"2025-04-11","cited_by_count":3,"area":null},{"id":"2507.03404","title":"On the Effectiveness of the z-Transform Method in Quadratic Optimization","created":"2025-07-04","cited_by_count":3,"area":null},{"id":"2507.20403","title":"A General Framework for Estimating Preferences Using Response Time Data","created":"2025-07-27","cited_by_count":3,"area":null},{"id":"2602.02445","title":"Finite-Sample Wasserstein Error Bounds and Concentration Inequalities for Nonlinear Stochastic Approximation","created":"2026-02-02","cited_by_count":3,"area":null},{"id":"2204.12466","title":"Meta-free few-shot learning via representation learning with weight averaging","created":"2022-04-26","cited_by_count":2,"area":null},{"id":"2205.12549","title":"Learning from time-dependent streaming data with online stochastic algorithms","created":"2022-05-25","cited_by_count":2,"area":null},{"id":"2302.10726","title":"Exploring Local Norms in Exp-concave Statistical Learning","created":"2023-02-21","cited_by_count":2,"area":null},{"id":"2405.03236","title":"Federated Reinforcement Learning with Constraint Heterogeneity","created":"2024-05-06","cited_by_count":2,"area":"deeprl"},{"id":"2405.07432","title":"Nonparametric Sparse Online Learning of the Koopman Operator","created":"2024-05-13","cited_by_count":2,"area":null},{"id":"2408.01736","title":"Can LLMs predict the convergence of Stochastic Gradient Descent?","created":"2024-08-03","cited_by_count":2,"area":null},{"id":"2410.04228","title":"SGD with memory: fundamental properties and stochastic acceleration","created":"2024-10-05","cited_by_count":2,"area":null},{"id":"2508.14338","title":"On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks","created":"2025-08-20","cited_by_count":2,"area":null},{"id":"2510.07093","title":"Non-Asymptotic Analysis of Efficiency in Conformalized Regression","created":"2025-10-08","cited_by_count":2,"area":null},{"id":"2510.12013","title":"Statistical Guarantees for High-Dimensional Stochastic Gradient Descent","created":"2025-10-13","cited_by_count":2,"area":null},{"id":"2604.09909","title":"Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size","created":"2026-04-10","cited_by_count":2,"area":null},{"id":"2101.12113","title":"Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning","created":"2021-01-28","cited_by_count":1,"area":null},{"id":"2205.11033","title":"Augmented Newton Method for Optimization: Global Linear Rate and Momentum Interpretation","created":"2022-05-23","cited_by_count":1,"area":null},{"id":"2310.12140","title":"Online Estimation with Rolling Validation: Adaptive Nonparametric Estimation with Streaming Data","created":"2023-10-18","cited_by_count":1,"area":null},{"id":"2311.03483","title":"Hebbian learning inspired estimation of the linear regression parameters from queries","created":"2023-09-26","cited_by_count":1,"area":null},{"id":"2406.18623","title":"Unbiased least squares regression via averaged stochastic gradient descent","created":"2024-06-26","cited_by_count":1,"area":null},{"id":"2502.14123","title":"Understanding SGD with Exponential Moving Average: A Case Study in Linear Regression","created":"2025-02-19","cited_by_count":1,"area":"diffusion"},{"id":"2509.21174","title":"Breaking the curse of dimensionality for linear rules: optimal predictors over the ellipsoid","created":"2025-09-25","cited_by_count":1,"area":null},{"id":"2602.15538","title":"Functional Central Limit Theorem for Stochastic Gradient Descent","created":"2026-02-17","cited_by_count":1,"area":null},{"id":"2109.03207","title":"COCO Denoiser: Using Co-Coercivity for Variance Reduction in Stochastic Convex Optimization","created":"2021-09-07","cited_by_count":0,"area":null},{"id":"2111.05232","title":"Learning Rates for Nonconvex Pairwise Learning","created":"2021-11-09","cited_by_count":0,"area":null},{"id":"2111.06826","title":"Convergence Rates for the MAP of an Exponential Family and Stochastic Mirror Descent -- an Open Problem","created":"2021-11-12","cited_by_count":0,"area":null},{"id":"2311.11180","title":"Nonsmooth Projection-Free Optimization with Functional Constraints","created":"2023-11-18","cited_by_count":0,"area":null},{"id":"2403.11163","title":"A Selective Review on Statistical Methods for Massive Data Computation: Distributed Computing, Subsampling, and Minibatch Techniques","created":"2024-03-17","cited_by_count":0,"area":null},{"id":"2404.19496","title":"Online and Offline Robust Multivariate Linear Regression","created":"2024-04-30","cited_by_count":0,"area":null},{"id":"2405.14459","title":"Semi-Discrete Optimal Transport: Nearly Minimax Estimation With Stochastic Gradient Descent and Adaptive Entropic Regularization","created":"2024-05-23","cited_by_count":0,"area":null},{"id":"2406.03696","title":"Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression","created":"2024-06-06","cited_by_count":0,"area":null},{"id":"2406.19475","title":"Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization","created":"2024-06-27","cited_by_count":0,"area":null}],"next_cursor":"100"}