Efficient Truncated Linear Regression with Unknown Noise Variance
Not on the map. Why?
Abstract (arXiv)
Truncated linear regression is a classical challenge in Statistics, wherein a label, y = wT x + varepsilon, and its corresponding feature vector, x ∈ ℝk, are only observed if the label falls in some subset S subseteq ℝ; otherwise the existence of the pair (x, y) is hidden from observation. Linear regression with truncated observations has remained a challenge, in its general form, since the early works of~citettobin1958estimation,amemiya1973regression. When the distribution of the error is normal with known variance, recent work of~citetdaskalakis2019truncatedregression provides computationally and statistically efficient estimators of the linear model, w. In this paper, we provide the first computationally and statistically efficient estimators for truncated linear regression when the noise variance is unknown, estimating both the linear model and the variance of the noise. Our estimator is based on an efficient implementation of Projected Stochastic Gradient Descent on the negative log-likelihood of the truncated sample. Importantly, we show that the error of our estimates is asymptotically normal, and we use this to provide explicit confidence regions for our estimates.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 7 of its 30 references that are in the map. First posted on arXiv 25 Aug 2022.
Builds on
7 of 30 references.
References · 7
- 2015An Introduction to Matrix Concentration Inequalitiescited by 397
- 2018Efficient Statistics, in High Dimensions, from Truncated Samplescited by 28
- 2020Computationally and Statistically Efficient Truncated Regressioncited by 24
- 2019Efficient Truncated Statistics with Unknown Truncationcited by 22
- 2020Efficient Parameter Estimation of Truncated Boolean Product Distributionscited by 13
- 2021Learning from Censored and Dependent Data: The case of Linear Dynamicscited by 9
- 2021Learning to Sample from Censored Markov Random Fieldscited by 6
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 4; 2026: 2.
10 papers.
- 2023Domain constraints improve risk prediction when outcome data is missingcited by 8
- 2024Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussianscited by 7
- 2024Statistical Query Lower Bounds for Learning Truncated Gaussianscited by 6
- 2024Transfer Learning Beyond Bounded Density Ratioscited by 6
- 2025Smoothed Analysis of Learning from Positive Samplescited by 3
- 2025Learning High-dimensional Gaussians from Censored Datacited by 2
- 2025Private Statistical Estimation via Truncationcited by 1
- 2025Linear Regression under Missing or Corrupted Coordinatescited by 1
- 2026High-Dimensional Gaussian Mean Estimation under Realizable Contaminationcited by 1
- 2026Efficient Learning of Truncated Boolean Product Distributions: Influence to the Rescuecited by 0
- 2026Efficient Learning of Truncated Boolean Product Distributions: Influence to the Rescue24 Jul 2026
- 2026High-Dimensional Gaussian Mean Estimation under Realizable Contamination17 Mar 2026
- 2025Linear Regression under Missing or Corrupted Coordinates23 Sep 2025
- 2025Private Statistical Estimation via Truncation18 May 2025
- 2025Learning High-dimensional Gaussians from Censored Data28 Apr 2025
- 2025Smoothed Analysis of Learning from Positive Samples14 Apr 2025
- 2024Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians2 Oct 2024
- 2024Transfer Learning Beyond Bounded Density Ratios18 Mar 2024
- 2024Statistical Query Lower Bounds for Learning Truncated Gaussians4 Mar 2024
- 2023Domain constraints improve risk prediction when outcome data is missing6 Dec 2023