Back to LLMs Mind Map
中文·English
LLMsID: pretrain-data-engineering

Pre-Training Data Engineering

预训练数据工程
🎯Core Definition
Pre-training data engineering is the pipeline that sets the model's capability ceiling: cleaning → dedup → quality filtering → domain mix → annealing. Mechanism: MinHash+LSH hashes documents into ~128-bit signatures and splits them into bands; colliding buckets are candidate near-duplicate pairs. Quality filtering scores documents by PPL (perplexity) of a pretrained LM; the domain mix blends Web:Code:Math at a set ratio; the annealing phase (last ~5% of tokens) injects high-quality and synthetic data such as Evol-Instruct's iteratively evolved instructions.
💡Use Cases
data pipelines before pretraining, cleaning RLHF preference data, model reproduction and data-ablation analysis.
Key Problems Solved
trillion-scale corpora without dedup cause repeated memorization, wasted compute and benchmark contamination. MinHash+LSH cuts near-duplicate search from O(n2)O(n^2) to near-linear, scaling to trillions of tokens; PPL filtering removes ~30%-50% of low-quality docs; annealing raises the high-quality share above 50%, gaining several points on downstream benchmarks at the same ~1.4T-token compute budget.
🎯5 High-Frequency Exam Points
1
How does MinHash+LSH work? Why is approximate dedup sufficient?
2
How does PPL filtering work? Is low PPL always high quality?
3
How to design the domain mix (Web:Code:Math)? Which capabilities does it shape?
4
What is the annealing phase? Why inject high-quality/synthetic data?
5
Synthetic data (Evol-Instruct etc.) and the contamination risk?
Updated 2026-08-12
🎯
Test Your Knowledge: Practice Questions for "Pre-Training Data Engineering"
Single choice pitfall questions with instant feedback and mistake tracking.
🚀 Start Card Practice
Next CardPre-Training Objectives & Optimizer Details

🔗 More LLMs Knowledge Cards

Agent & Tool CallingAlignment Tax & Preference DataScaled Dot-Product AttentionAttention Variants MHA/MQA/GQA