Spectral Deconfounding for High-Dimensional Sparse Additive Models
Not on the map. Why?
Abstract (arXiv)
Many high-dimensional data sets suffer from hidden confounding which affects both the predictors and the response of interest. In such situations, standard regression methods or algorithms lead to biased estimates. This paper substantially extends previous work on spectral deconfounding for high-dimensional linear models to the nonlinear setting and with this, establishes a proof of concept that spectral deconfounding is valid for general nonlinear models. Concretely, we propose an algorithm to estimate high-dimensional sparse additive models in the presence of hidden dense confounding: arguably, this is a simple yet practically useful nonlinear scope. We prove consistency and convergence rates for our method and evaluate it on synthetic data and a genetic data set.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Dec 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.
- 2024DecoR: Deconfounding Time Series with Robust Regressioncited by 2
- 2025Generalized Factor Neural Network Model for High-dimensional Regressioncited by 0
- 2026Spectrally Deconfounded Gradient Boostingcited by 0
- 2026Spectrally Deconfounded Gradient Boosting10 Jul 2026
- 2025Generalized Factor Neural Network Model for High-dimensional Regression16 Feb 2025
- 2024DecoR: Deconfounding Time Series with Robust Regression11 Jun 2024