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
Budget offers $50B jolt to help Canada double its electricity grid
0Hacker News New
World of Warcraft Forever's Launch Was Running on over 200k Gigabytes of RAM
0Hacker News New
Ask HN: What workspace/productivity tools do you use and why?
0Hacker News Ask
Ask HN: If you had unlimited Claude credits, what would you build and why?
0Hacker News Ask
Who Uses Grok? and for What?
0Hacker News Ask
DSA
0Hacker News Ask