arXiv Machine Learning
Oct 28

Beyond feature attribution: Recovering latent interaction structures in machine learning models via localized CBFI

The paper introduces localized case-based feature importance (CBFI), a framework that decomposes individual predictions in complex tabular models into distinct structural components, separating independent main effects from pure interactions. Unlike additive explanations such as SHAP and LIME, CBFI explicitly captures feature synergies, enabling the recovery of latent interaction structures. Experiments on wine quality classification and medical insurance regression, along with fidelity tests and synthetic benchmarks, show that CBFI accurately disentangles interactions hidden by additive models and aligns with the nonlinear dependencies in gradient boosting and deep neural networks.

By Sejong Oh
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
arXiv Machine Learning
Sep 18

Evaluating Explanation Methods by the Predictors They Induce

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.

By Jacob Selb{\ae}k, Hugo L. Hammer
Hugging Face Trending Papers
Sep 17

Evaluating Explanation Methods by the Predictors They Induce

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 Machine Learning
Aug 31

Actionable CBFI: Integrating Structural Decomposition and Causal Counterfactual Recourse for Tabular Machine Learning

The paper introduces Actionable Case-Based Feature Importance (A‑CBFI), a framework that integrates structural causal models with counterfactual recourse for tabular machine learning. A‑CBFI isolates synergistic interaction bottlenecks and releases suppressive structural locks, concentrating over 98.3% of intervention effort on diagnosed root causes. Empirical tests in finance and healthcare show a 76.9% reduction in active human intervention while keeping recourse costs comparable to exhaustive causal methods.

By Sejong Oh