Finite sample performance of linear least squares estimators under sub-Gaussian martingale difference noise
Michael Krikheli, Amir Leshem

TL;DR
This paper provides a finite sample analysis of linear least squares estimators under sub-Gaussian martingale difference noise, offering tight probabilistic bounds and insights into sample size requirements for accurate estimation.
Contribution
It introduces a novel finite sample analysis method for least squares estimators with sub-Gaussian martingale noise using concentration bounds, which was previously unexplored.
Findings
Tight tail bounds on estimation error distribution.
Fast exponential convergence of sample size for desired accuracy.
Simulation confirms the tightness of theoretical bounds.
Abstract
Linear Least Squares is a very well known technique for parameter estimation, which is used even when sub-optimal, because of its very low computational requirements and the fact that exact knowledge of the noise statistics is not required. Surprisingly, bounding the probability of large errors with finitely many samples has been left open, especially when dealing with correlated noise with unknown covariance. In this paper we analyze the finite sample performance of the linear least squares estimator under sub-Gaussian martingale difference noise. In order to analyze this important question we used concentration of measure bounds. When applying these bounds we obtained tight bounds on the tail of the estimator's distribution. We show the fast exponential convergence of the number of samples required to ensure a given accuracy with high probability. We provide probability tail bounds on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
