Summary
This paper presents a novel method, SHAPley Interaction Quantification (SHAP-IQ), for efficiently computing Shapley interaction indices in the context of explainable artificial intelligence (XAI). Shapley interaction indices extend the concept of Shapley values, a method from cooperative game theory, to measure the contribution of interactions between features in a model. The authors propose SHAP-IQ as a unified sampling-based approximation method that can be applied to any Cardinal Interaction Index (CII). They provide theoretical guarantees for SHAP-IQ, showing that it is unbiased and consistent, and provide a general approximation bound. They also discuss the computational complexity of SHAP-IQ and how it compares to other methods. The paper also presents a new representation for the Shapley value (SV) and shows that in the special case of single feature subsets, SHAP-IQ provides novel insights into the SV and greatly simplifies the calculation of Unbiased KernelSHAP (U-KSH). The authors conducted multiple experiments to illustrate the approximation quality of SHAP-IQ compared to current baseline approaches. They compare the baseline methods with SHAP-IQ using different evaluation metrics. The paper concludes with an appendix that provides further theoretical and experimental results for SHAP-IQ, including additional results for specific CIIs such as SII, n-SII, STI, and FSI. The appendix also includes all proofs of theoretical results from the main paper, further insights into the implementation of SHAP-IQ, and additional experimental results. In summary, this paper presents a novel method for computing Shapley interactions, provides theoretical guarantees for this method, and demonstrates its effectiveness through a series of experiments.
Strengths
**Originality**: The authors propose a novel method, SHAPley Interaction Quantification (SHAP-IQ), for computing Shapley interactions for arbitrary cardinal interaction indices (CII). This is a unique contribution to the field of explainable artificial intelligence (XAI), particularly in the context of black box models. The paper not only presents the new method but also includes a detailed comparison with existing methods, an exploration of its theoretical properties, and a demonstration of its practical application. This comprehensive approach strengthens the authors' claims about the effectiveness of SHAP-IQ.
**Quality**: The paper provides a rigorous theoretical foundation for SHAP-IQ, including proofs of its properties such as being unbiased and consistent. The authors also provide a general approximation bound for SHAP-IQ.
**Clarity**: The paper is well-structured and clearly written. The authors provide a clear explanation of their method and its theoretical underpinnings, making it accessible to readers with a background in the field. The appendix provides additional theoretical and experimental results, further supporting the claims made in the main paper. It also includes all proofs of theoretical results, providing transparency and allowing readers to fully understand the theoretical foundation of SHAP-IQ.
**Significance**: The authors demonstrate the practical application of SHAP-IQ through a series of experiments. They show that it can be applied to different machine learning models and datasets, and that it outperforms existing methods in terms of approximation quality and computational efficiency. This suggests that SHAP-IQ could have a significant impact on the practice of XAI.
Weaknesses
This paper has no obvious weakness. The main concern from me is the reproducibility of the experiments, which seems like requiring too many computational resources.
Questions
Could the authors discuss some future works about the SHAP-IQ?
Rating
7: Accept: Technically solid paper, with high impact on at least one sub-area, or moderate-to-high impact on more than one areas, with good-to-excellent evaluation, resources, reproducibility, and no unaddressed ethical considerations.
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.
Limitations
Yes, the authors have discussed limitations well.