Generalized Functional ANOVA in Closed-Form: A Unified View of Additive Explanations

• URL: http://arxiv.org/abs/2605.18422v1
• Date: Mon, 18 May 2026 13:56:10 GMT
• Title: Generalized Functional ANOVA in Closed-Form: A Unified View of Additive Explanations
• Abstract summary: ANOVA provides a principled framework for interpretability by decomposing a model prediction into main effects and higher-order interactions.<n>We propose a simple but mighty algorithm to estimate the decomposition from a data sample in a model-agnostic setting.
• Score: 2.963223599781967
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The functional ANOVA, or Hoeffding decomposition, provides a principled framework for interpretability by decomposing a model prediction into main effects and higher-order interactions. For independent inputs, this classical decomposition is explicit. It is closely connected to SHAP values, generalized additive models, and orthogonal polynomial expansions, and therefore constitutes a fundamental tool for additive explainability. In the more general and realistic dependent setting, however, obtaining a tractable representation and estimating the decomposition from data remain challenging. In this work, we address this problem for continuous inputs. By combining Hilbert space methods with the generalized functional ANOVA, we build an explicit decomposition Riesz Basis allowing to easily compute the decomposition. Our formulation recovers the classical independent case and its associated orthogonal decomposition. Building on this representation, we propose a simple but mighty algorithm to estimate the decomposition from a data sample in a model-agnostic setting and we compare it empirically with several state-of-the-art explanation methods, demonstrating the power of the approach.

Related papers

• Sparse Orthogonal Regression Technique: A Spectral Framework for Equation Discovery, Approximation, and Integration [4.389213808289583]
  We develop a sparse framework for learning orthonormal-basis expansions from noisy and irregularly sampled data.<n>SORT estimates expansion coefficients using L1-regularized regression, avoiding explicit quadrature or analytic inner-product evaluation.<n>The central application is data-driven discovery of ordinary differential equations.
  arXiv  Detail & Related papers  (2026-08-13T17:31:27Z)
• Exact Functional ANOVA Decomposition for Categorical Inputs Models [2.762021507766656]
  ANOVA offers a principled framework for interpretability by decomposing a model's prediction into main effects and higher-order interactions.<n>For independent features, this decomposition is well-defined, strongly linked with SHAP values, and serves as a cornerstone of additive explainability.<n>We completely resolve this limitation for categorical inputs.
  arXiv  Detail & Related papers  (2026-03-03T06:59:56Z)
• Covariate-assisted Grade of Membership Models via Shared Latent Geometry [0.7939348535496568]
  The grade of membership model is a flexible latent variable model for analyzing multivariate categorical data through individual-level mixed membership scores.<n>Traditional approaches to incorporating auxiliary covariates typically rely on fully specified joint likelihoods, which are computationally intensive and sensitive to misspecification.<n>We introduce a covariate-assisted grade of membership model that integrates response and covariate information by exploiting their shared low-rank simplex geometry.
  arXiv  Detail & Related papers  (2026-01-24T02:30:36Z)
• Multivariate Bernoulli Hoeffding Decomposition: From Theory to Sensitivity Analysis [2.762021507766656]
  This work focuses on the case of Bernoulli inputs and provides a complete analytical characterization of the decomposition.<n>We show that, in this discrete setting, the associated subspaces are one-dimensional and that the decomposition admits a closed-form representation.<n>The paper concludes with perspectives on extending the methodology to high-dimensional settings and to models involving inputs with finite, non-binary support.
  arXiv  Detail & Related papers  (2025-10-08T14:46:20Z)
• Loss-Complexity Landscape and Model Structure Functions [53.92822954974537]
  We develop a framework for dualizing the Kolmogorov structure function $h_x(alpha)$.<n>We establish a mathematical analogy between information-theoretic constructs and statistical mechanics.<n>We explicitly prove the Legendre-Fenchel duality between the structure function and free energy.
  arXiv  Detail & Related papers  (2025-07-17T21:31:45Z)
• Identifiable Convex-Concave Regression via Sub-gradient Regularised Least Squares [1.9580473532948397]
  We propose a novel nonparametric regression method that models complex input-relationships as the sum of convex and concave components.<n>The method-ICCNLS-decomposes sub-constrained shape-constrained additive decomposition.
  arXiv  Detail & Related papers  (2025-06-22T15:53:12Z)
• Hoeffding decomposition of black-box models with dependent inputs [30.076357972854723]
  We generalize Hoeffding's decomposition for dependent inputs under mild conditions. We show that any square-integrable, real-valued function of random elements respecting two assumptions can be uniquely additively and offer a characterization.
  arXiv  Detail & Related papers  (2023-10-10T12:28:53Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• Estimation of Bivariate Structural Causal Models by Variational Gaussian Process Regression Under Likelihoods Parametrised by Normalising Flows [74.85071867225533]
  Causal mechanisms can be described by structural causal models. One major drawback of state-of-the-art artificial intelligence is its lack of explainability.
  arXiv  Detail & Related papers  (2021-09-06T14:52:58Z)
• Loss function based second-order Jensen inequality and its application to particle variational inference [112.58907653042317]
  Particle variational inference (PVI) uses an ensemble of models as an empirical approximation for the posterior distribution. PVI iteratively updates each model with a repulsion force to ensure the diversity of the optimized models. We derive a novel generalization error bound and show that it can be reduced by enhancing the diversity of models.
  arXiv  Detail & Related papers  (2021-06-09T12:13:51Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• Accounting for Unobserved Confounding in Domain Generalization [107.0464488046289]
  This paper investigates the problem of learning robust, generalizable prediction models from a combination of datasets. Part of the challenge of learning robust models lies in the influence of unobserved confounders. We demonstrate the empirical performance of our approach on healthcare data from different modalities.
  arXiv  Detail & Related papers  (2020-07-21T08:18:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.