arXiv AI

One Permutation Is All You Need: Fast, Deterministic Feature Importance and Model Stress-Testing

arXiv:2512. 13892v3 Announce Type: replace-cross Abstract: Reliable estimation of feature contributions in machine learning models is essential for transparency, algorithmic fairness, and regulatory compliance.

arXiv AI
Oct 2

MCIR: A Feature Dependence-Aware Explainability Method with Reliability Guarantees

The paper introduces MCIR-M, a global feature‑importance method that accounts for feature dependence by conditioning each feature on its strongly dependent neighbours and computing a normalized Mutual Correlation Impact Ratio. MCIR-M yields a population score between 0 and 1, reaching zero when a feature is exactly conditionally redundant, and can be estimated with only a fraction of the data. Experiments on synthetic redundancy setups and the UCI HAR benchmark show that MCIR-M produces more stable rankings under near‑duplicate predictors compared to existing methods such as SHAP, SAGE, HSIC, and MI‑based scores.

By Poushali Sengupta, Sabita Maharjan, Frank Eliassen, Shashi Raj Pandey, Yan Zhang
arXiv Machine Learning
Jul 21

MinShap: A Shapley-Based Framework for Feature Redundancy

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.

By Chenghui Zheng, Garvesh Raskutti
arXiv Machine Learning
Jul 7

Distribution-free Deviation Bounds and The Role of Domain Knowledge in Learning via Model Selection with Cross-validation Risk Estimation

arXiv:2303. 08777v3 Announce Type: replace-cross Abstract: Cross-validation is one of the most widely used tools for risk estimation and model selection in statistics and machine learning, yet its theoretical properties when embedded in a learning procedure remain insufficiently understood.

By Diego Marcondes, Cl\'audia Peixoto
arXiv AI
Sep 16

A unified framework for global and local interpretability using adaptive derivative-ordered random explanation

The paper introduces Adaptive Derivative-Ordered Random Explanation (ADORE), a unified framework that uses first- and second-order derivatives to capture nonlinear feature interactions and feature-sample dynamics. ADORE combines global feature importance with local sample contributions, quantifying both magnitude and direction of feature impact while identifying critical samples. It achieves computational efficiency via randomized SVD and dynamic sparsity detection, outperforming LIME and SHAP across tabular, text, and image data, and is released as an open-source Python package on GitHub.

By Lemen Chao, Ming Lei, Anran Fanga