An Efficient Post-Selection Inference on High-Order Interaction Models
S. Suzumura, K. Nakagawa, K. Tsuda, I. Takeuchi

TL;DR
This paper introduces an efficient post-selection inference method for high-order interaction models, leveraging tree structures to identify significant features with reduced computational effort.
Contribution
It proposes a novel pruning-based approach exploiting tree structures to perform PSI efficiently on high-dimensional high-order interaction models.
Findings
Successfully identifies significant interaction features
Reduces computational cost compared to existing methods
Maintains statistical reliability in high-dimensional settings
Abstract
Finding statistically significant high-order interaction features in predictive modeling is important but challenging task. The difficulty lies in the fact that, for a recent applications with high-dimensional covariates, the number of possible high-order interaction features would be extremely large. Identifying statistically significant features from such a huge pool of candidates would be highly challenging both in computational and statistical senses. To work with this problem, we consider a two stage algorithm where we first select a set of high-order interaction features by marginal screening, and then make statistical inferences on the regression model fitted only with the selected features. Such statistical inferences are called post-selection inference (PSI), and receiving an increasing attention in the literature. One of the seminal recent advancements in PSI literature is 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
TopicsStatistical Methods and Inference · Machine Learning and Data Classification · Gaussian Processes and Bayesian Inference
