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
At least 10 local governments have moved to drop Flock’s surveillance cameras since summer
0TechCrunch
The Poison and the Cure the Life and Afterlife of French Theory
0Hacker News
Astronauts arrive at International Space Station just 8 hours after launching
0Hacker News
Multiplayer tanks that demolish real buildings from OpenStreetMap
0Hacker News
How Book Collectors Use iPhone Notes to Track First Editions and Discoveries
0dev.to Productivity
How to Build a Simple Self-Care Checklist
0dev.to Beginners