- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The paper addresses the interpretability-performance tradeoff between inherently interpretable models such as GAMs and black box models such as Tabular Foundation Models (TFMs). The paper proposes TabDistill, a sparse interaction selection procedure that is based on TFMs that allows GAMs to include a small number of interactions to improve their predictive performance compared to additive main effect GAMs. To select a sparse set of interactions, the authors suggest to fit a TFM (they choose TabPFN in their experiments) to the data. Then, they apply SPEX to each held-out observation to estimate (approximate) Faith-Banzhaf interactions up to an order k using a sparse Fourier representation. They rank and select interacting subsets for the final GAM based on their frequency of occurence. Further, they propose a more efficient variant, namely TabDistill-Proxy, which fits TabPFN to the residuals of an additive GAM and uses attention-based interaction detection instead of SPEX.
Critical strengths
- The paper addresses a relevant problem: sparse selection of useful interactions to improve the predictive performance of interpretable models.
Critical weaknesses
-
The proposed approach seems unnecessarily complicated and not intuitive. a) Important baselines that directly fit an interpretable model with sparse and/or low-order interactions are missing, e.g., GAMI-Net, SIAN, Random Planted Forests, SKIM-FA [1–4]. The paper does not provide any theoretical or empirical justification that fitting a foundation model and extracting its interactions is preferable to directly fit an interpretable model. b) I do not see why interactions found via SPEX for the TabPFN should generally be useful for adding to a GAM. The SPEX interactions rom TabPFN could also be model-specific or spurious. The paper does not provide a convincing theoretical or empirical justification for it.
-
Chosen explanation method computationally expensive and experimental evaluation not supporting main claims. a) The goal is to select globally relevant interactions, but instead the authors apply SPEX on individual observations and aggregate the results afterward which seems computationally expensive. There are already methods for detecting or quantifying global interactions in black-box models, such as VIN, Friedman's H-statistic, ALE [5–7]. Since the suggested approach is agnostic to the explanation method, I would have expected at least a comparison with some of these approaches, especially regarding computational cost and the relevance of the selected interactions. I also would have expected a justification of why SPEX was chosen over other interaction detection methods (also missing in related work). Also, since Shapley interactions / SPEX are model-agnostic, it is not clear, why it should be applied to a foundation model rather than other models that work well on tabular data such as Random Forest or XGBoost. b) While the ground-truth interactions are known in the synthetic experiments, the paper only evaluates predictive performance. This was surprising to me, since the paper is mainly about interaction discovery. An evaluation of whether the correct interactions are actually recovered is missing. Also, the ML baselines are mostly evaluated with default hyperparameters, and the Fourier-based synthetic functions closely relate to the assumptions motivating SPEX, which feels a bit constructed in favor of their own method. Most of the empirical validation only considers datasets with fewer than 10 features, where exhaustive / greedy interaction selection is still feasible. Although they also report results on datasets with up to 100 features, they do not separate results by dimensionality. Thus, it is not clear if the approach is beneficial in higher-dimensional settings, where interaction selection becomes more challenging. Given the computational cost of the procedure, I would also expect an evaluation of how its runtime scales with the number of features.
[1] Yang, Z., Zhang, A., & Sudjianto, A. (2021). GAMI-Net: An Explainable Neural Network Based on Generalized Additive Models with Structured Interactions. Pattern Recognition.
[2] Enouen, J., & Liu, Y. (2022). Sparse Interaction Additive Networks via Feature Interaction Detection and Sparse Selection. Advances in Neural Information Processing Systems.
[3] Hiabu, M., Mammen, E., & Meyer, J. T. (2020). Random Planted Forest: A Directly Interpretable Tree Ensemble. arXiv:2012.14563.
[4] Agrawal, R., & Broderick, T. (2023). The SKIM-FA Kernel: High-Dimensional Variable Selection and Nonlinear Interaction Discovery in Linear Time. Journal of Machine Learning Research.
[5] Hooker, G. (2004). Discovering Additive Structure in Black Box Functions. Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[6] Friedman, J. H., & Popescu, B. E. (2008). Predictive Learning via Rule Ensembles. Annals of Applied Statistics.
[7] Apley, D. W., & Zhu, J. (2020). Visualizing the Effects of Predictor Variables in Black Box Supervised Learning Models. Journal of the Royal Statistical Society: Series B.
Questions for authors
-
Why are interactions aggregated based on how frequently they are identified across observations? This could potentially miss strong interactions that are relevant only in a small part of the feature space. Why not consider their magnitude or contribution to predictive performance?
-
How exactly are masked features treated when computing the interaction scores? In particular, how does the approach account for dependencies between features and potentially unrealistic feature combinations?
2 comments
I thank the authors for their rebuttal, however, it does not address my concerns in the review appropriately, therefore I remain my score.
Weakness 1. The motivation for TFM-guided interaction selection
Transferring pretrained knowledge into interpretable GAMs. Our goal is not to replace existing interpretable models, but to improve the interpretability of TFMs and to improve the interaction selection by leveraging knowledge acquired through TFM pretraining. Unlike models trained solely on the target dataset, TFMs can benefit from cross-task inductive biases, potentially identifying useful interactions in low-data settings.
Empirical justification and limitations. We also evaluate multiple interpretable backbones, including TabDistill with EBM, PyGAM, SNAM, and SIAN (Table A4). Our contribution is demonstrating their downstream predictive ability.
Weakness 2. Computational cost and experimental validation
Motivation for SPEX and TFMs. We choose SPEX for its model-agnostic higher-order interaction attribution and sparse Fourier recovery. TFMs provide pretrained knowledge beyond the target dataset. We acknowledge that comparisons with alternative global interaction measures (VIN, H-statistic, ALE) and conventional teachers (Random Forest, XGBoost) would further isolate these contributions.
Computational cost and scalability. The main computational bottleneck arises from repeated per-sample TFM queries rather than exhaustive enumeration over feature dimensions. Although our main experiments focus on smaller datasets to manage computational cost, Section 4.3 evaluates eight datasets with 10–100 features.
Synthetic evaluation and baseline configuration. We use mostly default hyperparameters to maintain a consistent and reproducible evaluation protocol across baselines. We acknowledge that this does not establish superiority over fully tuned baselines. Importantly, our Fourier-sparse experiments evaluate TabPFN's predictive ability, rather than SPEX's interaction recovery, so SPEX does not directly benefit from the Fourier-based construction in these comparisons. Furthermore, Appendix A.4 evaluates non-smooth tree-structured interactions, providing additional evidence beyond Fourier-sparse functions.
Q1. Frequency-based aggregation for global interaction selection
Population-level interaction relevance. Our intuition is that interactions with broad relevance across the data distribution should be consistently identified across observations. Frequency-based aggregation prioritizes such interactions while reducing sensitivity to unusually large attribution values from individual samples. This aligns with our goal of selecting a small set of globally useful interactions for interpretable GAMs.
Q2. Feature masking and dependencies
Reference-based feature masking. We replace masked numerical features with their means and categorical features with their modes. This provides a consistent reference for SPEX attribution. However, the masking procedure does not explicitly preserve dependencies between features and may produce unrealistic combinations. We acknowledge this limitation and will clarify that the resulting interaction attributions are conditional on the chosen masking scheme.