Variance function estimation in regression model via aggregation procedures
Not on the map. Why?
Abstract (arXiv)
In the regression problem, we consider the problem of estimating the variance function by the means of aggregation methods. We focus on two particular aggregation setting: Model Selection aggregation (MS) and Convex aggregation (C) where the goal is to select the best candidate and to build the best convex combination of candidates respectively among a collection of candidates. In both cases, the construction of the estimator relies on a two-step procedure and requires two independent samples. The first step exploits the first sample to build the candidate estimators for the variance function by the residual-based method and then the second dataset is used to perform the aggregation step. We show the consistency of the proposed method with respect to the L 2error both for MS and C aggregations. We evaluate the performance of these two methods in the heteroscedastic model and illustrate their interest in the regression problem with reject option.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 63 references that are in the map. First posted on arXiv 6 Oct 2021.
Builds on
4 of 63 references.
References · 4
- 2014Consistency of random forestscited by 85
- 2020Regression with reject option and application to kNNcited by 30
- 2016Adaptive estimation of High-Dimensional Signal-to-Noise Ratioscited by 5
- 2013Learning Heteroscedastic Models by Convex Programming under Group Sparsitycited by 3
Built on by
Not cited yet.