ResearchTrend.AI
ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations

ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations

Ryma Boumazouza
Fahima Cheikh
Bertrand Mazure
Karim Tabia
ArXivPDFHTML

Papers citing "ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations"

12 / 12 papers shown
Title
Axiomatic Characterisations of Sample-based Explainers
Axiomatic Characterisations of Sample-based Explainers
Leila Amgoud
Martin Cooper
Salim Debbaoui
FAtt
47
1
0
09 Aug 2024
A New Class of Explanations for Classifiers with Non-Binary Features
A New Class of Explanations for Classifiers with Non-Binary Features
Chunxi Ji
Adnan Darwiche
FAtt
34
3
0
28 Apr 2023
Finding Minimum-Cost Explanations for Predictions made by Tree Ensembles
Finding Minimum-Cost Explanations for Predictions made by Tree Ensembles
John Törnblom
Emil Karlsson
Simin Nadjm-Tehrani
FAtt
64
0
0
16 Mar 2023
HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
Yongqian Li
Xinyan Chen
Wenxuan Guo
Xijun Li
Wanqian Luo
Jun Huang
Hui-Ling Zhen
M. Yuan
Junchi Yan
35
17
0
04 Feb 2023
VeriX: Towards Verified Explainability of Deep Neural Networks
VeriX: Towards Verified Explainability of Deep Neural Networks
Min Wu
Haoze Wu
Clark W. Barrett
AAML
53
11
0
02 Dec 2022
Feature Necessity & Relevancy in ML Classifier Explanations
Feature Necessity & Relevancy in ML Classifier Explanations
Xuanxiang Huang
Martin C. Cooper
António Morgado
Jordi Planes
Sasha Rubin
FAtt
38
18
0
27 Oct 2022
Logic-Based Explainability in Machine Learning
Logic-Based Explainability in Machine Learning
Sasha Rubin
LRM
XAI
57
39
0
24 Oct 2022
On Computing Relevant Features for Explaining NBCs
On Computing Relevant Features for Explaining NBCs
Yacine Izza
Sasha Rubin
41
5
0
11 Jul 2022
Eliminating The Impossible, Whatever Remains Must Be True
Eliminating The Impossible, Whatever Remains Must Be True
Jinqiang Yu
Alexey Ignatiev
Peter J. Stuckey
Nina Narodytska
Sasha Rubin
32
23
0
20 Jun 2022
On Tackling Explanation Redundancy in Decision Trees
On Tackling Explanation Redundancy in Decision Trees
Yacine Izza
Alexey Ignatiev
Sasha Rubin
FAtt
48
59
0
20 May 2022
Provably Precise, Succinct and Efficient Explanations for Decision Trees
Provably Precise, Succinct and Efficient Explanations for Decision Trees
Yacine Izza
Alexey Ignatiev
Nina Narodytska
Martin C. Cooper
Sasha Rubin
FAtt
40
7
0
19 May 2022
Don't Lie to Me! Robust and Efficient Explainability with Verified Perturbation Analysis
Don't Lie to Me! Robust and Efficient Explainability with Verified Perturbation Analysis
Thomas Fel
Mélanie Ducoffe
David Vigouroux
Rémi Cadène
Mikael Capelle
C. Nicodeme
Thomas Serre
AAML
28
41
0
15 Feb 2022