mlsanityData to 7 Oct 2026

Fact Recall, Heuristics or Pure Guesswork? Precise Interpretations of Language Models for Fact Completion

arXiv 2410.14405 ↗First posted 18 Oct 2024cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

Language models (LMs) can make a correct prediction based on many possible signals in a prompt, not all corresponding to recall of factual associations. However, current interpretations of LMs fail to take this into account. For example, given the query "Astrid Lindgren was born in" with the corresponding completion "Sweden", no difference is made between whether the prediction was based on knowing where the author was born or assuming that a person with a Swedish-sounding name was born in Sweden. In this paper, we present a model-specific recipe - PrISM - for constructing datasets with examples of four different prediction scenarios: generic language modeling, guesswork, heuristics recall and exact fact recall. We apply two popular interpretability methods to the scenarios: causal tracing (CT) and information flow analysis. We find that both yield distinct results for each scenario. Results for exact fact recall and generic language modeling scenarios confirm previous conclusions about the importance of mid-range MLP sublayers for fact recall, while results for guesswork and heuristics indicate a critical role of late last token position MLP sublayers. In summary, we contribute resources for a more extensive and granular study of fact completion in LMs, together with analyses that provide a more nuanced understanding of how LMs process fact-related queries.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 23 of its 38 references that are in the map. First posted on arXiv 18 Oct 2024.

Builds on

23 of 38 references.

References · 23

  1. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  2. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  3. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  4. 2019Language Models as Knowledge Bases?cited by 1,922
  5. 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,103
  6. 2019Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inferencecited by 864
  7. 2022Discovering Latent Knowledge in Language Models Without Supervisioncited by 733
  8. 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 512
  9. 2022Large Language Models Struggle to Learn Long-Tail Knowledgecited by 452
  10. 2020How Can We Know When Language Models Know? On the Calibration of Language Models for Question Answeringcited by 439
  11. 2021Causal Abstractions of Neural Networkscited by 401
  12. 2021Measuring and Improving Consistency in Pretrained Language Modelscited by 361
11 more
  1. 2023Does Localization Inform Editing? Surprising Differences in Causality-Based Localization vs. Knowledge Editing in Language Modelscited by 237
  2. 2019Probing Neural Network Comprehension of Natural Language Argumentscited by 212
  3. 2024Don't Hallucinate, Abstain: Identifying LLM Knowledge Gaps via Multi-LLM Collaborationcited by 176
  4. 2021Knowledgeable or Educated Guess? Revisiting Language Models as Knowledge Basescited by 107
  5. 2019E-BERT: Efficient-Yet-Effective Entity Embeddings for BERTcited by 96
  6. 2024Hopping Too Late: Exploring the Limitations of Large Language Models on Multi-Hop Queriescited by 78
  7. 2022Understanding Transformer Memorization Recall Through Idiomscited by 62
  8. 2023Knowing What LLMs DO NOT Know: A Simple Yet Effective Self-Detection Methodcited by 51
  9. 2023A Glitch in the Matrix? Locating and Detecting Language Model Grounding with Fakepediacited by 24
  10. 2024LLMs' Reading Comprehension Is Affected by Parametric Knowledge and Struggles with Hypothetical Statementscited by 12
  11. 2024Defining Knowledge: Bridging Epistemology and Large Language Modelscited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.