-
-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Yacine IZZA
committed
Jul 25, 2024
1 parent
8e87217
commit fb95851
Showing
1 changed file
with
19 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
--- | ||
Formal abductive explanations offer crucial guarantees of rigor and so find application in high-stakes uses of machine learning (ML). One drawback of abductive explanations is explanation size, justified by the cognitive limits of human decision-makers. Probabilistic abductive explanations (PAXps) address this limitation, but their theoretical and practical complexity makes their exact computation most often unrealistic. This paper proposes novel efficient algorithms for the computation of locally-minimal PXAps, which offer high-quality approximations of PXAps in practice. The experimental results demonstrate the practical efficiency of the proposed algorithms. | ||
" | ||
authors: | ||
- Yacine Izza, | ||
- Kuldeep S Meel, | ||
- Joao Marques-Silva | ||
date: 2024-10-21 00:00:00 | ||
highlight: true | ||
image_preview: '' | ||
math: false | ||
publication: In *Proceedings of ECAI - European Conference on Artificial Intelligence* | ||
publication_types: | ||
- '1' | ||
selected: true | ||
title: 'Locally-Minimal Probabilistic Explanations' | ||
url_pdf: 'https://arxiv.org/pdf/2312.11831' | ||
--- |