Findings of the BabyLM Challenge: Sample-Efficient Pretraining on Developmentally Plausible Corpora (2504.08165v1)
Abstract: Children can acquire language from less than 100 million words of input. LLMs are far less data-efficient: they typically require 3 or 4 orders of magnitude more data and still do not perform as well as humans on many evaluations. These intensive resource demands limit the ability of researchers to train new models and use existing models as developmentally plausible cognitive models. The BabyLM Challenge is a communal effort in which participants compete to optimize LLM training on a fixed data budget. Submissions are compared on various evaluation tasks targeting grammatical ability, downstream task performance, and generalization. Participants can submit to up to three tracks with progressively looser data restrictions. From over 30 submissions, we extract concrete recommendations on how best to train data-efficient LLMs, and on where future efforts should (and perhaps should not) focus. The winning submissions using the LTG-BERT architecture (Samuel et al., 2023) outperformed models trained on trillions of words. Other submissions achieved strong results through training on shorter input sequences or training a student model on a pretrained teacher. Curriculum learning attempts, which accounted for a large number of submissions, were largely unsuccessful, though some showed modest improvements.
- Alex Warstadt (35 papers)
- Aaron Mueller (35 papers)
- Leshem Choshen (78 papers)
- Ethan Wilcox (24 papers)
- Chengxu Zhuang (15 papers)
- Juan Ciro (9 papers)
- Rafael Mosquera (6 papers)
- Bhargavi Paranjape (18 papers)
- Adina Williams (72 papers)
- Tal Linzen (73 papers)
- Ryan Cotterell (226 papers)