Generalized Functional ANOVA: A Complete Theoretical Framework
Not on the map. Why?
Abstract (arXiv)
The functional ANOVA provides a fundamental representation of square-integrable multivariate functions into main effects and higher-order interactions. For independent inputs, the components belong to mutually orthogonal Hilbert subspaces and admit an explicit representation. For dependent inputs, however, the components are only hierarchically orthogonal: although existence and uniqueness results are available, the Hilbert subspaces underlying the generalized decomposition have remained implicit. We resolve this representation problem for continuous inputs supported on a bounded hyperrectangle whose joint density is bounded above and away from zero. We introduce a distribution-adapted family of functions and prove that it forms a Riesz basis of the L2 space, thereby guaranteeing a unique, stable, and unconditionally convergent representation. We then show that, for every coalition of variables, the corresponding block of this basis exactly characterizes the Hilbert subspace containing the functional ANOVA component. Our construction recovers the classical orthogonal decomposition under input independence. As a direct consequence, computing the generalized functional ANOVA reduces to estimating coefficients in an explicit, distribution-adapted basis. Finally, as a proof of concept, we introduce an elementary, fast and model-agnostic estimator based on our theoretical results. Experiments on synthetic and real-world datasets illustrate its connections with established tabular explanation methods and show that low order components often capture most of the signal in the model output.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 62 references that are in the map. First posted on arXiv 18 May 2026.
Builds on
18 of 62 references.
References · 18
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,458
- 2020Neural Additive Models: Interpretable Machine Learning with Neural Netscited by 319
- 2018Consistent Individualized Feature Attribution for Tree Ensemblescited by 285
- 2019InterpretML: A Unified Framework for Machine Learning Interpretabilitycited by 246
- 2021NODE-GAM: Neural Generalized Additive Model for Interpretable Deep Learningcited by 88
- 2022From Shapley Values to Generalized Additive Models and backcited by 60
- 2022Neural Basis Models for Interpretabilitycited by 56
- 2024shapiq: Shapley Interactions for Machine Learningcited by 43
- 2019Purifying Interaction Effects with the Functional ANOVA: An Efficient Algorithm for Recovering Identifiable Additive Modelscited by 42
- 2024Beyond TreeSHAP: Efficient Computation of Any-Order Shapley Interactions for Tree Ensemblescited by 31
6 more
- 2023Deep Neural Networks for Nonparametric Interaction Models with Diverging Dimensioncited by 15
- 2022Statistical Aspects of SHAP: Functional ANOVA for Model Interpretationcited by 12
- 2019Generalized Sparse Additive Modelscited by 11
- 2019Reluctant Interaction Modelingcited by 8
- 2025Tree Ensemble Explainability through the Hoeffding Functional Decomposition and TreeHFD Algorithmcited by 6
- 2026Exact Functional ANOVA Decomposition for Categorical Inputs Modelscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Minimax Additive Regression under Unknown Dependent Designs30 Sep 2026