- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors target a critical flaw in the interpretability of soft decision trees. Because soft trees route inputs through all branches at the same time and use structural gates to prune redundant paths, extracting a single hard decision path for human inspection is often unfaithful to the true model behavior. Specifically, selecting a path based on raw routing scores or greedy top-down steps can pick a branch that was actually zeroed out by a structural gate, or miss the globally optimal path because downstream softmax normalizers vary across subtrees. Furthermore, standard soft trees mix input feature effects with learned gate weights and cannot tell when a single path is enough to represent the full weighted mixture of leaves
To solve these problems, the authors propose SPECTRA (soft decision tree) where the explanation comes directly from the exact same math that calculates the prediction. At each branch, the tree learns a simple min–max range for every feature, called a prototype, which gives a clear score for how much each feature helps the routing decision. By taking the logarithm of the branch probabilities and gates, multiplying weights down a path turns into simple addition, allowing a bottom-up search algorithm to always find the exact path with the largest real weight. This same math also splits the difference between the best path and the second-best path into three exact parts: input feature scores, structural gate weights, and node normalization. In addition, the model checks how much of the total weight is held by the top path and uses a validation test to decide when showing one path is safe and when it must show multiple paths instead.
Across 69 tabular datasets, SPECTRA also achieves higher accuracy than standard single decision trees like CART, especially when trees are kept very small with four leaves or fewer so that humans can easily read them.
Critical strengths
Authors target an important issue of soft tree interpretability and achieve comparable (or better) performance in 1 tree setting
Critical weaknesses
- In standard univariate trees a root-to-leaf path of 2 checks at most 2 featutes, while in soft trees, in general without hardening, all D features are used. Furthermore, the authors admit that SPECTRA's prototype margin spreads 90% of its mass across 6.94 features on average (compared to 2.26 for CART). The node boundary is closer to RBF or shallow MLP with misture of experts rather than standard trees (either univariate or oblique). In such a setting, interpretability is much lower.
- Across the 69 tasks, the "dominant path" carries an average of only 23.9% of the surviving flow and agrees with the soft tree's actual prediction only 71.74% of the time
- When and , SPECTRA is not even a multi-level tree! It is literally a flat, 1-layer soft Mixture-of-Experts (or RBF classifier) with 18 prototype experts at the root node
- Comparison with univariate trees (CART, MurTree) is unfair because SPECTRA has way more parameters; it should be compared with other soft/multivariate trees. When compared as a single tree at 8 and 16 leaves, SPECTRA loses to CART
Questions for authors
Please address weaknesses
Discussion?
Dear authors,
if you want to engage in a discussion, the time is now. The forum will close to the authors on November 18, 2026: https://iclr.cc/Conferences/2027/Dates
Without a rebuttal, there the reviewers are unlikely to change their opinion, which would lead to rejection, most likely.
Sincerely Your AC