DRIFT: Data Selection for LLM Instruction Tuning via On-Policy Attribution
Not on the map. Why?
Abstract (arXiv)
Data selection for instruction tuning is usually studied for efficiency, reaching strong performance with a fraction of the training data. We ask whether data selection can instead raise the performance ceiling, producing a better model than training on all the available data. To test this, we take a large language model (LLM) that has already completed supervised fine-tuning (SFT) on its full corpus and train it further on examples selected from that same corpus. Any gain therefore lifts the model above the ceiling set by full-data training. Existing selection methods yield little or no gain in this setting. We propose DRIFT (Data Refinement via On-Policy Influence Functions for Supervised Fine-Tuning), a data attribution method built on influence functions. DRIFT samples the model's own responses to validation queries and weights them by correctness to form a validation objective. It ranks the examples of the original corpus by their estimated influence on this objective, and the model then continues SFT on the top-ranked subset. This design is motivated by the proximity gap in influence function theory: we hypothesize that these on-policy responses are better validation targets than external references in terms of locality. DRIFT also corrects influence scores for their dependence on gradient norm within each validation task. DRIFT outperforms all evaluated data selection baselines on Olmo3-7B-Instruct-SFT and OpenR1-Distill-7B, raising average accuracy across eight benchmarks from 39.17 to 40.14 and from 57.23 to 58.66, respectively, with gains on benchmarks not used for attribution.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 48 of its 55 references that are in the map. First posted on arXiv 16 Jun 2026.
Builds on
48 of 55 references.
References · 48
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,767
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,332
- 2024OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problemscited by 1,099
- 2023On-Policy Distillation of Language Models: Learning from Self-Generated Mistakescited by 840
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
36 more
- 2019CCNet: Extracting High Quality Monolingual Datasets from Web Crawl Datacited by 544
- 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 514
- 2015Policy Distillationcited by 414
- 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 385
- 2023Beyond Human Data: Scaling Self-Training for Problem-Solving with Language Modelscited by 325
- 2023Data Selection for Language Models via Importance Resamplingcited by 322
- 2023Studying Large Language Model Generalization with Influence Functionscited by 311
- 2023TRAK: Attributing Model Behavior at Scalecited by 273
- 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
- 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 233
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
- 2022Datamodels: Predicting Predictions from Training Datacited by 186
- 2024Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performancecited by 179
- 2024RegMix: Data Mixture as Regression for Language Model Pre-trainingcited by 172
- 2024QuRating: Selecting High-Quality Data for Training Language Modelscited by 153
- 2022If Influence Functions are the Answer, Then What is the Question?cited by 142
- 2025A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforcecited by 141
- 2024Superfiltering: Weak-to-Strong Data Filtering for Fast Instruction-Tuningcited by 134
- 2023DataInf: Efficiently Estimating Data Influence in LoRA-tuned LLMs and Diffusion Modelscited by 121
- 2024DsDm: Model-Aware Dataset Selection with Datamodelscited by 103
- 2024MATES: Model-Aware Data Selection for Efficient Pretraining with Data Influence Modelscited by 96
- 2024What is Your Data Worth to GPT? LLM-Scale Data Valuation with Influence Functionscited by 88
- 2024BM25S: Orders of magnitude faster lexical search via eager sparse scoringcited by 87
- 2025Reinforcement Learning Finetunes Small Subnetworks in Large Language Modelscited by 46
- 2024Harnessing Diversity for Important Data Selection in Pretraining Large Language Modelscited by 34
- 2025Large-Scale Data Selection for Instruction Tuningcited by 34
- 2020Domain2Vec: Domain Embedding for Unsupervised Domain Adaptationcited by 24
- 2025D3: Diversity, Difficulty, and Dependability-Aware Data Selection for Sample-Efficient LLM Instruction Tuningcited by 21
- 2023Revisiting the Fragility of Influence Functionscited by 20
- 2024Do Influence Functions Work on Large Language Models?cited by 20
- 2025Data-Efficient RLVR via Off-Policy Influence Guidancecited by 12
- 2025SampleMix: A Sample-wise Pre-training Data Mixing Strategey by Coordinating Data Quality and Diversitycited by 10
- 2025Influence Functions for Efficient Data Selection in Reasoningcited by 10
- 2025GraSS: Scalable Data Attribution with Gradient Sparsification and Sparse Projectioncited by 8
- 2025IF-GUIDE: Influence Function-Guided Detoxification of LLMscited by 7
- 2025CHIPS: Efficient CLIP Adaptation via Curvature-aware Hybrid Influence-based Data Selectioncited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Mind the Gap: Data Rewriting for Stable Off-Policy Supervised Fine-Tuning
- 2024Disperse-Then-Merge: Pushing the Limits of Instruction Tuning via Alignment Tax Reduction
- 2025Aligning Instruction Tuning with Pre-training
- 2023Self-Evolved Diverse Data Sampling for Efficient Instruction Tuning
- 2025Towards Alignment-Centric Paradigm: A Survey of Instruction Tuning in Large Language Models
- 2025Self-Rewarding PPO: Aligning Large Language Models with Demonstrations Only
- 2026Compatibility-Aware Dynamic Fine-Tuning for Large Language Models
- 2026Large Language Model Post-Training: A Unified View of Off-Policy and On-Policy Learning