Even though Shapley value provides an effective explanation for a DNN model prediction, the computation relies on the enumeration of all possible input feature coalitions, which leads to the exponentially growing complexity. To address this problem, we propose a novel method SHEAR to significantly accelerate the Shapley explanation for DNN models, where only a few coalitions of input features are involved in the computation. The selection of the feature coalitions follows our proposed Shapley chain rule to minimize the absolute error from the ground-truth Shapley values, such that the computation can be both efficient and accurate. To demonstrate the effectiveness, we comprehensively evaluate SHEAR across multiple metrics including the absolute error from the ground-truth Shapley value, the faithfulness of the explanations, and running speed. The experimental results indicate SHEAR consistently outperforms state-of-the-art baseline methods across different evaluation metrics, which demonstrates its potentials in real-world applications where the computational resource is limited.
翻译:尽管Shapley值为DNN模型的预测提供了有效解释,但计算依据了所有可能的输入特征联盟的列举,从而导致急剧增长的复杂性。为了解决这一问题,我们提议了一个新颖的方法SHEAR,以大大加快DNN模型的Shapley解释,因为计算中只涉及少量输入特征联盟。选择特性联盟遵循了我们提议的“Shapley”链规则,以尽量减少地面真相沙普利值的绝对错误,从而计算既有效又准确。为了证明有效性,我们全面评估了多个指标的SHEAR,包括来自地面真相沙普利值的绝对错误、解释的忠实性以及运行速度。实验结果显示,SHEAR始终超越了不同评价指标中的最新基线方法,这显示了它在计算资源有限的现实世界应用中的潜力。