.png){kind=icon}
.png){kind=icon}
Return
BOOTSTRAP TUNING IN GAUSSIAN ORDERED MODEL SELECTION
.png){kind=icon}
OA
AI
DOI：10.1214/18-AOS1717.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The paper focuses on the problem of model selection in linear Gaussian regression with unknown possibly inhomogeneous noise. For a given family of linear estimators {(theta) over tilde (m), m is an element of M}, ordered by their variance, we offer a new smallest accepted approach motivated by Lepski's device and the multiple testing idea. The procedure selects the smallest model which satisfies the acceptance rule based on comparison with all larger models. The method is completely data-driven and does not use any prior information about the variance structure of the noise: its parameters are adjusted to the underlying possibly heterogeneous noise by the so-called propagation condition using a wild bootstrap method. The validity of the bootstrap calibration is proved for finite samples with an explicit error bound. We provide a comprehensive theoretical study of the method, describe in details the set of possible values of the selected model (m) over cap is an element of M and establish some oracle error bounds for the corresponding estimator (theta) over cap = (theta) over tilde ((m) over cap).
Keywords:
Smallest accepted
oracle
propagation condition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.