TY - GEN
T1 - Findings of the BabyLM Challenge
T2 - BabyLM Challenge at the 27th Conference on Computational Natural Language Learning, CoNLL 2023
AU - Warstadt, Alex
AU - Mueller, Aaron
AU - Choshen, Leshem
AU - Wilcox, Ethan
AU - Zhuang, Chengxu
AU - Ciro, Juan
AU - Mosquera, Rafael
AU - Paranjape, Bhargavi
AU - Williams, Adina
AU - Linzen, Tal
AU - Cotterell, Ryan
N1 - Publisher Copyright:
© 2023 Association for Computational Linguistics.
PY - 2023
Y1 - 2023
N2 - Children can acquire language from less than 100 million words of input. Large language models 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 language model 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 language models, 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.
AB - Children can acquire language from less than 100 million words of input. Large language models 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 language model 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 language models, 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.
UR - http://www.scopus.com/inward/record.url?scp=85182769060&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85182769060&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85182769060
T3 - CoNLL 2023 - BabyLM Challenge at the 27th Conference on Computational Natural Language Learning, Proceedings
SP - 1
EP - 34
BT - CoNLL 2023 - BabyLM Challenge at the 27th Conference on Computational Natural Language Learning, Proceedings
A2 - Warstadt, Alex
A2 - Mueller, Aaron
A2 - Choshen, Leshem
A2 - Wilcox, Ethan
A2 - Zhuang, Chengxu
A2 - Ciro, Juan
A2 - Mosquera, Rafael
A2 - Paranjabe, Bhargavi
A2 - Williams, Adina
A2 - Linzen, Tal
A2 - Cotterell, Ryan
PB - Association for Computational Linguistics (ACL)
Y2 - 6 December 2023 through 7 December 2023
ER -