REVIEW 2 cited by
Walk the Talk? Measuring the Faithfulness of Large Language Model Explanations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large language models (LLMs) are capable of generating plausible explanations of how they arrived at an answer to a question. However, these explanations can misrepresent the model's "reasoning" process, i.e., they can be unfaithful. This, in turn, can lead to over-trust and misuse. We introduce a new approach for measuring the faithfulness of LLM explanations. First, we provide a rigorous definition of faithfulness. Since LLM explanations mimic human explanations, they often reference high-level concepts in the input question that purportedly influenced the model. We define faithfulness in terms of the difference between the set of concepts that LLM explanations imply are influential and the set that truly are. Second, we present a novel method for estimating faithfulness that is based on: (1) using an auxiliary LLM to modify the values of concepts within model inputs to create realistic counterfactuals, and (2) using a Bayesian hierarchical model to quantify the causal effects of concepts at both the example- and dataset-level. Our experiments show that our method can be used to quantify and discover interpretable patterns of unfaithfulness. On a social bias task, we uncover cases where LLM explanations hide the influence of social bias. On a medical question answering task, we uncover cases where LLM explanations provide misleading claims about which pieces of evidence influenced the model's decisions.
Forward citations
Cited by 2 Pith papers
-
Ensembling LLM-Induced Decision Trees for Explainable and Robust Error Detection
LLM-induced hybrid decision trees (rules + trained graph checks) ensembled via EM detect erroneous table cells with an average 16.1-point F1 gain over the best baseline.
-
Rewrite-to-Rank: Optimizing Ad Visibility via Retrieval-Aware Text Rewriting
PPO-trained rewriting of ads improves retrieval rank and LLM inclusion on a custom ad dataset, measured by two new delta metrics.
Discussion (0). Continue with ORCID to comment.