TY - GEN
T1 - Short Boolean Formulas as Explanations in Practice
AU - Jaakkola, Reijo
AU - Janhunen, Tomi
AU - Kuusisto, Antti
AU - Feyzbakhsh Rankooh, Masood
AU - Vilander, Miikka
PY - 2023/9/24
Y1 - 2023/9/24
N2 - We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minimizes the error with respect to the target attribute to be explained. We first provide novel quantitative bounds for the expected error in this scenario. We then also demonstrate how the setting works in practice by studying three concrete data sets. In each case, we calculate explanation formulas of different lengths using an encoding in Answer Set Programming. The most accurate formulas we obtain achieve errors similar to other methods on the same data sets. However, due to overfitting, these formulas are not necessarily ideal explanations, so we use cross validation to identify a suitable length for explanations. By limiting to shorter formulas, we obtain explanations that avoid overfitting but are still reasonably accurate and also, importantly, human interpretable.
AB - We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minimizes the error with respect to the target attribute to be explained. We first provide novel quantitative bounds for the expected error in this scenario. We then also demonstrate how the setting works in practice by studying three concrete data sets. In each case, we calculate explanation formulas of different lengths using an encoding in Answer Set Programming. The most accurate formulas we obtain achieve errors similar to other methods on the same data sets. However, due to overfitting, these formulas are not necessarily ideal explanations, so we use cross validation to identify a suitable length for explanations. By limiting to shorter formulas, we obtain explanations that avoid overfitting but are still reasonably accurate and also, importantly, human interpretable.
U2 - 10.1007/978-3-031-43619-2_7
DO - 10.1007/978-3-031-43619-2_7
M3 - Conference contribution
SN - 978-3-031-43618-5
VL - 14281
T3 - Lecture Notes in Computer Science
SP - 90
EP - 105
BT - Logics in Artificial Intelligence
A2 - Gaggl, Sarah
A2 - Martinez, Maria Vanina
A2 - Ortiz, Magdalena
PB - Springer
T2 - European Conference on Logics in Artificial Intelligence
Y2 - 20 September 2023 through 22 September 2023
ER -