General
On the Rate of Gaussian Approximation for Online Linear Regression Problems
arXiv stat.ML0 views
arXiv:2509.14039v2 Announce Type: replace Abstract: In this paper, we consider the problem of Gaussian approximation for the online linear regression task. We derive the corresponding rates for the setting of a constant stepsize and study the explicit dependence of the convergence rate on the problem dimension $d$ and quantities related to the design matrix. When the number of iterations $n$ is known in advance, our results yield a normal approximation rate of order $\sqrt{\log{n}/n}$, provided that the sample size $n$ is large enough.
Source:https://arxiv.org/abs/2509.14039PreviousSpectral and Subspace Dynamics of LoRA in Supervised Fine-Tuning and Reinforcement LearningNextVariational Estimators for Node Popularity Models
Related posts
Hundreds of streaming services and nothing to watch
0Ars Technica

Lego’s BrickLink marketplace has been offline for a week following ‘unusual activity’
0The Verge
Nvidia CEO Jensen Huang resigns after reports of extramarital relationships
0Hacker News
Electric Ship Batteries Promise Compact, Cooler Power
0Hacker News
Talking Zen 6 with Mike Clark at AMD In-Depth
0Hacker News
Abandoned Quake 4 expansion finished by modders and now playable
0Hacker News