A model explanation system
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We propose a new methodology for explaining the predictions of black box classifiers. We use the motivating paradigm that predictive performance is of primary importance but human analysts (e.g., in fraud detection) desire a classifier's predictions to be augmented with useful explanations. To be truly general and principled, we derive a scoring system for finding explanations based on formal requirements. In this system, the explanations are assumed to take the form of simple logical statements. We derive an efficient Monte Carlo algorithm to find explanations for black box classifiers with finite sample guarantees. The methodology is then applied to interesting examples in facial recognition and credit data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Survey and critique of techniques for extracting rules from trained artificial neural networks
Andrews, R., Diederich, J., & Tickle, A. B. (1995) · Knowledge-Based Systems · doi:10.1016/0950-7051(96)81920-4 · Cited by 1,225
Comprehensible credit scoring models using rule extraction from support vector machines
Martens, D., Baesens, B., Van Gestel, T., & Vanthienen, J. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.04.051 · Cited by 448 · cited 1×
“Analogous scenarios occur in computer vision [10], credit risk [8], spam detection [6], etc.”
BackgroundA peek into the black box: exploring classifiers by randomization
Henelius, A., Puolamäki, K., Boström, H., Asker, L., & Papapetrou, P. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0368-8 · Cited by 98
Research works printed but not linked: 7
- tibshirani, 1996, Regression shrinkage and selection via the lasso, JRSSB, 58, 267, 10.1111/j.2517-6161.1996.tb02080.x · DOI · Paper page
- zeiler, 2014, Visualizing and understanding convolutional networks, ECCV, 818
- 10.1214/aop/1176990746 · DOI · Paper page
- andrew, 2002, On discriminative vs. generative classifiers: A comparison of logistic regression and naive Bayes, NIPS, 841
- 10.1007/BF00116251 · DOI · Paper page
- peter, 2006, Convexity, classification, and risk bounds, JASA, 101
- gelman, 1996, Posterior predictive assessment of model fitness via realized discrepancies, Statistica Sinica, 6, 733
Cited by
Interpretable Explanations of Black Boxes by Meaningful Perturbation
Fong, R. C., & Vedaldi, A. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.371 · Cited by 1,097
A Survey on the Explainability of Supervised Machine Learning
Burkart, N., & Huber, M. F. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12228 · Cited by 1,008
Trustworthy Artificial Intelligence: A Review
Kaur, D., Uslu, S., Rittichier, K. J., & Durresi, A. (2023) · ACM Computing Surveys · doi:10.1145/3491209 · Cited by 709
“Other researchers [196] proposed a similar approach that provides explanations based on the formal requirements using the Monte Carlo algorithm.”
MethodAnalysis of Explainers of Black Box Deep Neural Networks for Computer Vision: A Survey
Buhrmester, V., Münch, D., & Arens, M. (2021) · Machine Learning and Knowledge Extraction · doi:10.3390/make3040048 · Cited by 403
Towards better analysis of machine learning models: A visual analytics perspective
Liu, S., Wang, X., Liu, M., & Zhu, J. (2017) · Visual Informatics · doi:10.1016/j.visinf.2017.01.006 · Cited by 397
Metadata
- Authors
- Turner, R.
- Venue
- 2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP)
- Publisher
- IEEE
- Published
- 2016-09
- Pages
- 1-6
- OpenAlex
- W2556340658
- Cited by
- 75
- References
- 3
- FWCI
- 6.35
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.