3 Overview of Talks 3.1 SHAP Explanations with Booleans Circuit Classifiers

RL2, Publisher: Dagstuhl Reports, Link >


Leopoldo Bertossi


The presentation turns around the subject of explainable AI. More specifically, we deal with attribution numerical scores that are assigned to features values of an entity under classification, to identify and rank their importance for the obtained classification label. We concentrate on the popular SHAP score [2] that can be applied with black-box and open models. We show that, in contrast to its general #P-hardness, it can be computed in polynomial time for classifiers that are based on decomposable and deterministic Boolean decision circuits. This class of classifiers includes decision trees and ordered binary decision diagrams. This result was established in [1]. The presentation illustrates how the proof heavily relies on the connection to SAT-related computational problems.

11 visualizaciones

Entradas Recientes

Ver todo

RL1, Publisher: Computer Vision for X-Ray Testing, Link > Authors Domingo Mery, Bernardita Morris Abstract Given a facial matcher, in explainable face verification, the task is to answer: how rele