Pith. sign in

REVIEW 3 cited by

Are Pretrained Language Models Symbolic Reasoners Over Knowledge?

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 2006.10413 v2 pith:BSBY2HP3 submitted 2020-06-18 cs.CL

classification cs.CL
keywords factsreasoninglearnplmsknowledgelanguagelearnedmemorization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

How can pretrained language models (PLMs) learn factual knowledge from the training set? We investigate the two most important mechanisms: reasoning and memorization. Prior work has attempted to quantify the number of facts PLMs learn, but we present, using synthetic data, the first study that investigates the causal relation between facts present in training and facts learned by the PLM. For reasoning, we show that PLMs seem to learn to apply some symbolic reasoning rules correctly but struggle with others, including two-hop reasoning. Further analysis suggests that even the application of learned reasoning rules is flawed. For memorization, we identify schema conformity (facts systematically supported by other facts) and frequency as key factors for its success.

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. MALAMUTE: A Multilingual, Highly-granular, Template-free, Education-based Probing Dataset

    cs.CL 2024-12 conditional novelty 7.0 of 10

    MALAMUTE is a 116k-prompt cloze-style dataset derived from 71 university textbooks in three languages, used to probe language models' fine-grained subject knowledge.

  2. The Power of Power Law: Asymmetry Enables Compositional Reasoning

    cs.AI 2026-04 unverdicted novelty 6.0 of 10

    Power-law data sampling creates beneficial asymmetry in the loss landscape that lets models acquire high-frequency skill compositions first, enabling more efficient learning of rare long-tail skills than uniform distr...

  3. Automatic High-quality Verilog Assertion Generation through Subtask-Focused Fine-Tuned LLMs and Iterative Prompting

    cs.AR 2024-11 reject novelty 5.0 of 10

    AssertCraft generates SystemVerilog assertions from specification documents using subtask decomposition, fine-tuned GPT-3.5, and iterative compiler-guided repair, reporting 7.3x more correct assertions than a plain pr...

Pith tools