Selecting a suitable pretraining dataset is crucial for both general-domain (e.g., GPT-3)  and domain-specific (e.g., Codex)  language models (LMs) . We formalize this problem as selecting a subset of a large raw unlabeled dataset to match a desired target distribution given unlabeled target samples. Due to the scale and dimensionality of the raw text data, existing methods use simple heuristics or require human experts to manually curate data. Instead, we extend the classic importance resampling approach used in low-dimensions for LM data selection. We proposeData Selection with Importance Resampling (DSIR) , an efficient and scalable framework that estimates importance weights in a reduced feature space for tractability and selects data with importance resampling according to these weights.
We instantiate the DSIR framework with hashed n-gram features for efficiency, enabling the selection of 100M documents from the full Pile dataset in 4.5 hours.
To measure whether hashed n-gram features preserve the aspects of the data that are relevant to the target, we defineKL reduction, a data metric that measures the proximity between the selected pretraining data and the target on some feature space.
Across 8 data selection methods (including expert selection) , KL reduction on hashed n-gram features highly correlates with average downstream accuracy () .
When selecting data for continued pretraining on a specific domain, DSIR performs comparably to expert curation across 8 target distributions.
When pretraining general-domain models (target is Wikipedia and books) , DSIR improves over random selection and heuristic filtering baselines by 2–2.5% on the GLUE benchmark.111Code, selected data, and pretrained models are available athttps://github.com/p-lambda/dsir.