Skip to content
aiqbench takeMachine Learning

aiqbench analysis

MinShap introduces a novel method for feature selection by using minimum aggregation of Shapley values, ensuring features remain relevant across all conditioning contexts rather than just on average. This approach directly addresses the redundancy issue inherent in standard attribution methods and offers scalable algorithms with statistical guarantees for model-agnostic interpretability. The work advances machine learning theory by unifying statistical feature selection with representation-based interpretability while improving stability over existing approaches.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

MinShap: A Shapley-Based Framework for Feature Redundancy

arXiv2 min read

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. In this paper, we introduce \textbf{MinShap}, a general framework for identifying \emph{important} or \emph{non-redundant} features through conditional importance functionals $VI_j^S$. Rather than averaging feature contributions across conditioning sets, MinShap aggregates them using the \emph{minimum}, thereby testing whether a feature remains relevant under every conditioning context. We show that, under a simple \emph{null monotonicity} condition, the minimum aggregation exactly characterizes feature redundancy and yields a principled feature selection criterion. This perspective provides a unified framework for statistical feature selection and representation-based interpretability while retaining the stability advantages of Shapley-style aggregation. We develop scalable algorithms with statistical guarantees, establish connections to multiple-testing procedures, and demonstrate through theory and experiments that MinShap produces more accurate and stable feature selection than existing model-agnostic approaches.

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. In this paper, we introduce \textbf{MinShap}, a general framework for identifying \emph{important} or \emph{non-redundant} features through conditional importance functionals $VI_j^S$. Rather than averaging feature contributions across conditioning sets, MinShap aggregates them using the \emph{minimum}, thereby testing whether a feature remains relevant under every conditioning context. We show that, under a simple \emph{null monotonicity} condition, the minimum aggregation exactly characterizes feature redundancy and yields a principled feature selection criterion. This perspective provides a unified framework for statistical feature selection and representation-based interpretability while retaining the stability advantages of Shapley-style aggregation. We develop scalable algorithms with statistical guarantees, establish connections to multiple-testing procedures, and demonstrate through theory and experiments that MinShap produces more accurate and stable feature selection than existing model-agnostic approaches.

Machine Learning (stat.ML); Machine Learning (cs.LG)

arXiv:2604.15107 [stat.ML]

(or arXiv:2604.15107v2 [stat.ML] for this version)

https://doi.org/10.48550/arXiv.2604.15107 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 253 words

Related coverage