Post-reduction inference for confidence sets of models
Heather Battey, Daniel Garcia Rasines, Yanbo Tang

TL;DR
This paper develops a Fisherian inference framework for confidence sets of models in high-dimensional regression, avoiding data reuse issues and providing insights into sample-splitting versus traditional methods.
Contribution
It introduces a novel inference approach based on sufficiency and ancillary separations that handles model reduction without data conflict, applicable to various regression models.
Findings
The approach avoids data reuse issues in model confidence set construction.
Illustrates the impact of nuisance parameter estimation on information extraction.
Provides a tractable distribution theory for a modified cross-validation estimator.
Abstract
Sparsity in a regression context makes the model itself an object of interest, pointing to a confidence set of models as the appropriate presentation of evidence. A difficulty in areas such as genomics, where the number of candidate variables is vast, arises from the need for preliminary reduction prior to the assessment of models. The present paper considers a resolution using inferential separations fundamental to the Fisherian approach to conditional inference, namely, the sufficiency/co-sufficiency separation, and the ancillary/co-ancillary separation. The advantage of these separations is that no direction for departure from any hypothesised model is needed, avoiding issues that would otherwise arise from using the same data for reduction and for model assessment. In idealised cases with no nuisance parameters, the separations extract all the information in the data solely for the…
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.
Taxonomy
TopicsFault Detection and Control Systems · Machine Learning and Algorithms
