arXiv:2603.00496 · v2
ESENSC: A Polynomial-Time Axiomatic Alternative to SHAP
摘要
We propose ESENSC, a computationally efficient and theoretically grounded alternative to SHAP. ESENSC is a deterministic, closed-form attribution rule that requires only linearly many coalition-value evaluations, satisfies the null-player property, and admits an axiomatic characterization based on efficiency, a restricted form of differential marginality, and explicit computational constraints.Empirically, on tabular prediction tasks using neural network and XGBoost models, ESENSC shows close agreement with exact SHAP in both attribution magnitude and feature rankings while requiring substantially less computation. Under the evaluated settings, it compares favorably with widely used sampling-based SHAP approximations. While exact SHAP requires exponentially many coalition evaluations, ESENSC scales linearly with the number of features. These results show that ESENSC offers a favorable trade-off between agreement with exact SHAP and computational cost, providing a practical and theoretically grounded alternative for feature attribution in high-dimensional applications.
作者备注:Accepted to NeurIPS 2026 (camera-ready version). 28 pages. Title changed; the method previously called ESENSC_rev2 is renamed ESENSC