VeriSHAP Slides

2026/06/02 by David Boetius · 1 voice

paper · doi:10.6084/m9.figshare.32546313

openalex publication_date 2026/06/02 · openalex created_date 2026/06/03 · openalex updated_date 2026/07/01

Abstract

A slide deck for a 20-minute talk about the VeriSHAP algorithm presented in the ICML'26 paper "Verified SHAP: Provable Bounds for Exact Shapley Values of Neural Networks" by David Boetius, Shahaf Bassan, Guy Katz, Stefan Leue, and Tobias Sutter. Paper: https://arxiv.org/abs/2605.24084

Discussions

• Presented my new paper to my co-workers last week and got a lot of praise for my slides. So here they are for everyone: doi.org/10.6084/m9.f... [bsky, 4 points, 0 comments]

Related

• Verified SHAP: Provable Bounds for Exact Shapley Values of Neural Networks
• HarsanyiNet: Computing Accurate Shapley Values in a Single Forward Propagation
• SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism
• On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results
• On the Computational Tractability of the (Many) Shapley Values