Model-Agnostic Confidence Intervals for Feature Importance: A Fast and Powerful Approach Using Minipatch Ensembles
Luqin Gan, Lili Zheng, Genevera I. Allen
TL;DR
This work develops LOCO-MP, a model-agnostic, distribution-free framework for inferring feature importance by leveraging minipatch ensembles to perform leave-one-covariate-out evaluations without data splitting or refitting on the full dataset. It establishes asymptotic coverage for the feature-importance score Delta_j under mild assumptions, and introduces a variance-barrier safeguard to handle vanishing-variance scenarios, while also enabling distribution-free predictive inference via Jackknife+-minipatch conformal methods. The approach demonstrates favorable statistical power, computational efficiency, and robust performance in simulations and real benchmark data, including correlated-feature settings where traditional occlusion methods struggle. Together, the method provides fast, reliable uncertainty quantification for both predictions and feature importance across tabular regression and classification tasks, with broad applicability to complex scientific datasets.
Abstract
To promote new scientific discoveries from complex data sets, feature importance inference has been a long-standing statistical problem. Instead of testing for parameters that are only interpretable for specific models, there has been increasing interest in model-agnostic methods, often in the form of feature occlusion or leave-one-covariate-out (LOCO) inference. Existing approaches often make distributional assumptions, which can be difficult to verify in practice, or require model refitting and data splitting, which are computationally intensive and lead to losses in power. In this work, we develop a novel, mostly model-agnostic and distribution-free inference framework for feature importance that is computationally efficient and statistically powerful. Our approach is fast as we avoid model refitting by leveraging a form of random observation and feature subsampling called minipatch ensembles; this approach also improves statistical power by avoiding data splitting. Our framework can be applied on tabular data and with any machine learning algorithm, together with minipatch ensembles, for regression and classification tasks. Despite the dependencies induced by using minipatch ensembles, we show that our approach provides asymptotic coverage for the feature importance score of any model under mild assumptions. Finally, our same procedure can also be leveraged to provide valid confidence intervals for predictions, hence providing fast, simultaneous quantification of the uncertainty of both predictions and feature importance. We validate our intervals on a series of synthetic and real data examples, including non-linear settings, showing that our approach detects the correct important features and exhibits many computational and statistical advantages over existing methods.
