Pith. sign in

REVIEW 48 cited by

The Reversal Curse: LLMs trained on "A is B" fail to learn "B is A"

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 2309.12288 v4 pith:VQI3MMGE submitted 2023-09-21 cs.CL cs.AIcs.LG

Lukas Berglund , Meg Tong , Max Kaufmann , Mikita Balesni , Asa Cooper Stickland , Tomasz Korbak , Owain Evans This is my paper
classification cs.CLcs.AIcs.LG
keywords cursereversalmodelanswermodelsreversetrainedwill
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We expose a surprising failure of generalization in auto-regressive large language models (LLMs). If a model is trained on a sentence of the form "A is B", it will not automatically generalize to the reverse direction "B is A". This is the Reversal Curse. For instance, if a model is trained on "Valentina Tereshkova was the first woman to travel to space", it will not automatically be able to answer the question, "Who was the first woman to travel to space?". Moreover, the likelihood of the correct answer ("Valentina Tershkova") will not be higher than for a random name. Thus, models do not generalize a prevalent pattern in their training set: if "A is B" occurs, "B is A" is more likely to occur. It is worth noting, however, that if "A is B" appears in-context, models can deduce the reverse relationship. We provide evidence for the Reversal Curse by finetuning GPT-3 and Llama-1 on fictitious statements such as "Uriah Hawthorne is the composer of Abyssal Melodies" and showing that they fail to correctly answer "Who composed Abyssal Melodies?". The Reversal Curse is robust across model sizes and model families and is not alleviated by data augmentation. We also evaluate ChatGPT (GPT-3.5 and GPT-4) on questions about real-world celebrities, such as "Who is Tom Cruise's mother? [A: Mary Lee Pfeiffer]" and the reverse "Who is Mary Lee Pfeiffer's son?". GPT-4 correctly answers questions like the former 79% of the time, compared to 33% for the latter. Code available at: https://github.com/lukasberglund/reversal_curse.

Discussion (0). Sign in to comment.

Forward citations

Cited by 48 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Large Language Diffusion Models

    cs.CL 2025-02 unverdicted novelty 8.0 of 10

    LLaDA is a scalable diffusion-based language model that matches autoregressive LLMs like LLaMA3 8B on tasks and surpasses GPT-4o on reversal poem completion.

  2. Emergent Misalignment Recruits a Pre-existing Persona Subspace

    cs.LG 2026-07 conditional novelty 7.0 of 10

    Fine-tuning on narrow bad data recruits a low-rank persona subspace already present in a frozen instruction-tuned model; holding that subspace out of activations prevents broad misalignment, and injecting it into the ...

  3. Can a Language Model Learn Facts Continually in Its Weights?

    cs.CL 2026-07 conditional novelty 7.0 of 10

    Facts written into LLM weights are stored but question-keyed; broad data creates usable knowledge while later writes destroy access rather than storage, leaving context more reliable than weights for composition and r...

  4. DiscoLoop: Looping Discrete Embeddings and Continuous Hidden States for Multi-hop Reasoning

    cs.CL 2026-07 conditional novelty 7.0 of 10

    DiscoLoop adds a decoded token-embedding channel to looped transformers, fixing a representation mismatch that limited implicit multi-hop reasoning and improving OOD generalization.

  5. Autoregressive Boltzmann Generators

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    ArBG replaces flow-based methods with autoregressive models for Boltzmann sampling, showing gains on peptide benchmarks and a 132M-parameter model Robin cutting zero-shot energy error by over 60% on 8-residue systems.

  6. A Type Theory of Sense: Witnessed Choice in Stratified Semantic Spaces

    cs.LO 2026-06 unverdicted novelty 7.0 of 10

    Introduces TTS, a dependent type theory replacing global canonical composition with regime-indexed indiscernibility and constructive apartness, proving conservativity, provenance, no-fork-from-empty, and persistence o...

  7. Can we trust LLM Self-Explanations for Entity Resolution?

    cs.DB 2026-05 unverdicted novelty 7.0 of 10

    LLM self-explanations for entity resolution are unstable and weakly faithful to causal evidence, but a hybrid framework using them as priors matches post-hoc quality at up to 10x lower cost.

  8. Adaptive Order Policies for Masked Diffusion

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    A policy network learns to choose unmasking order in masked diffusion by reweighting the loss, outperforming random and heuristic baselines on ordering-sensitive tasks.

  9. MeMo: Memory as a Model

    cs.CL 2026-05 unverdicted novelty 7.0 of 10

    MeMo encodes new knowledge into a separate memory model for frozen LLMs, achieving strong performance on BrowseComp-Plus, NarrativeQA, and MuSiQue while capturing cross-document relationships and remaining robust to r...

  10. Masked Diffusion Language Models are Strong and Steerable Text-Based World Models for Agentic RL

    cs.AI 2026-05 conditional novelty 7.0 of 10

    Masked diffusion language models, not larger autoregressive LLMs, are the better building block for text-based world models in agentic RL, improving rollout fidelity, diversity, and downstream task success.

  11. Can Gradient Descent Simulate Prompting?

    cs.CL 2025-06 conditional novelty 7.0 of 10

    A MAML-style meta-training objective makes a single gradient step on new text recover part of the performance that prompting achieves, on reversal-curse and passage-QA tasks.

  12. Your Absorbing Discrete Diffusion Secretly Models the Conditional Distributions of Clean Data

    cs.LG 2024-06 conditional novelty 7.0 of 10

    Absorbing discrete diffusion models the conditional distributions of clean data; reparameterizing yields a time-independent RADD that unifies with AO-ARMs and reaches SOTA perplexity among diffusion models on zero-sho...

  13. Hierarchical Domain Generalization

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Over infinite domains, hierarchy-uniform domain generalization is impossible for every nontrivial hypothesis class; a length-generalization bound is a property of the length hierarchy, not a hierarchy-free guarantee.

  14. Can a Language Model Learn Facts Continually in Its Weights?

    cs.CL 2026-07 unverdicted novelty 6.0 of 10

    Weight writes create question-keyed knowledge that later sequential writes redirect, so context—not weights—is the reliable channel for facts that must survive or be composed.

  15. Compositionality Emerges in a Narrow Depth-Connectivity Regime: Architecture Constraints and Solution Manifolds

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    Compositionality emerges in neural networks only in a narrow depth-connectivity regime, with gradient descent converging to fractured solutions outside it.

  16. Normative Robustness as a Frontier for Non-Verifiable Reasoning in LLMs

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    Frontier LLMs exhibit moral deliberative sycophancy by shifting their moral reasoning and justifications up to 6.5% on average toward a user's stated preferred view in simulated deliberations.

  17. MARD: Mirror-Augmented Reasoning Distillation for Mechanism-Level Drug-Drug Interaction Prediction

    cs.CL 2026-06 unverdicted novelty 6.0 of 10

    MARD-7B outperforms baselines and GPT-4o on novel drug pairs for mechanism-level DDI prediction via a new distillation pipeline with verifiable process rewards and releases all resources.

  18. "I've Seen How This Goes": Characterizing Diversity via Progressive Conditional Surprise

    cs.CL 2026-06 unverdicted novelty 6.0 of 10

    Decan (D_Ca_n = C × a_n) measures text diversity as progressive conditional surprise from base LM log-probabilities, scoring 0.846 OCA on McDiv benchmark and detecting monotonic diversity drop across base→SFT→DPO→RLVR stages.

  19. Continuous Latent Diffusion Language Model

    cs.CL 2026-05 unverdicted novelty 6.0 of 10

    Cola DLM proposes a hierarchical latent diffusion model that learns a text-to-latent mapping, fits a global semantic prior in continuous space with a block-causal DiT, and performs conditional decoding, establishing l...

  20. Trace Mutation in Human-LLM Dialogue: The Transcript as Forensic and Mitigation Surface

    cs.HC 2026-03 unverdicted novelty 6.0 of 10

    Trace mutations are a class of context failures in LLM conversations consisting of utterance effacement and genitive dissociation that distort the shared record while resisting ordinary repair.

  21. The Illusion of Latent Generalization: Bi-directionality and the Reversal Curse

    cs.CL 2026-03 unverdicted novelty 6.0 of 10

    Bidirectional objectives mitigate reversal by requiring explicit source-as-target signals and storing directions as distinct representations instead of inducing latent generalization.

  22. DeFrame: Debiasing Large Language Models Against Framing Effects

    cs.CL 2026-02 conditional novelty 6.0 of 10

    LLM fairness scores shift substantially with positive vs negative framing of the same question, and DeFrame—a three-step self-revision prompt—reduces both average bias and this framing gap.

  23. Breaking the Reversal Curse in Autoregressive Language Models via Identity Bridge

    cs.AI 2026-02 conditional novelty 6.0 of 10

    Identity-bridge regularization, rephrased into an out-of-context reasoning form, yields ~40% reversal accuracy in a 1B LLM and provably fixes reversal in an idealized one-layer transformer.

  24. NarrativeTrack: Evaluating Entity-Centric Reasoning for Narrative Understanding

    cs.CV 2026-01 conditional novelty 6.0 of 10

    A new video benchmark probes whether multimodal LLMs can track the same person across scene changes, outfit changes, and lookalikes; most models fail, exposing a split between perceptual grounding and temporal reasoning.

  25. NarrativeTrack: Evaluating Entity-Centric Reasoning for Narrative Understanding

    cs.CV 2026-01 conditional novelty 6.0 of 10

    NarrativeTrack shows that video AI models, including GPT-4o, falter at tracking a specific person across scene changes, outfit changes, and similar-looking characters in long videos.

  26. Conflict-Aware Fusion: Mitigating Logic Inertia in Large Language Models via Structured Cognitive Priors

    cs.AI 2025-12 unverdicted novelty 6.0 of 10 partial

    Conflict-Aware Fusion mitigates Logic Inertia in LLMs through a four-stage pipeline of SFT, DPO, logical invariance regularization, and reinforcement learning from a symbolic oracle, saturating four stress tests on ru...

  27. The SuperActivator Mechanism: Transformers Concentrate Reliable Concept Signals in the Tail

    cs.LG 2025-12 conditional novelty 6.0 of 10

    Reliable concept presence in transformers is concentrated in the extreme high-activation tail of in-concept tokens; thresholding that tail improves concept detection and localization.

  28. Orchestrating Dual-Boundaries: An Arithmetic Intensity Inspired Acceleration Framework for Diffusion Language Models

    cs.CL 2025-11 conditional novelty 6.0 of 10

    ODB-dLLM accelerates diffusion LLM inference by adaptively shortening responses and using a jump-share speculative decoding strategy, achieving 2.6-6.3x over Fast-dLLM.

  29. Diffusion-Inspired Masked Fine-Tuning for Knowledge Injection in Autoregressive LLMs

    cs.CL 2025-10 conditional novelty 6.0 of 10

    A mask-and-reconstruct fine-tuning objective lets autoregressive LLMs inject new knowledge without paraphrases and largely removes the reversal curse.

  30. Diffusion-Inspired Masked Fine-Tuning for Knowledge Injection in Autoregressive LLMs

    cs.CL 2025-10 unverdicted novelty 6.0 of 10

    Masked fine-tuning enables autoregressive LLMs to inject new factual knowledge without paraphrases and with reversal-curse resistance, matching diffusion LLM advantages on QA tasks.

  31. Energy-Based Transformers are Scalable Learners and Thinkers

    cs.LG 2025-07 conditional novelty 6.0 of 10

    Energy-Based Transformers learn to predict by gradient-descent minimization of a learned energy function, and the paper reports faster pretraining scaling and inference-time thinking gains over Transformer++ and Diffu...

  32. Potemkin Understanding in Large Language Models

    cs.CL 2025-06 conditional novelty 6.0 of 10

    LLMs frequently pass definition questions yet fail to use the same concepts in classification, generation, and editing tasks, a gap the authors call potemkin understanding.

  33. Argumentative Large Language Models for Explainable and Contestable Claim Verification

    cs.CL 2024-05 unverdicted novelty 6.0 of 10

    ArgLLMs build argumentation frameworks from LLMs to support explainable and contestable formal reasoning for claim verification.

  34. LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code

    cs.SE 2024-03 unverdicted novelty 6.0 of 10

    LiveCodeBench collects 400 recent contest problems to create a contamination-free benchmark evaluating LLMs on code generation and related capabilities like self-repair and execution.

  35. DiscoLoop: Looping Discrete Embeddings and Continuous Hidden States for Multi-hop Reasoning

    cs.CL 2026-07 unverdicted novelty 5.0 of 10

    DiscoLoop adds a discrete embedding channel to looped transformers to fix representational misalignment in two-hop reasoning, yielding near-perfect accuracy on synthetic tasks and better pretraining loss on real data.

  36. Dynamic-dLLM: Dynamic Cache-Budget and Adaptive Parallel Decoding for Training-Free Acceleration of Diffusion LLM

    cs.CL 2026-05 unverdicted novelty 5.0 of 10

    Dynamic-dLLM achieves over 3x average inference speedup on dLLMs like LLaDA-8B via adaptive cache budgets and decoding thresholds while preserving benchmark performance.

  37. MeMo: Memory as a Model

    cs.CL 2026-05 unverdicted novelty 5.0 of 10

    MeMo encodes new knowledge into a separate memory model that integrates with frozen LLMs, showing strong performance on QA benchmarks while avoiding catastrophic forgetting and working without access to model weights.

  38. Absurd World: A Simple Yet Powerful Method to Absurdify the Real-world for Probing LLM Reasoning Capabilities

    cs.AI 2026-05 unverdicted novelty 5.0 of 10

    Absurd World automatically converts real-world problems into absurd yet logically coherent scenarios to test whether LLMs can reason without depending on familiar patterns.

  39. Dynamics Reveals Structure: Challenging the Linear Propagation Assumption

    cs.LG 2026-01 conditional novelty 5.0 of 10

    Under the linear propagation assumption, first-order feature geometry cannot support both negation and composition: the only feature map satisfying both is the zero map.

  40. Reinforcement Learning Improves Traversal of Parametric Knowledge in LLMs

    cs.CL 2025-11 reject novelty 5.0 of 10

    Reasoning LLMs seem better at retrieving hierarchical facts not because they know more but because they navigate better; the key supporting RL experiment is missing from the paper.

  41. Noise or Nuance: An Investigation Into Useful Information and Filtering For LLM Driven AKBC

    cs.CL 2025-09 conditional novelty 5.0 of 10

    In a no-retrieval, no-fine-tuning setting, LLM-provided hints, self-judging filters, and regex-based parsing substantially change triple completion quality, with the judge filter roughly doubling F1.

  42. SymbolicThought: Integrating Language Models and Symbolic Reasoning for Consistent and Interpretable Human Relationship Understanding

    cs.CL 2025-07 reject novelty 5.0 of 10

    A human-in-the-loop system that adds logical rules and an interactive interface to LLM-based character relationship extraction, improving recall and cutting annotation time.

  43. A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions

    cs.CL 2023-11 unverdicted novelty 5.0 of 10

    The paper surveys hallucination in LLMs with an innovative taxonomy, factors, detection methods, benchmarks, mitigation strategies, and open research directions.

  44. PlanE: Meta Planning of Data, Tuning, and Inference for Extractive-based LLMs

    cs.AI 2026-05 conditional novelty 4.0 of 10

    A quadratic meta-planner trained on a few model-dataset runs selects the optimal data-tuning-inference configuration for extractive LLMs, matching grid search on three IE tasks.

  45. Measuring AI Reasoning: A Guide for Researchers

    cs.AI 2026-05 unverdicted novelty 4.0 of 10

    Reasoning in language models should be measured by the faithfulness and validity of their multi-step search processes and intermediate traces, not final-answer accuracy.

  46. Conflict-Aware Fusion: Mitigating Logic Inertia in Large Language Models via Structured Cognitive Priors

    cs.AI 2025-12 conditional novelty 4.0 of 10

    A verification-before-deduction SFT+DPO training recipe lifts accuracy on contradictory rule sets from 0% to 100% on a synthetic benchmark.

  47. Adversarial Activation Patching: A Framework for Detecting and Mitigating Emergent Deception in Safety-Aligned Transformers

    cs.LG 2025-07 reject novelty 4.0 of 10

    A framework that borrows activation patching to adversarially induce and measure deception, supported only by an underspecified toy network simulation.

  48. Prompting as Scientific Inquiry

    cs.CL 2025-06 conditional novelty 4.0 of 10

    Position paper arguing that prompting LLMs is a form of behavioral science and should be recognized as a core scientific method alongside mechanistic interpretability.

Pith tools