Trade-off Between Efficiency and Consistency for Removal-based Explanations
Yifan Zhang, Haowei He, Zhiquan Tan, Yang Yuan

TL;DR
This paper introduces the Impossible Trinity Theorem, demonstrating that interpretability, efficiency, and consistency cannot all be achieved simultaneously in removal-based explanations, and proposes algorithms to minimize interpretation error.
Contribution
It establishes the Impossible Trinity Theorem and presents two novel algorithms based on polynomial basis to reduce interpretation error in explanation methods.
Findings
Interpretation error can be reduced up to 31.8 times with proposed algorithms.
Inherent trade-offs exist between interpretability, efficiency, and consistency.
Proposed methods outperform existing techniques in minimizing interpretation error.
Abstract
In the current landscape of explanation methodologies, most predominant approaches, such as SHAP and LIME, employ removal-based techniques to evaluate the impact of individual features by simulating various scenarios with specific features omitted. Nonetheless, these methods primarily emphasize efficiency in the original context, often resulting in general inconsistencies. In this paper, we demonstrate that such inconsistency is an inherent aspect of these approaches by establishing the Impossible Trinity Theorem, which posits that interpretability, efficiency, and consistency cannot hold simultaneously. Recognizing that the attainment of an ideal explanation remains elusive, we propose the utilization of interpretation error as a metric to gauge inefficiencies and inconsistencies. To this end, we present two novel algorithms founded on the standard polynomial basis, aimed at minimizing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Reservoir Engineering and Simulation Methods · Scientific Computing and Data Management
