MétaCan
Menu
Back to cohort

Is Child-Directed Speech Effective Training Data for Language Models?

2024· article· en· W4404782836 on OpenAlexfundno aff
Steven Y. Feng, Noah D. Goodman, Michael C. Frank

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSpeech Recognition and Synthesis
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceTraining (meteorology)Speech recognitionTraining setLanguage modelNatural language processingArtificial intelligence

Abstract

fetched live from OpenAlex

While high-performing language models are typically trained on hundreds of billions of words, human children become fluent language users with a much smaller amount of data.What are the features of the data they receive, and how do these features support language modeling objectives?To investigate this question, we train GPT-2 and RoBERTa models on 29M words of English child-directed speech and a new matched, synthetic dataset (TinyDialogues), comparing to OpenSubtitles, Wikipedia, and a heterogeneous blend of datasets from the BabyLM challenge.We evaluate the syntactic and semantic knowledge of these models using developmentallyinspired evaluations.Through pretraining experiments, we test whether the global developmental ordering or the local discourse ordering of children's training data supports high performance relative to other datasets.The local properties of the data affect model results, but surprisingly, global properties do not.Further, child language input is not uniquely valuable for training language models.These findings support the hypothesis that, rather than proceeding from better data, the child's learning algorithm is substantially more data-efficient than current language modeling techniques.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.022
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.006
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.022
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.003
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.004

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.079
GPT teacher head0.317
Teacher spread0.238 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicSpeech Recognition and SynthesisFrench-language works237,207