b3gbi vs e2tree

e2tree builds a single interpretable tree that approximates a fitted ensemble, working from the proximity structure the ensemble induces between observations. The 1.0.0 release added the piece that had been missing: a Goodness of Interpretability index quantifying how well the approximating tree reconstructs the ensemble's own proximity matrix, with a permutation test for significance. Interactive visualisation and a C++ backend with OpenMP parallelism arrived alongside, and support now spans ranger and CatBoost as well as the original targets.

Development has moved from producing an explanation to defending it. The GoI index and its permutation test change the package's claim from here is a tree that resembles your ensemble to here is how closely it resembles it and whether that could have happened by chance — the question a reviewer asks of any surrogate model. Around that, the work is engineering: the proximity matrix construction moved from R-level parallel loops into C++ with thread-level parallelism, and recent releases have been absorbing the awkwardness of supporting multiple ensemble backends, where a multi-class CatBoost objective returns a score matrix where a vector was expected. Interactive visNetwork output and standalone HTML export point at explanations meant to be shared rather than only inspected.

Given how much recent effort has gone into per-backend adapters, expect further work on ensemble compatibility; the entries do not indicate whether the interpretability index is heading toward comparing surrogate trees against each other.