Provably efficient, succinct, and precise explanations

1 November 2021

Papers citing "Provably efficient, succinct, and precise explanations"

10 / 10 papers shown

Title
Probabilistic Stability Guarantees for Feature Attributions Helen Jin Anton Xue Weiqiu You Surbhi Goel Eric Wong 27 0 0 18 Apr 2025
Anytime Approximate Formal Feature Attribution Jinqiang Yu Graham Farr Alexey Ignatiev Peter J. Stuckey 24 2 0 12 Dec 2023
Robust Explanation Constraints for Neural Networks Matthew Wicker Juyeon Heo Luca Costabello Adrian Weller FAtt 26 17 0 16 Dec 2022
Feature Necessity & Relevancy in ML Classifier Explanations Xuanxiang Huang Martin C. Cooper António Morgado Jordi Planes Sasha Rubin FAtt 30 18 0 27 Oct 2022
Logic-Based Explainability in Machine Learning Sasha Rubin LRM XAI 44 39 0 24 Oct 2022
On Computing Relevant Features for Explaining NBCs Yacine Izza Sasha Rubin 28 5 0 11 Jul 2022
Eliminating The Impossible, Whatever Remains Must Be True Jinqiang Yu Alexey Ignatiev Peter J. Stuckey Nina Narodytska Sasha Rubin 14 23 0 20 Jun 2022
Cardinality-Minimal Explanations for Monotonic Neural Networks Ouns El Harzli Bernardo Cuenca Grau Ian Horrocks FAtt 38 5 0 19 May 2022
Born-Again Tree Ensembles Thibaut Vidal Toni Pacheco Maximilian Schiffer 62 53 0 24 Mar 2020
Towards A Rigorous Science of Interpretable Machine Learning Finale Doshi-Velez Been Kim XAI FaML 251 3,684 0 28 Feb 2017