SHAP values through General Fourier Representations: Theory and Applications

• URL: http://arxiv.org/abs/2511.00185v1
• Date: Fri, 31 Oct 2025 18:41:36 GMT
• Title: SHAP values through General Fourier Representations: Theory and Applications
• Authors: Roberto Morales,
• Abstract summary: This article establishes a rigorous framework for the mathematical analysis of SHAP values.<n>We show that any predictive model defined on a discrete or multi-valued input space admits a generalized Fourier expansion with respect to an orthonormalisation tensor-product basis constructed under a product probability measure.<n>In the deterministic regime, we derive quantitative stability estimates for SHAP values under Fourier truncation, showing that the attribution map is Lipschitz continuous with respect to the distance between predictors.<n>In the probabilistic regime, we consider neural networks in their infinite-width limit and prove convergence of SHAP values toward those induced by the corresponding Gaussian process
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This article establishes a rigorous spectral framework for the mathematical analysis of SHAP values. We show that any predictive model defined on a discrete or multi-valued input space admits a generalized Fourier expansion with respect to an orthonormalisation tensor-product basis constructed under a product probability measure. Within this setting, each SHAP attribution can be represented as a linear functional of the model's Fourier coefficients. Two complementary regimes are studied. In the deterministic regime, we derive quantitative stability estimates for SHAP values under Fourier truncation, showing that the attribution map is Lipschitz continuous with respect to the distance between predictors. In the probabilistic regime, we consider neural networks in their infinite-width limit and prove convergence of SHAP values toward those induced by the corresponding Gaussian process prior, with explicit error bounds in expectation and with high probability based on concentration inequalities. We also provide a numerical experiment on a clinical unbalanced dataset to validate the theoretical findings.

Related papers

• Nonparametric Identification and Inference for Counterfactual Distributions with Confounding [6.997978440999076]
  We propose nonparametric identification and semiparametric estimation of joint potential outcome in the presence of confounding.<n>By bridging classical semiparametric theory with modern representation learning, this work provides a robust statistical foundation for distributional and counterfactual inference in complex causal systems.
  arXiv  Detail & Related papers  (2026-02-17T05:00:13Z)
• Universality of General Spiked Tensor Models [9.454986540713655]
  We study the rank-one spiked tensor model in the high-dimensional regime.<n>We show that their high-dimensional spectral behavior and statistical limits are robust to non-Gaussian noise.
  arXiv  Detail & Related papers  (2026-02-04T11:59:30Z)
• Schrodinger Neural Network and Uncertainty Quantification: Quantum Machine [0.0]
  We introduce the Schrodinger Neural Network (SNN), a principled architecture for conditional density estimation and uncertainty.<n>The SNN maps each input to a normalized wave function on the output domain and computes predictive probabilities via the Born rule.
  arXiv  Detail & Related papers  (2025-10-27T15:52:47Z)
• Free Probability approach to spectral and operator statistics in Rosenzweig-Porter random matrix ensembles [0.0]
  We analyze the spectral and operator statistics of the Rosenzweig-Porter random matrix ensembles.<n>We develop a perturbative scheme that yields semi-analytic expressions for the density of states up to second order in system size.
  arXiv  Detail & Related papers  (2025-06-04T23:56:23Z)
• Overcoming Dimensional Factorization Limits in Discrete Diffusion Models through Quantum Joint Distribution Learning [79.65014491424151]
  We propose a quantum Discrete Denoising Diffusion Probabilistic Model (QD3PM)<n>It enables joint probability learning through diffusion and denoising in exponentially large Hilbert spaces.<n>This paper establishes a new theoretical paradigm in generative models by leveraging the quantum advantage in joint distribution learning.
  arXiv  Detail & Related papers  (2025-05-08T11:48:21Z)
• Optimal Bayesian Affine Estimator and Active Learning for the Wiener Model [3.7414278978078204]
  We derive a closed-form optimal affine estimator for the unknown parameters, characterized by the so-called "dynamic basis statistics"<n>We develop an active learning algorithm synthesizing input signals to minimize estimation error.
  arXiv  Detail & Related papers  (2025-04-07T20:36:06Z)
• Semiparametric inference for impulse response functions using double/debiased machine learning [49.1574468325115]
  We introduce a machine learning estimator for the impulse response function (IRF) in settings where a time series of interest is subjected to multiple discrete treatments. The proposed estimator can rely on fully nonparametric relations between treatment and outcome variables, opening up the possibility to use flexible machine learning approaches to estimate IRFs.
  arXiv  Detail & Related papers  (2024-11-15T07:42:02Z)
• Statistical Inference for Temporal Difference Learning with Linear Function Approximation [55.80276145563105]
  We investigate the statistical properties of Temporal Difference learning with Polyak-Ruppert averaging.<n>We make three theoretical contributions that improve upon the current state-of-the-art results.
  arXiv  Detail & Related papers  (2024-10-21T15:34:44Z)
• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework.<n>We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points.<n>Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• Flow matching achieves almost minimax optimal convergence [50.38891696297888]
  Flow matching (FM) has gained significant attention as a simulation-free generative model. This paper discusses the convergence properties of FM for large sample size under the $p$-Wasserstein distance. We establish that FM can achieve an almost minimax optimal convergence rate for $1 leq p leq 2$, presenting the first theoretical evidence that FM can reach convergence rates comparable to those of diffusion models.
  arXiv  Detail & Related papers  (2024-05-31T14:54:51Z)
• Convergence of Continuous Normalizing Flows for Learning Probability Distributions [10.381321024264484]
  Continuous normalizing flows (CNFs) are a generative method for learning probability distributions. We study the theoretical properties of CNFs with linear regularity in learning probability distributions from a finite random sample. We present a convergence analysis framework that encompasses the error due to velocity estimation, the discretization error, and the early stopping error.
  arXiv  Detail & Related papers  (2024-03-31T03:39:04Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• Nonparametric Score Estimators [49.42469547970041]
  Estimating the score from a set of samples generated by an unknown distribution is a fundamental task in inference and learning of probabilistic models. We provide a unifying view of these estimators under the framework of regularized nonparametric regression. We propose score estimators based on iterative regularization that enjoy computational benefits from curl-free kernels and fast convergence.
  arXiv  Detail & Related papers  (2020-05-20T15:01:03Z)

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.