Statistical inference in sparse high-dimensional additive models
Karl Gregory, Enno Mammen, Martin Wahl

TL;DR
This paper develops a new estimation method for a component in high-dimensional sparse additive models, showing that under certain conditions, it performs nearly as well as an ideal oracle estimator, with theoretical guarantees and practical validation.
Contribution
It introduces a two-step presmoothing-and-resmoothing estimator for sparse additive models, establishing asymptotic equivalence to oracle estimators under strong sparsity assumptions.
Findings
Estimator achieves near-oracle performance in simulations
Finite-sample bounds demonstrate estimator's accuracy
Asymptotic analysis shows no loss of information under sparsity
Abstract
In this paper we discuss the estimation of a nonparametric component of a nonparametric additive model . We allow the number of additive components to grow to infinity and we make sparsity assumptions about the number of nonzero additive components. We compare this estimation problem with that of estimating in the oracle model , for which the additive components are known. We construct a two-step presmoothing-and-resmoothing estimator of and state finite-sample bounds for the difference between our estimator and some smoothing estimators in the oracle model. In an asymptotic setting these bounds can be used to show asymptotic equivalence of our estimator and the oracle estimators; the paper thus shows that, asymptotically, under strong enough sparsity…
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.
