Algorithms to estimate Shapley value feature attributions

• Published in: Nature machine intelligence Vol. 5; no. 6; pp. 590 - 601
• Main Authors: Chen, Hugh, Covert, Ian C., Lundberg, Scott M., Lee, Su-In
• Format: Journal Article
• Language: English
• Published: London Nature Publishing Group UK 01.06.2023; Nature Publishing Group
• Subjects: 639/705/1041; 639/705/117; 639/705/794; Algorithms; Approximation; Complexity; Employees; Engineering; Games; Machine learning; Review Article
• ISSN: 2522-5839; 2522-5839
• DOI: 10.1038/s42256-023-00657-x

Feature attributions based on the Shapley value are popular for explaining machine learning models. However, their estimation is complex from both theoretical and computational standpoints. We disentangle this complexity into two main factors: the approach to removing feature information and the tractable estimation strategy. These two factors provide a natural lens through which we can better understand and compare 24 distinct algorithms. Based on the various feature-removal approaches, we describe the multiple types of Shapley value feature attributions and the methods to calculate each one. Then, based on the tractable estimation strategies, we characterize two distinct families of approaches: model-agnostic and model-specific approximations. For the model-agnostic approximations, we benchmark a wide class of estimation approaches and tie them to alternative yet equivalent characterizations of the Shapley value. For the model-specific approximations, we clarify the assumptions crucial to each method’s tractability for linear, tree and deep models. Finally, we identify gaps in the literature and promising future research directions. There are numerous algorithms for generating Shapley value explanations. The authors provide a comprehensive survey of Shapley value feature attribution algorithms by disentangling and clarifying the fundamental challenges underlying their computation.