REVIEW 4 major objections 6 minor 3 cited by
Local MDI+: Local Feature Importances for Tree-Based Models
T0 review · 4 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read Local MDI+ extends the MDI+ global-importance framework to individual predictions, claiming that its per-sample attributions find predictive features more faithfully and more stably than LIME, TreeSHAP, and Local MDI across twelve…
desk verdict Solid global feature-importance extension with a shaky instance-specific validation and an unbacked headline number. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The stump function maps each split into a three-valued basis element, and concatenating these over all splits gives the node basis. A known result, stated as Proposition 1 from MDI+, connects the mean decrease in impurity of feature k to the $R^{2}$ from regressing the response on the node-basis columns corresponding to splits on that feature, which explains MDI's biases. LMDI+ uses the same basis to turn the tree into a linear model: it appends raw features to the node basis, fits a regularized GLM on in-bag and out-of-bag samples, and reads off the per-observation attribution as the inner product of the transformed features with the fitted coefficients. The GLM shrinkage and out-of-bag evaluation are what correct the biases; the inner-product readout is what makes the importance local and stable.
What would settle it
On a synthetic dataset where each instance has a known, instance-specific set of signal features, compute LMDI+ and baseline rankings and compare them against the per-instance ground truth; if the remove-and-retrain ordering ever ranks a method that selects globally predictive features above one that selects the true local signal, the protocol is measuring global fidelity rather than local fidelity.
Extended reading notes
Core claim
The paper proposes to compute sample-specific feature importances by exploiting the known equivalence between a fitted decision tree and ordinary least squares on the basis of stump functions defined by its splits. For each tree in the ensemble, LMDI+ builds a transformed feature map that concatenates these stump functions with the raw covariates, evaluates it on both in-bag and out-of-bag samples, fits a regularized generalized linear model to the response on that map, and defines the local importance of feature k for observation x as the inner product of the transformed feature vector with the corresponding GLM coefficients; features that never split are assigned zero. Scores are averaged over trees and ranked by absolute value. The paper claims this inherits MDI+'s corrections for overfitting, correlation bias, and poor handling of smooth or additive structure while adding sample specificity, and presents experiments—synthetic DGPs, correlation robustness, twelve real-world datasets, stability, ablations, gradient boosting, counterfactuals, and a housing subgroup case study—that it says support the method's predictive-feature identification, stability, and practical utility.
Load-bearing premise
The real-data comparisons assume that the remove-and-retrain protocol—replacing all but a sample's top-ranked features with their average and retraining a random forest—actually measures how well a method identifies the features driving that sample's prediction, an assumption the paper does not independently validate.
Editorial extensions
If this is right
- If LMDI+ identifies predictive features as claimed, local explanations for tree ensembles can be obtained without the perturbations used by LIME or the subset averaging used by TreeSHAP, reducing a known source of instability.
- Using only the features LMDI+ ranks highest for each sample preserves more predictive performance after retraining than the same protocol with baseline methods, which matters when a practitioner must act on a short list of reasons.
- Stable per-sample rankings across random seeds mean repeated fits of the same model are less likely to contradict each other in high-stakes settings.
- The framework transfers to gradient-boosting ensembles, so the method is not tied to random forests.
- Counterfactuals selected in LMDI+ importance space require smaller feature changes, and clustering on LMDI+ scores yields subgroups on which simple models fit better.
Reading between the lines
- The linearized view suggests LMDI+ attributions are additive and therefore could be aggregated across samples or groups into global or subgroup-level importance statements, something the paper only hints at in its clustering use case.
- The remove-and-retrain protocol may reward methods that find globally predictive features rather than features that drive the particular instance; a synthetic study with known per-instance ground truth would separate these two notions.
- Because the GLM and link function are plug-in choices, the same construction could be tested with other regularized estimators for non-Gaussian responses or with interaction features appended to the node basis.
- The stability gain may come partly from GLM shrinkage and averaging over trees; an ablation that varies only shrinkage while holding the basis fixed would isolate how much stability is due to regularization.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes Local MDI+ (LMDI+), a sample-specific extension of the global MDI+ feature importance framework. The method augments the stump basis of a decision tree with the raw feature values, fits a regularized GLM on this transformed representation (using out-of-bag samples), and defines the local importance of feature k for an instance x as the inner product of the transformed vector with the fitted GLM coefficients. The authors claim that LMDI+ identifies instance-specific predictive features better than LIME, TreeSHAP, and Local MDI, yields an average 10% improvement in predictive performance on twelve real-world datasets, produces more stable rankings across repeated random-forest fits, generalizes to gradient boosting, and enables counterfactual and subgroup-discovery use cases. The paper includes synthetic experiments with known signal features, correlation-robustness experiments, real-data remove-and-retrain evaluations, stability experiments, ablations, runtime comparisons, and two application case studies.
Significance. If the central empirical claim is established, LMDI+ would be a practically useful structure-based local importance method that avoids perturbation-based artifacts and offers improved stability over LIME and TreeSHAP. The paper's strengths include a clear algorithmic recipe, extensive experiments across multiple datasets and ensemble settings, an ablation study that isolates the contribution of each component, and a companion repository with implementation code. However, the significance is conditional: the synthetic experiments support global signal-feature recovery, while the instance-specific claim rests on an unvalidated remove-and-retrain protocol. The abstract's headline 10% figure is not substantiated by any reported number in the body, and the attribution formula itself is heuristic. These gaps are fixable but currently leave the central claim partially unsupported.
major comments (4)
- [Section 4.1/4.2] The synthetic experiments do not actually test instance-specificity. In Section 4.1, a fixed subset of signal features is randomly selected once per simulation, and the same response function is applied to every sample; the AUROC is then computed for each test sample against the same global binary signal-feature label vector. Section 4.2 likewise fixes signal features X1,...,X6 for all samples. These experiments therefore measure how well a method recovers globally signal features, not whether the importance scores vary correctly with the features that drive each individual prediction. To support the 'instance-specific' wording in the abstract and Section 1, the authors need either synthetic DGPs in which the signal features vary per sample, or another evaluation that isolates per-instance variation against a known oracle.
- [Section 4.3, Setup] The remove-and-retrain protocol is load-bearing for the claim that LMDI+ identifies instance-specific predictive features, but it is not validated for that purpose. Replacing features outside a sample's top-k with their column mean and retraining an RF can reward methods that select globally predictive features, since those features will be retained for most rows and will dominate the retrained model; the protocol does not establish that the retained set varies meaningfully across instances or that it recovers the features driving each individual prediction. A concrete test would be to construct synthetic data with per-instance signal features and verify that the protocol's performance tracks per-instance ground truth, and to compare LMDI+ against a global-only ranking baseline (e.g., global MDI+ or mean marginal importance) to show that the local component adds information beyond global feature ranks.
- [Abstract] The abstract claims an 'average 10% improvement in predictive performance when using only the selected features,' but no quantitative 10% figure appears anywhere in the body. Table 1 reports average ranks, Figures 3/12/13 report R2/AUROC curves, and Appendix D reports full-dataset numbers without a 10% average. The authors should either add the exact computation supporting the 10% claim (for example, average relative improvement across datasets and feature-retention levels) or qualify/remove the quantitative claim from the abstract.
- [Section 3.3, Step 3] The LMDI+ attribution formula is introduced as an analogy to linear models, but no formal property is established for the resulting score. In a linear model, beta_k * x_k is the exact additive contribution to the prediction, but here the GLM is fitted on an augmented basis containing stump functions and the raw feature; the inner product of the transformed vector with the GLM coefficients is not shown to satisfy local accuracy, additivity, or any consistency property relative to the tree ensemble's prediction. This is load-bearing because the empirical claims are about the quality of these scores. The authors should provide a formal statement of what the score represents, or at minimum a sanity check on synthetic data with known per-instance local contributions.
minor comments (6)
- [Section 3.3] The notation in Step 3 is dense and ambiguous: it is not immediately clear whether a separate GLM is fit for each feature k on the augmented basis [Psi(S^(k)), x_k], or whether a single GLM is fit on the full concatenated basis and then restricted. Please clarify the dimension of beta^(k)_lambda and the fitting procedure.
- [Section 5] The 'unique feature ratio' measures overlap between top-k sets across five RF fits, but it does not directly measure rank-order stability. Reporting an additional rank-correlation metric (e.g., average pairwise Kendall tau across fits) would strengthen the stability claim.
- [Table 4] The counterfactual comparison reports mean L1 distances without standard errors or significance tests; the gaps between methods (e.g., 7.6 versus 9.5 on House 16H) may be within noise. Please add variability measures or statistical tests.
- [Section 8] The statement that LMDI+ performs '40% better than the Global model' is undefined; specify the relative MSE improvement and the baseline to which it is compared.
- [Section 6 / Appendix F] The ablation tables report only average ranks; providing the underlying metric values (or a plot of the full curves) for at least a few datasets would make the ablation results more transparent.
- [Section 10] There is a typo in the Future Work paragraph: 'also supports 0choices of generalized linear models' should read 'also supports choices of generalized linear models.'
Circularity Check
No significant circularity: LMDI+ is a newly defined local attribution, its cited Proposition 1 is a parameter-free mathematical equivalence, and the evaluations use external benchmarks and held-out performance. The flagged auditability and protocol-validity concerns are not circularity.
full rationale
The paper's derivation chain is self-contained. LMDI+ is defined in Section 3.3 as a linear attribution LMDI+_k(x, S^(k), G) := tilde(Psi)^(k)(x)^T beta_hat, where beta_hat comes from a regularized GLM fit on the transformed node basis; this is a definition, not a fitted quantity renamed as a prediction. The load-bearing Proposition 1 (Agarwal et al., 2023) is a mathematical equivalence between MDI and an R^2 from OLS on stump functions; its stated assumptions concern tree structure and bootstrapped data, not the LMDI+ scoring rule, so the self-citation is real evidence rather than a circular premise. Synthetic experiments in Sections 4.1-4.2 compare scores against known DGP signal features, and the real-data evaluation in Section 4.3 uses the external remove-and-retrain protocol of Hooker et al. (2019), with preserved test data and retraining, so results are not forced by construction. Stability and ablation experiments are likewise held-out or rank-based comparisons against LIME, TreeSHAP, and Local MDI. Two concerns should be weighed in the verdict but are not circularity: (1) the abstract's 'average 10% improvement' does not appear in any body table or figure, since Table 1 reports average ranks and Figures 3/12/13 report R^2/AUROC curves, making the headline quantitative claim unauditable; and (2) the Section 4.3 protocol assumes that replacing non-top-k features with their column mean and retraining measures instance-specific predictivity, but it may reward globally predictive features, so the instance-specific interpretation rests on an unvalidated measurement assumption. Neither concern involves a quantity defined in terms of the target claim, so the circularity score remains 0.
Assumptions & free parameters
free parameters (2)
- ElasticNet penalty and l1_ratio (LMDI+ GLM) =
Selected by ElasticNetCV/LogisticRegressionCV with l1_ratios in {0.1, 0.5, 0.99} and cv=3
- Random forest hyperparameters =
n_estimators=100, min_samples_leaf=5 (regression) or 1 (classification), max_features=0.33 (regression) or sqrt…
assumptions (4)
- domain assumption Proposition 1 (Agarwal et al. 2023): MDIk is proportional to R^2 of OLS on the stump basis restricted to splits on feature k.
- standard math Klusowski and Tian (2023): decision tree predictions are equivalent to OLS predictions on the stump (node) basis.
- ad hoc to paper For each feature k, the inner product of the transformed vector Psi_tilde^(k)(x) with the fitted GLM coefficients beta^(k)_lambda gives the local contribution of feature k to the prediction.
- domain assumption The remove-and-retrain evaluation with per-sample feature masking and mean imputation measures local predictive importance.
Cite this review
Pith. "Pith review of Local MDI+: Local Feature Importances for Tree-Based Models." pith.science (2026). https://pith.science/paper/ESPCNDNX
@misc{pith2026250608928,
author = {Pith},
title = {Pith review of: Local MDI+: Local Feature Importances for Tree-Based Models},
year = {2026},
howpublished = {\url{https://pith.science/paper/ESPCNDNX}},
note = {Machine review of arXiv:2506.08928}
}
read the original abstract
Tree-based ensembles such as random forests remain the go-to for tabular data over deep learning models due to their prediction performance and computational efficiency. These advantages have led to their widespread deployment in high-stakes domains, where interpretability is essential for ensuring trustworthy predictions. This has motivated the development of popular local feature importance methods such as LIME and TreeSHAP. However, these approaches rely on approximations that ignore the model's internal structure and instead depend on potentially unstable perturbations. These issues are addressed in the global setting by MDI+, a global feature importance method which combines tree-based and linear feature importances by exploiting an equivalence between decision trees and least squares on a transformed node basis. However, the global MDI+ scores are not able to explain predictions when faced with heterogeneous individual characteristics. To address this gap, we propose Local MDI+ (LMDI+), a novel extension of the MDI+ framework that quantifies feature importances for each particular sample. Across twelve real-world benchmark datasets, LMDI+ outperforms existing baselines at identifying instance-specific predictive features, yielding an average 10% improvement in predictive performance when using only the selected features. It further demonstrates greater stability by consistently producing similar instance-level feature importance rankings across repeated model fits with different random seeds. Ablation experiments show that each component of LMDI+ contributes to these gains, and that the improvements extend beyond random forests to gradient boosting models. Finally, we show that LMDI+ enables local interpretability use cases by identifying closely matched counterfactuals for each classification benchmark and discovering homogeneous subgroups in a housing dataset case study.
Figures
Figures from the paper (15 more)
Forward citations
Cited by 3 Pith papers
-
Kernel of Partition Paths: A Unified Representation for Tree Ensembles
KPP is a new representation for tree ensembles that indexes features by nodes with a path metric, yielding a non-diagonal Gram matrix that unifies prediction, exact additive attribution, deterministic Lipschitz robust...
-
OC-Distill: Ontology-aware Contrastive Learning with Cross-Modal Distillation for ICU Risk Prediction
Ontology-aware contrastive pretraining plus note-to-vitals distillation improves MIMIC ICU risk and length-of-stay prediction using only vital signs at inference.
-
Provable Recovery of Locally Important Signed Features and Interactions from Random Forest
Under a Locally Spike Sparse model and idealized Random Forest assumptions, LocalLSSFind provably recovers the signed features and interactions driving a single test prediction.
Reference graph
Works this paper leans on
-
[1]
MDI regresses only on in-bag samplesΨ(X∗;S)
Obtain enhanced representation.Each tree in an RF is fit on a bootstrapped datasetD∗ = (X∗,y∗). MDI regresses only on in-bag samplesΨ(X∗;S). MDI+ instead appends the raw featurexk∈R n to the feature map consisting of both in-bag and out-of-bag samples, yielding the transformed representation ˜Ψ(k) (X) = ˜Ψ ( X;S (k)) = [Ψ ( X;S (k)) ,xk]
-
[2]
Fit regularized GLM.Instead of using OLS, fit a regularized GLMG with link functiong and penalty λby regressing responseyon the transformed data ˜Ψ(X) = ˜Ψ(X;S)
-
[3]
Make partial model predictions.Let ¯˜Ψ(j) denote the vector of average values for features in˜Ψ(j)(X). Fork= 1,...,p, we then define the partial model predictions for each samplexi to be ˆy(k) i =g−1 ([¯˜Ψ(1),..., ¯˜Ψ(k−1), ˜Ψ(k)(xi), ¯˜Ψ(k+1),..., ¯˜Ψ(p) ] ˆβ−i,λ +αλ ) ,(5) where ˆβ−i,λ is the LOO coefficient vector learned without samplexi. 4.Evaluate p...
work page 2013
-
[1995]
Springer Berlin Heidelberg. ISBN 978-3-540-49195-8. Leo Breiman. Random forests.Machine Learning, 45(1):5–32, 2001. Yury Gorishniy, Ivan Rubachev, Valentin Khrulkov, and Artem Babenko. Revisiting deep learning models for tabular data.Advances in neural information processing systems, 34:18932–18943, 2021. Ravid Shwartz-Ziv and Amitai Armon. Tabular data: ...
arXiv 2001
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.