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
Tesla winds down Cybertruck production after years of poor sales in few markets
0Hacker News
Pushing the Limits with Getaddrinfo
0Hacker News New
A high school science teacher stumbled upon the first known T. Rex trackway
0Hacker News New
Computational approaches for RNA structure prediction and design
0Hacker News New
Finding Pronatalism in Germany
0Hacker News New
Never reverse engineer the same function twice
0Hacker News New