Computationally Efficient Feature Significance and Importance for Machine Learning Models
arXiv:1905.09849
Abstract
We develop a simple and computationally efficient significance test for the features of a machine learning model. Our forward-selection approach applies to any model specification, learning task and variable type. The test is non-asymptotic, straightforward to implement, and does not require model refitting. It identifies the statistically significant features as well as feature interactions of any order in a hierarchical manner, and generates a model-free notion of feature importance. Experimental and empirical results illustrate its performance.
References in corpus (8)
- Axiomatic Attribution for Deep Networks
- Learning Important Features Through Propagating Activation Differences
- Understanding deep learning requires rethinking generalization
- How to Explain Individual Classification Decisions
- Sanity Checks for Saliency Maps
- Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernel
- Interpreting Black Box Models via Hypothesis Testing
- Sensitivity based Neural Networks Explanations