stat.MLSep 17, 2025
SaveOn the Rate of Gaussian Approximation for Online Linear Regression Problems
Organizations: HSE University · CMAP, CNRS, École Polytechnique · Université Paris-Saclay
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 and quantities related to the design matrix. When the number of iterations is known in advance, our results yield a normal approximation rate of order , provided that the sample size is large enough.
Figures & tables
Figure 1: Case 1: Kolmogorov distance between the empirical distribution of the projected last iterate of SGD and the Gaussian limit: (a) linear scale, (b) logarithmic scale.
Figure 2: Case 1: Kolmogorov distance between the empirical distribution of the projected last iterate of SGD and the Gaussian limit rescaled by : (a) linear scale, (b) logarithmic scale.
Figure 3: Case 2: Kolmogorov distance between the empirical distribution of the projected last iterate of SGD and the Gaussian limit: (a) linear scale, (b) logarithmic scale.
Figure 4: Case 2: Kolmogorov distance between the empirical distribution of the projected last iterate of SGD and the Gaussian limit rescaled by : (a) linear scale, (b) logarithmic scale.
More in this topic
Linear Regression
Linear regression models how outcomes depend on features through weighted sums, supporting prediction, inference, and analysis of learning algorithms.
See all 84 papers