stat.MLSep 17, 2025

On the Rate of Gaussian Approximation for Online Linear Regression Problems

Authors: Marina Sheshukova, Alain Durmus, Marat Khusainov, Sergey Samsonov

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 dd and quantities related to the design matrix. When the number of iterations nn is known in advance, our results yield a normal approximation rate of order log⁡n/n\sqrt{\log{n}/n}, provided that the sample size nn is large enough.

Figures & tables

Explore similar work

CardsList
  1. Lower Bounds on Inference Complexity for Polyak-Ruppert Averaged Stochastic Gradient Descent

    Oct 31, 2026Denis Belomestny, Alexey Naumov, Sergey SamsonovStochastic Gradient DescentPolyak-Ruppert Averaging

  2. Finite-Sample Performance of Gradient Descent in Logistic Regression with Gaussian Design

    Jun 19, 2026Junren Chen, Arya MazumdarLogistic RegressionGradient Descent