arXiv Machine Learning

Interpretability-by-Design with Accurate Locally Additive Models and Conditional Feature Effects

The paper introduces Conditionally Additive Local Models (CALMs), a new class of interpretable machine learning models that balance the simplicity of Generalized Additive Models (GAMs) with the accuracy of GA$^2$Ms. CALMs allow multiple univariate shape functions per feature, each active in distinct input subregions defined by simple logical conditions on interacting features, thereby capturing interactions while maintaining local additivity. A distillation-based training pipeline identifies homogeneous regions with limited interactions and fits interpretable shape functions via region-aware backfitting, leading to performance that consistently outperforms GAMs and rivals GA$^2$Ms on diverse classification and regression tasks.

arXiv AI
1d ago

BAM: Bivariate Additive Models for Interpretable Tabular Prediction

Bivariate Additive Models (BAMs) are a new class of Generalized Additive Models with pairwise interactions that constrain each shape function to a simple asymmetric bivariate Gaussian form, producing unimodal contour maps that are easier to interpret. The model automatically selects feature pairs during training and achieves predictive accuracy comparable to standard GAMs while approaching the performance of more complex GA$^2$Ms on six tabular benchmarks. Experiments also illustrate the trade‑off between accuracy and the number of components that need to be inspected.

By Atsushi Koike
arXiv Statistics ML
Aug 25

Interpretable AI with Local Distillation

Interpretable AI with Local Distillation proposes a method where a black‑box teacher model guides a regularized linear student model at each query point. The teacher defines locality by upweighting training observations with similar predicted outcomes and anchors the fit with its own prediction at the query point, treated as a pseudo‑observation. By adding Gaussian randomization and refitting, the approach identifies reliable features and stable subgroups, achieving near‑teacher accuracy while producing sparse, locally interpretable linear models.

By Erin Craig, Yiling Huang, Snigdha Panigrahi
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
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 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.

Hugging Face Trending Papers
Jul 22

The Quadrilateral Loss: Additivity as a Measurable Behavior of Dense Neural Networks

Additive models buy interpretability by forbidding feature interactions, a constraint that neural instantiations enforce architecturally. We introduce the quadrilateral loss, a differentiable penalty that treats additivity as a measurable behavior instead: a second-order mixed difference on pairs of training points swapping one coordinate, which vanishes if and only if the coordinate carries no interaction, remains informative for piecewise-linear networks, and equals in expectation the per-coordinate interaction mass of the interventional Shapley-GAM.