mlsanityData to 7 Oct 2026

SHAP values through General Fourier Representations: Theory and Applications

arXiv 2511.00185 ↗First posted 31 Oct 2025math.OC math.AP stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 36 references that are in the map. First posted on arXiv 31 Oct 2025.

Builds on

15 of 36 references.

References · 15

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  2. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  3. 2018On the Spectral Bias of Neural Networkscited by 1,321
  4. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  5. 2017Deep Neural Networks as Gaussian Processescited by 617
  6. 2019Frequency Principle: Fourier Analysis Sheds Light on Deep Neural Networkscited by 360
  7. 2019Tensor Programs I: Wide Feedforward or Recurrent Neural Networks of Any Architecture are Gaussian Processescited by 148
  8. 2019Non-Gaussian processes and neural networks at finite widthscited by 78
  9. 2019Theory of the Frequency Principle for General Deep Neural Networkscited by 45
  10. 2020Wide Neural Networks with Bottlenecks are Deep Gaussian Processescited by 18
  11. 2023A Scalable Walsh-Hadamard Regularizer to Overcome the Low-degree Spectral Bias of Neural Networkscited by 10
  12. 2024SHAP values via sparse Fourier representationcited by 8
3 more
  1. 2015Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transformcited by 3
  2. 2024Random ReLU Neural Networks as Non-Gaussian Processescited by 3
  3. 2024Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selectioncited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.