ZPD Detector: Data Selection via Capability-Difficulty Alignment for Large Language Models
On the map: LLM alignment / RLHF / preference optimisation → LLM preference optimization methods
Abstract (arXiv)
As the cost of training large language models continues to increase and high-quality training data become increasingly scarce, selecting high-value samples or synthesizing effective training data under limited data budgets has emerged as a critical research problem. Most existing data selection methods rely on static criteria, such as difficulty, uncertainty, or heuristics, and fail to model the evolving relationship between the model and the data. Inspired by the educational theory of the Zone of Proximal Development (ZPD), we propose ZPD Detector, a data selection framework that adopts a bidirectional perspective between models and data by explicitly modeling the alignment between sample difficulty and the model's current capability. ZPD Detector integrates difficulty calibration, model capability estimation based on Item Response Theory (IRT), and a capability-difficulty matching score to dynamically identify the most informative samples at each learning stage, improving data utilization efficiency; moreover, this dynamic matching strategy provides new insights into training strategy design. All code and data will be released after our work be accepted to support reproducible researc
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in LLM preference optimization methods, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 16 of its 33 references that are in the map. First posted on arXiv 16 Jan 2026.
Builds on
16 of 33 references.
Closest ancestors · 2
Same direction, newest first
- 2025IDEAL: Data Equilibrium Adaptation for Multi-Capability Language Model Alignment19 May
- 2025Principled Data Selection for Alignment: The Hidden Risks of Difficult Examples11 Feb
Other references · 14
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2020What Disease does this Patient Have? A Large-scale Open Domain Question Answering Dataset from Medical Examscited by 1,356
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2023Data Selection for Language Models via Importance Resamplingcited by 329
- 2023From Quantity to Quality: Boosting LLM Performance with Self-Guided Data Selection for Instruction Tuningcited by 307
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
- 2017Teacher-Student Curriculum Learningcited by 210
- 2019Dynamic Curriculum Learning for Imbalanced Data Classificationcited by 93
- 2022Training Trajectories of Language Models Across Scalescited by 81
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026PPL-Factory: Task-Aware and Budget-Aware Data Selection from Language Modeling to Reasoning
- 2025LEAD: Iterative Data Selection for Efficient LLM Instruction Tuning
- 2024Take the essence and discard the dross: A Rethinking on Data Selection for Fine-Tuning Large Language Models
- 2024How to Train Data-Efficient LLMs
- 2024Rethinking Data Selection at Scale: Random Selection is Almost All You Need
- 2025Rethinking Data Mixture for Large Language Models: A Comprehensive Survey and New Perspectives
- 2025Holdout-Loss-Based Data Selection for LLM Finetuning via In-Context Learning
- 2025Estimating problem difficulty without ground truth using Large Language Model comparisons