Selective Inference for Sparse High-Order Interaction Models
Finding statistically significant high-order interactions in predictive modeling is important but challenging task because the possible number of high-order interactions is extremely large (e.g., $> 10^{17}$). In this paper we study feature selection and statistical inference for sparse high-order interaction models. Our main contribution is to extend recently developed selective inference framework for linear models to high-order interaction models by developing a novel algorithm for efficiently characterizing the selection event for the selective inference of high-order interactions. We demonstrate the effectiveness of the proposed algorithm by applying it to an HIV drug response prediction problem.
Code (0)
등록된 구현이 없습니다.
Tasks
Drug Response Predictionfeature selectionVocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
Fast and More Powerful Selective Inference for Sparse High-order Interaction Model
Automated high-stake decision-making such as medical diagnosis requires models with high interpretability and reliability. As one of the interpretable and reliable models with good prediction ability, we consider Sparse …
Computational EfficiencyDecision MakingMedical DiagnosisSelection bias+1ARM-Net: Adaptive Relation Modeling Network for Structured Data
Relational databases are the de facto standard for storing and querying structured data, and extracting insights from structured data requires advanced analytics. Deep neural networks (DNNs) have achieved super-human pre…
AttributeDecision MakingRelationNonparametric Embeddings of Sparse High-Order Interaction Events
High-order interaction events are common in real-world applications. Learning embeddings that encode the complex relationships of the participants from these events is of great importance in knowledge mining and predicti…
Vocal Bursts Intensity PredictionSparsePixels: Efficient Convolution for Sparse Data on FPGAs
Inference of standard convolutional neural networks (CNNs) on FPGAs often incurs high latency and a long initiation interval due to the deep nested loops required to densely convolve every input pixel regardless of its f…
Where We Have Arrived in Proving the Emergence of Sparse Symbolic Concepts in AI Models
This study aims to prove the emergence of symbolic concepts (or more precisely, sparse primitive inference patterns) in well-trained deep neural networks (DNNs). Specifically, we prove the following three conditions for …