Comparing Model-agnostic Feature Selection Methods through Relative Efficiency
Not on the map. Why?
Abstract (arXiv)
Feature selection and importance estimation in a model-agnostic setting is an ongoing challenge of significant interest. Wrapper methods are commonly used because they are typically model-agnostic. In this paper, we develop a general comparison framework for model-agnostic feature selection methods based on relative efficiency, using relative variability σ/μ to account for different statistics having different means. In particular we focus on state-of-the-art feature selection methods, the Generalized Covariance Measure (GCM) and Leave-One-Covariate-Out (LOCO) estimation. In particular, we present a theoretical comparison under three model settings: linear models, non-linear additive models, and single index models that mimic a single-layer neural network. We complement this with simulations and real data examples for the above models and mis-specified models. Our theoretical results, along with empirical findings, demonstrate that GCM-related methods generally out-perform LOCO under suitable regularity conditions defined by a suitably defined correlation quantity which quantifies the asymptotic relative efficiency of these approaches. Our simulations and real data analysis include widely used machine learning methods such as neural networks and gradient boosting trees.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 55 references that are in the map. First posted on arXiv 19 Aug 2025.
Builds on
9 of 55 references.
References · 9
- 2016Distribution-Free Predictive Inference For Regressioncited by 668
- 2018All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneouslycited by 373
- 2016Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selectioncited by 121
- 2014Controlling the false discovery rate via knockoffscited by 97
- 2020A general framework for inference on algorithm-agnostic variable importancecited by 45
- 2021Relating the Partial Dependence Plot and Permutation Feature Importance to the Data Generating Processcited by 24
- 2017Dropout Feature Ranking for Deep Learning Modelscited by 13
- 2022Lazy Estimation of Variable Importance for Large Neural Networkscited by 5
- 2024Reliable and scalable variable importance estimation via warm-start and early stoppingcited by 3
Built on by
Not cited yet.