菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-03-03
📄 Abstract - Exact Functional ANOVA Decomposition for Categorical Inputs Models

Functional ANOVA offers a principled framework for interpretability by decomposing a model's prediction into main effects and higher-order interactions. For independent features, this decomposition is well-defined, strongly linked with SHAP values, and serves as a cornerstone of additive explainability. However, the lack of an explicit closed-form expression for general dependent distributions has forced practitioners to rely on costly sampling-based approximations. We completely resolve this limitation for categorical inputs. By bridging functional analysis with the extension of discrete Fourier analysis, we derive a closed-form decomposition without any assumption. Our formulation is computationally very efficient. It seamlessly recovers the classical independent case and extends to arbitrary dependence structures, including distributions with non-rectangular support. Furthermore, leveraging the intrinsic link between SHAP and ANOVA under independence, our framework yields a natural generalization of SHAP values for the general categorical setting.

顶级标签: theory model evaluation machine learning
详细标签: functional anova interpretability categorical inputs shap values model decomposition 或 搜索:

针对分类输入模型的精确函数方差分析分解 / Exact Functional ANOVA Decomposition for Categorical Inputs Models


1️⃣ 一句话总结

这项研究为使用分类数据的机器学习模型提出了一种全新的、精确且高效的解释方法,它能够将模型的预测结果清晰地分解为各个特征单独的影响以及它们之间的相互作用,即使这些特征之间存在复杂的依赖关系,从而解决了以往方法只能依赖耗时近似计算的难题。

源自 arXiv: 2603.02673