CoChat

“Why Should I Trust You?”: Explaining the Predictions of Any Classifier

Open access
Ribeiro, Marco, Singh, Sameer, Guestrin, Carlos · 2016 · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations

The DOI matches its Crossref record; 12 of the 13 references it cites were found in a registry or an index.

Abstract

Despite widespread adoption in NLP, machine learning models remain mostly black boxes.Understanding the reasons behind predictions is, however, quite important in assessing trust in a model.Trust is fundamental if one plans to take action based on a prediction, or when choosing whether or not to deploy a new model.In this work, we describe LIME, a novel explanation technique that explains the predictions of any classifier in an interpretable and faithful manner.We further present a method to explain models by presenting representative individual predictions and their explanations in a non-redundant manner.We propose a demonstration of these ideas on different NLP tasks such as document classification, politeness detection, and sentiment analysis, with classifiers like neural networks and SVMs.The user interactions include explanations of free-form text, challenging users to identify the better classifier from a pair, and perform basic feature engineering to improve the classifiers.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/n16-3020

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

1 more claim about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

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

Show all 12 references

Research works printed but not linked: 3

  1. Cristian Danescu-Niculescu-Mizil, Moritz Sudhof, Dan Jurafsky, Jure Leskovec, and Christopher Potts. 2013. A computational approach to politeness with applica- tion to social factors. In Proceedings of ACL.
  2. Jonathan L. Herlocker, Joseph A. Konstan, and John Riedl. 2000. Explaining collaborative filtering recommenda- tions. In Conference on Computer Supported Coopera- tive Work (CSCW).
  3. Andreas Krause and Daniel Golovin. 2014. Submodu- lar function maximization. In Tractability: Practical Approaches to Hard Problems. Cambridge University Press, February.

Cited by

See all 6,682

Metadata

Authors
Ribeiro, M., Singh, S., & Guestrin, C.
Affiliations
University of Washington (US)
Venue
Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations
Published
2016
Pages
97-101
OpenAlex
W2516809705
Cited by
6,682
References
13
Citations by year
2026: 742 · 2025: 1562 · 2024: 1239 · 2023: 1039 · 2022: 778 · 2021: 581 · 2020: 364 · 2019: 225 · 2018: 109 · 2017: 38 · 2016: 3
FWCI
67.53
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) (publishedVersion, cc-by)
Funders
  • Semiconductor Research Corporation
  • Defense Advanced Research Projects Agency
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
Keywords
lime, explainable AI, classifier interpretability, model trust, local interpretable model-agnostic explanations, feature importance, document classification, sentiment analysis, artificial neural networks, support vector machine, user interaction

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: “Why Should I Trust You?”: Explaining the Predictions of Any Classifier. https://app.cochat.ai/papers/10.18653/v1/n16-3020
The paper
Ribeiro, M., Singh, S., & Guestrin, C. (2016). “Why Should I Trust You?”: Explaining the Predictions of Any Classifier. Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations. https://doi.org/10.18653/v1/n16-3020

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.