Pith. sign in

REVIEW 3 cited by

Extractive Structures Learned in Pretraining Enable Generalization on Finetuned Facts

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

arxiv 2412.04614 v3 pith:OONZSFIT submitted 2024-12-05 cs.LG cs.CL

classification cs.LGcs.CL
keywords extractivestructuresfactsgeneralizationimplicationslearnedcomponentsenable
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Pretrained language models (LMs) can generalize to implications of facts that they are finetuned on. For example, if finetuned on ``John Doe lives in Tokyo," LMs can correctly answer ``What language do the people in John Doe's city speak?'' with ``Japanese''. However, little is known about the mechanisms that enable this generalization or how they are learned during pretraining. We introduce extractive structures as a framework for describing how components in LMs (e.g., MLPs or attention heads) coordinate to enable this generalization. The structures consist of informative components that store training facts as weight changes, and upstream and downstream extractive components that query and process the stored information to produce the correct implication. We hypothesize that extractive structures are learned during pretraining when encountering implications of previously known facts. This yields two predictions: a data ordering effect where extractive structures can be learned only if facts precede their implications, and a weight grafting effect where extractive structures can be transferred to predict counterfactual implications. We empirically demonstrate these phenomena in the OLMo-7b, Llama 3-8b, Gemma 2-9b, and Qwen 2-7b models. Of independent interest, our results also indicate that fact learning can occur at both early and late layers, which lead to different forms of generalization.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

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

    cs.CL 2026-07 unverdicted novelty 7.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.

  2. Why Knowing Both Hops Is Not Enough: Understanding Two-Hop Generalization in Language Models

    cs.CL 2026-08 conditional novelty 6.0 of 10

    Two-hop reasoning fails when the second hop is out-of-distribution because upper layers of a transformer are trained to map already-formed representations to outputs rather than reason over them, and a looped architec...

  3. VLMs Can Aggregate Scattered Training Patches

    cs.CV 2025-06 conditional novelty 6.0 of 10

    Open-source VLMs can infer image IDs or safety labels after training only on scattered patches of those images, a capability that can be abused to bypass image moderation.

Pith tools