- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes HEX, which recursively explains feature-selection masks to identify what determines the choice of features for each input. I view its central contribution as distinguishing features needed for prediction from those governing which predictive features are selected. The method builds on Hide&Seek and presents nesting and feature-block recovery results under idealized assumptions. Validation uses five synthetic mechanisms with independent inputs and CoverType covariates. The results show strong recovery of ordered feature structure with independent inputs, while performance on correlated covariates is more sensitive to the training procedure.
Critical strengths
- The distinction between features needed for prediction and features governing their selection conceptually useful. Recursively explaining selection masks makes this distinction concrete and helps reveal how a model changes its predictive mechanism across inputs.
- The experiments explicitly evaluate ordered feature structure. HEX-M’s reported 97.5–99.1% exact-path recovery on Models 1–3 with independent inputs provides encouraging evidence that this hierarchy can recover meaningful structure in controlled settings.
Critical weaknesses
- My main concern is the gap between predictive fidelity and the sufficiency of the returned masks. Algorithm 2 trains the predictor using , whereas the hierarchy uses . If denotes the corresponding input constructed with the hard mask, then . Thus, a feature with gate value still contributes to the predictor’s input despite being absent from the reported explanation. A small soft-gate prediction loss does not, by itself, establish the stated sufficiency condition . This distinction matters because : later levels can faithfully explain an earlier selector’s thresholding artifacts. The structural results provide evidence on the tested mechanisms, but Tables 5–6 report predictive fidelity only at the first order. I would need per-order soft-versus-hard fidelity, threshold sensitivity, and direct sufficiency checks to trust the interpretation of the full hierarchy.
- I find the evidence for structural superiority difficult to separate from differences in representation. The generating mechanisms have the form , with potentially multivariate routing and nonlinear leaf functions . Conventional regression trees instead approximate the output through partitions, . Approximating a leaf function such as requires additional splits, so an accurate predictor need not resemble the generating tree structurally. Although OBA can merge consecutive feature blocks, global tree-edit distance remains sensitive to this mismatch. Averaging structural distances over constituent trees is also questionable for boosting, whose components model corrections to an ensemble rather than the complete mechanism individually. Consequently, poor baseline structural scores do not convincingly establish HEX’s advantage. Comparisons with multivariate splits and flexible leaf models, together with ablations of HEX-M’s training stages, would make the empirical contribution substantially clearer.
Questions for authors
- Are the fidelity results in Tables 5–6 computed using soft gates or hard masks ? What fidelity is obtained with hard masks at each hierarchy level, measured against that level’s target ? This distinction materially affects my confidence in the returned explanations.
- How are baseline leaves labelled, and how does tree-edit distance account for additional splits needed to approximate nonlinear leaf functions? What justifies averaging constituent-tree structural distances for boosting, where individual trees do not represent the complete predictive mechanism?
- Are ablations available that isolate pseudo-mask pre-training and regime-support refinement while keeping the HEX recursion and other settings fixed? These would help establish which components drive the substantial improvement of HEX-M over HEX-S.
Response to Reviewer pSdw
Thank you for the careful review and for recognizing the central distinction made by HEX. We have substantially strengthened the revision in direct response to the three main concerns, which are (1) quantifying the role of thresholded masking, (2) comparisons with multivariate splits and flexible leaf models, (3) ablations of HEX-M’s training stages.
1. Hard-mask fidelity, per-order evaluation, and threshold sensitivity
We added a new appendix section, “Hard-mask fidelity and threshold sensitivity,” that evaluates every saved HEX-M order using both its continuous soft gate and its thresholded hard mask.
At order one, both versions are evaluated against the original model output. At higher orders, both are evaluated against that order’s fixed target: the preceding reported mask at the default threshold.
The new results report:
Soft and hard fidelity are nearly identical on independent inputs; correlated CoverType features reveal a few harder higher-order cases.
2. Comparisons with multivariate splits and flexible leaf models
We added NNRT (Bertsimas, Dunn, and Wang, 2021) as a new baseline in the appendix. NNRT is a decision-tree method with multivariate splits and flexible polynomial leaf models, directly addressing the reviewer’s requested comparison.
On the same CoverType experiments, we report NNRT beside HEX-S and HEX-M for predictive fidelity, OBA/F1, exact-path recovery, and tree-edit distance. NNRT achieves strong predictive fidelity, but its recovered paths and trees remain much less similar to the true generating mechanism than those returned by HEX.
3. Ablations of HEX-M’s training stages
We added a controlled ablation that removes, one at a time, selector pseudo-mask pretraining and regime-support refinement, while keeping the data, architecture, recursion, and all other training stages fixed.
Removing pseudo-mask pretraining causes structural recovery to collapse on all five models. Removing only regime-support refinement causes a smaller but consistent decline in OBA, aligned F1, and exact-path recovery. Thus, pseudo-mask pretraining provides the initial selector, while refinement improves the stability of the recovered hierarchy.
Other points
For conventional trees, each internal node is labelled by its split feature and each leaf by the empty set, because it returns a constant. For NNRT, routing nodes and leaves are labelled by the variables occurring in their fitted routing and polynomial leaf formulas.
We distinguish predictive fidelity, reported in Appendix D, from recovery of the true generating decision-tree structure, reported in Tables 3 and 4. These results quantify how far the trees generated by axis-aligned decision-tree methods are from the true tree. The new results show that NNRT, whose decision nodes are multivariate and whose leaves are flexible polynomial models, also performs poorly in structural recovery.
For boosting, we average constituent-tree distances because every constituent contributes to the ensemble prediction. Thus, for a given input, if the ensemble reconstructs the true generating decision path, each contributing tree should use a subset of the decision variables on that path. We hypothesize that this similarity is reflected in the expected constituent-tree distance. In practice, the resulting expected component-level distances are only slightly closer to the true decision tree than CART and NNRT. The only methods that completely or partly recover the true generating structure are the proposed HEX-S and HEX-M.