arXiv:2604. 15107v2 Announce Type: replace-cross Abstract: Shapley values provide a flexible framework for attributing feature contributions to model predictions, but they are not naturally suited for feature selection: a feature may receive a positive attribution even when it is redundant given the remaining variables.
The paper proposes a new evaluation test for explanation methods: if an explanation accurately captures how a model uses its features, one should be able to reconstruct the model’s predictions from it. The authors convert explanations into predictors by summing feature effects and assess how well these predictors reproduce the model on unseen data, without any fitting. They apply this test to partial dependence plots, accumulated local effects, SHAP, and LIME across multiple datasets and model families, showing that the best method depends on feature dependence and that some existing quality metrics can favor flawed explanations.
The paper introduces a unified framework called null importance to clarify different notions of feature relevance in interpretable machine learning. It defines null importance at the population level for various relevance concepts—marginal, conditional, predictive risk, functional invariance, and causal effects—and demonstrates how each answers distinct scientific questions. Through theoretical analysis, simulations, and case studies on fairness and genomic modeling, the authors show when these null notions coincide or diverge and how different importance methods target them.
arXiv:2606. 00563v1 Announce Type: cross Abstract: Selection bias is a common and often unavoidable aspect of real-world data that challenges the generalizability of machine learning models.
arXiv:2511.15371v3 Announce Type: replace Abstract: Assessing the importance of individual features in Machine Learning is critical to understand the model's decision-making process. While numerous m...
The paper introduces a straightforward evaluation method for explanation techniques: by converting each explanation into a predictor that sums the feature effects, the authors assess how accurately this predictor reproduces the original model’s predictions on unseen data. This approach applies to any explanation expressible as a function of features and is demonstrated on PDP, ALE, SHAP, and LIME. The authors theoretically show that summing partial dependence curves yields the optimal additive summary when features are independent, but this property fails with dependent features, and empirical results across diverse datasets confirm that the best-performing method depends on feature dependence.
arXiv:2609.36396v1 Announce Type: cross Abstract: As black-box machine learning models become increasingly common, extracting interpretations with uncertainty quantification has become a critical cha...
arXiv:2606. 31686v1 Announce Type: cross Abstract: Feature rankings are widely used in supervised feature selection because they are simple, scalable and easy to interpret.
arXiv:2607. 05806v1 Announce Type: new Abstract: Training data for machine learning is routinely collected by a selection process the model never sees: loans are observed only when granted, outcomes only when a test was ordered.
arXiv:2511. 20851v3 Announce Type: replace-cross Abstract: Feature selection remains difficult in modern high-dimensional settings, and established methods such as Boruta and Recursive Feature Elimination are either computationally costly or lack a statistically justified stopping criterion for their importance scores.
The paper introduces a PAC‑Bayesian, algorithm‑agnostic framework to quantify the value of privileged information (PI) in Learning Using Privileged Information (LUPI). By comparing the tightest achievable risk bounds with and without PI, the authors derive a training‑time metric that estimates the maximum potential gain from PI without requiring test data. Experiments in supervised and unsupervised settings show a strong correspondence between this metric and actual test‑time performance improvements.
arXiv:2601. 09071v2 Announce Type: replace Abstract: The existence of multiple, equally accurate models for a given predictive task leads to predictive multiplicity, where a Rashomon set of models achieve similar accuracy but diverge in their individual predictions.