{"total":42,"rows":[{"id":"2402.01092","title":"A Dynamical Model of Neural Scaling Laws","created":"2024-02-02","cited_by_count":111,"area":null},{"id":"2106.09524","title":"Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticity","created":"2021-06-17","cited_by_count":110,"area":null},{"id":"2105.15004","title":"Generalization Error Rates in Kernel Regression: The Crossover from the Noiseless to Noisy Regime","created":"2021-05-31","cited_by_count":96,"area":null},{"id":"2205.09588","title":"How catastrophic can catastrophic forgetting be in linear regression?","created":"2022-05-19","cited_by_count":81,"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":"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":"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":"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":"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":"2201.12655","title":"Error Scaling Laws for Kernel Classification under Source and Capacity Conditions","created":"2022-01-29","cited_by_count":17,"area":null},{"id":"2310.20581","title":"Stochastic Gradient Descent for Gaussian Processes Done Right","created":"2023-10-31","cited_by_count":17,"area":null},{"id":"2607.21716","title":"A Defense of the Quadratic Model","created":"2026-07-23","cited_by_count":14,"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":"2206.11124","title":"A view of mini-batch SGD via generating functions: conditions of convergence, phase transitions, benefit from negative momenta","created":"2022-06-22","cited_by_count":11,"area":null},{"id":"2506.08415","title":"Improved Scaling Laws in Linear Regression via Data Reuse","created":"2025-06-10","cited_by_count":11,"area":null},{"id":"2202.00992","title":"Tight Convergence Rate Bounds for Optimization Under Power Law Spectral Conditions","created":"2022-02-02","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":"2506.06501","title":"Optimal Rates in Continual Linear Regression via Increasing Regularization","created":"2025-06-06","cited_by_count":8,"area":null},{"id":"2602.04774","title":"Theory of Optimal Learning Rate Schedules and Scaling Laws for a Random Feature Model","created":"2026-02-04","cited_by_count":7,"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":"2211.08958","title":"Vector-Valued Least-Squares Regression under Output Regularity Assumptions","created":"2022-11-16","cited_by_count":5,"area":null},{"id":"2302.06757","title":"Kernelized Diffusion maps","created":"2023-02-13","cited_by_count":5,"area":null},{"id":"2604.13870","title":"Gradient Descent's Last Iterate is Often (slightly) Suboptimal","created":"2026-04-15","cited_by_count":4,"area":null},{"id":"2405.19585","title":"The High Line: Exact Risk and Learning Rate Curves of Stochastic Adaptive Learning Rate Algorithms","created":"2024-05-30","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":"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":"2410.04228","title":"SGD with memory: fundamental properties and stochastic acceleration","created":"2024-10-05","cited_by_count":2,"area":null},{"id":"2509.08980","title":"Green Federated Learning via Carbon-Aware Client and Time Slot Scheduling","created":"2025-09-10","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":"2106.02713","title":"Learning Curves for SGD on Structured Features","created":"2021-06-04","cited_by_count":1,"area":null},{"id":"2302.09727","title":"Statistical Inference for Linear Functionals of Online SGD in High-dimensional Linear Regression","created":"2023-02-20","cited_by_count":1,"area":null},{"id":"2504.12519","title":"Corner Gradient Descent","created":"2025-04-16","cited_by_count":1,"area":null},{"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":"2510.19734","title":"Statistical Inference for Linear Functionals of Online Least-squares SGD when $t \\gtrsim d^{1+\\delta}$","created":"2025-10-22","cited_by_count":1,"area":null},{"id":"2210.11562","title":"Local SGD in Overparameterized Linear Regression","created":"2022-10-20","cited_by_count":0,"area":null},{"id":"2307.04841","title":"Loss Dynamics of Temporal Difference Reinforcement Learning","created":"2023-07-10","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":"2405.15894","title":"Derivatives of Stochastic Gradient Descent in parametric optimization","created":"2024-05-24","cited_by_count":0,"area":null},{"id":"2606.29593","title":"How AI settled the complexity of the oldest SGD algorithm","created":"2026-06-28","cited_by_count":0,"area":null},{"id":"2608.22953","title":"Stochastic gradient descent with initial regularization","created":"2026-08-24","cited_by_count":0,"area":null},{"id":"2610.16518","title":"Asymptotic Risk of Learning-Rate Schedules for Least-Squares Regression with Discretely Distributed Features","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}