mlsanityData to 7 Oct 2026

Large GPT-like Models are Bad Babies: A Closer Look at the Relationship between Linguistic Competence and Psycholinguistic Measures

arXiv 2311.04547 ↗First posted 8 Nov 2023cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

Research on the cognitive plausibility of language models (LMs) has so far mostly concentrated on modelling psycholinguistic response variables such as reading times, gaze durations and N400/P600 EEG signals, while mostly leaving out the dimension of what Mahowald et al. (2023) described as formal and functional linguistic competence, and developmental plausibility. We address this gap by training a series of GPT-like language models of different sizes on the strict version of the BabyLM pretraining corpus, evaluating on the challenge tasks (BLiMP, GLUE, MSGS) and an additional reading time prediction task. We find a positive correlation between LM size and performance on all three challenge tasks, with different preferences for model width and depth in each of the tasks. In contrast, a negative correlation was found between LM size and reading time fit of linear mixed-effects models using LM surprisal as a predictor, with the second-smallest LM achieving the largest log-likelihood reduction over a baseline model without surprisal. This suggests that modelling processing effort and linguistic competence may require an approach different from training GPT-like LMs on a developmentally plausible corpus.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 26 of its 53 references that are in the map. First posted on arXiv 8 Nov 2023.

Builds on

26 of 53 references.

References · 26

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2020Scaling Laws for Neural Language Modelscited by 6,411
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  4. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  5. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  6. 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
  7. 2018Neural Network Acceptability Judgmentscited by 952
  8. 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 553
  9. 2020On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselinescited by 254
  10. 2020Experience Grounds Languagecited by 241
  11. 2020A Systematic Assessment of Syntactic Generalization in Neural Language Modelscited by 163
  12. 2022Adapting Pre-trained Language Models to African Languages via Multilingual Adaptive Fine-Tuningcited by 149
14 more
  1. 2022Lifting the Curse of Multilinguality by Pre-training Modular Transformerscited by 145
  2. 2020On the Predictive Power of Neural Language Models for Human Real-Time Comprehension Behaviorcited by 115
  3. 2022Why Does Surprisal From Larger Transformer-Based Language Models Provide a Poorer Fit to Human Reading Times?cited by 111
  4. 2020When Do You Need Billions of Words of Pretraining Data?cited by 104
  5. 2023To Repeat or Not To Repeat: Insights from Scaling LLM under Token-Crisiscited by 88
  6. 2020Shortformer: Better Language Modeling using Shorter Inputscited by 76
  7. 2021Lower Perplexity is Not Always Human-Likecited by 52
  8. 2017The Natural Stories Corpuscited by 40
  9. 2022Context Limitations Make Neural Language Models More Human-Likecited by 32
  10. 2022Syntactic Surprisal From Neural Models Predicts, But Underestimates, Human Processing Difficulty From Syntactic Ambiguitiescited by 30
  11. 2022When classifying grammatical role, BERT doesn't care about word order... except when it matterscited by 24
  12. 2016Modeling Human Reading with Neural Attentioncited by 10
  13. 2019Tracking Naturalistic Linguistic Predictions with Deep Neural Language Modelscited by 9
  14. 2022Garden-Path Traversal in GPT-2cited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 5; 2026: 1.

11 papers.