Unbiased estimators for random design regression
Not on the map. Why?
Abstract (arXiv)
In linear regression we wish to estimate the optimum linear least squares predictor for a distribution over d-dimensional input points and real-valued responses, based on a small sample. Under standard random design analysis, where the sample is drawn i.i.d. from the input distribution, the least squares solution for that sample can be viewed as the natural estimator of the optimum. Unfortunately, this estimator almost always incurs an undesirable bias coming from the randomness of the input points, which is a significant bottleneck in model averaging. In this paper we show that it is possible to draw a non-i.i.d. sample of input points such that, regardless of the response model, the least squares solution is an unbiased estimator of the optimum. Moreover, this sample can be produced efficiently by augmenting a previously drawn i.i.d. sample with an additional set of d points, drawn jointly according to a certain determinantal point process constructed from the input distribution rescaled by the squared volume spanned by the points. Motivated by this, we develop a theoretical framework for studying volume-rescaled sampling, and in the process prove a number of new matrix expectation identities. We use them to show that for any input distribution and ε>0 there is a random design consisting of O(dlog d+ d/ε) points from which an unbiased estimator can be constructed whose expected square loss over the entire distribution is bounded by 1+ε times the loss of the optimum. We provide efficient algorithms for generating such unbiased estimators in a number of practical settings and support our claims experimentally.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 2; 2025: 0; 2026: 1.
6 papers.
- 2021Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergencecited by 24
- 2024Sketchy Moment Matching: Toward Fast and Provable Data Selection for Finetuningcited by 5
- 2022Algorithmic Gaussianization through Sketching: Converting Data into Sub-gaussian Random Designscited by 4
- 2023Weighted least-squares approximation with determinantal point processes and generalized volume samplingcited by 2
- 2024A Family of Distributions of Random Subsets for Controlling Positive and Negative Dependencecited by 1
- 2026Random tilts to find stationary points in stochastic convex optimizationcited by 0
- 2026Random tilts to find stationary points in stochastic convex optimization15 Sep 2026
- 2024A Family of Distributions of Random Subsets for Controlling Positive and Negative Dependence2 Aug 2024
- 2024Sketchy Moment Matching: Toward Fast and Provable Data Selection for Finetuning8 Jul 2024
- 2023Weighted least-squares approximation with determinantal point processes and generalized volume sampling21 Dec 2023
- 2022Algorithmic Gaussianization through Sketching: Converting Data into Sub-gaussian Random Designs21 Jun 2022
- 2021Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergence3 Feb 2021