Skip to content

Leaf Values as Coordinates: Exact Contrastive Explanation for Gradient-Boosted Ensembles

Aug 2026 · 0 citations · 24 references
Computer Science

TL;DR

A recourse method is built on a gradient-boosted ensemble that retains 58% of its validity where the strongest baseline retains 41%, a distinction the standard evaluation cannot see because it never asks whether a recommendation can be carried out.

Abstract

A gradient-boosted ensemble predicts by summing one leaf value per tree. Read those values as coordinates rather than as intermediate results, and every instance becomes a point in R^M on which the model acts linearly: the score is the sum of the coordinates. This small change of view makes contrastive explanation exact. The difference between two instances is a vector that is identically zero wherever they share a leaf, so the gap between a rejected applicant and an accepted one is carried by a handful of coordinates, each traceable to a real split in a real tree. Nothing is fitted, sampled, or assumed additive in features -- the additivity is already there, in the right space. We build a recourse method on this representation and evaluate it on five tabular datasets under repeated cross-validation. Its recommendation reconstructs the model's own decision to 6.2 x 10^-15, so an auditor can re-check the arithmetic without the model. On the credit datasets it is Pareto-non-dominated on effort against realism. And when recommendations are restricted to changes the subject could actually make -- not their age, not a settled delinquency -- it retains 58% of its validity where the strongest baseline retains 41%, a distinction the standard evaluation cannot see because it never asks whether a recommendation can be carried out.

View source

Similar papers

#machine learning Preprint Aug 2026

Interpretable AI with Local Distillation

Local distillation is proposed, in which a black-box teacher guides a regularized linear"student" model at each query point, and it is proved that this randomization yields feature-selection probabilities that are stable under small perturbations of the training responses.

Erin Craig, Yiling Huang, Snigdha Panigrahi · 0 citations
Preprint Jul 2026

Gauge-Fixing the Forward-Forward Objective: A Whitened Goodness Derived from a Likelihood-Ratio Account

The Forward-Forward algorithm trains each layer locally, so that a scalar goodness - the sum of squared activations - is high on real inputs and low on contrastive ones. Under an explicit generative model this goodness is the sufficient statistic of a likelihood-ratio test, and the pairwise form of the objective admits...

Paolo Giannitrapani · 0 citations
#software testing Preprint Aug 2026

Why and When Neural Networks Improve Local Approximation in Optimization

It is shown that the contradiction in experience with neural surrogates in derivative-free optimisation dissolves once three factors are stated, and that these, rather than the fit accuracy a training curve reports, are what delimit when a learned local model pays.

Cheng Bian, Peng-Cheng Xie · 0 citations

MultiPruneEnsemble: Integrating Multi-Base Decision Tree Prunings via Gradient-Based Weighting

A new framework, MultiPruneEnsemble, is proposed, which integrates the diversity of pruning with the flexibility of gradient-based optimization, and indicates that integrating multiple decision tree pruning by gradient-based weighting is a feasible way to improve the accuracy and robustness of learning.

Hanyang Yin · 0 citations
Preprint Jul 2026

EM-based iterations for multiple instance learning on a query-value model

A softmax model is studied that decouples the concept point and the labeling scheme in multiple instance regression data and derives a parametric family of iterations in the noiseless limit, which generalizes a method known as the EM-DD algorithm.

Ethan Levien · 0 citations
Jul 2026

TreeCCA: Canonical Correlation Analysis via Gradient-Boosted Trees

TreeCCA is the first CCA method to combine nonlinear accuracy with native interpretability: every tree split selects one feature, so gain importances reveal which inputs drive cross-view correlation at no extra cost.

James Chapman · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.