Bilevel Data Curation for LLM Fine-tuning: Offline Selection and Online Self-Refining Generation
Not on the map. Why?
Abstract (arXiv)
Supervised fine-tuning (SFT) datasets are critical to the downstream performance of large language models, yet they often contain low-quality or harmful question-response pairs. To improve SFT data quality, we develop a unified bilevel framework that combines offline data selection with the online self-refining generation. In the offline setting, bilevel data selection (BDS) selects question-response pairs from the offline SFT dataset to maximize the validation performance. We theoretically show that the optimal model given by BDS outperforms direct data mixing approach in useful data coverage. Moreover, we provide a global convergence analysis for gradient-based BDS approach for one-layer Transformer, showing that the epsilon-global optimum of offline BDS is achievable in finite time. Although efficient, offline BDS discards potentially harmful questions together with responses, thereby reducing question diversity. We address this limitation by refining the responses to selected questions using online self-refining generation framework. However, BDS is inefficient to update the response weights when responses are regenerated online. To address this issue, we introduce bilevel multi-objective optimization (BMO) for response-level weighting. We show that BMO recovers the same validation-aligned solution as BDS, but admits a closed-form importance-ratio weight that adapts to regenerated responses. Experiments on LLM quality enhancement and safety-aware fine-tuning demonstrate that the proposed framework consistently improves both data quality and downstream fine-tuning performance.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 71 of its 93 references that are in the map. First posted on arXiv 26 Nov 2025.
Builds on
71 of 93 references.
References · 71
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
- 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,720
- 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,724
- 2021Convex optimizationcited by 2,515
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
- 2019Self-training with Noisy Student improves ImageNet classificationcited by 1,311
38 more
- 2023Fine-tuning Aligned Language Models Compromises Safety, Even When Users Do Not Intend To!cited by 1,154
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 739
- 2022Red Teaming Language Models to Reduce Harms: Methods, Scaling Behaviors, and Lessons Learnedcited by 729
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 532
- 2023Reinforced Self-Training (ReST) for Language Modelingcited by 500
- 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 405
- 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 399
- 2023Safety-Tuned LLaMAs: Lessons From Improving the Safety of Large Language Models that Follow Instructionscited by 387
- 2023Orca: Progressive Learning from Complex Explanation Traces of GPT-4cited by 379
- 2024Interpretable Preferences via Multi-Objective Reward Modeling and Mixture-of-Expertscited by 376
- 2023Data Selection for Language Models via Importance Resamplingcited by 329
- 2018Approximation Methods for Bilevel Programmingcited by 236
- 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 234
- 2016Hyperparameter optimization with approximate gradientcited by 233
- 2020Bilevel Optimization: Convergence Analysis and Enhanced Designcited by 222
- 2024Preference Fine-Tuning of LLMs Should Leverage Suboptimal, On-Policy Datacited by 185
- 2020Directional convergence and alignment in deep learningcited by 178
- 2024RegMix: Data Mixture as Regression for Language Model Pre-trainingcited by 177
- 2020On the Iteration Complexity of Hypergradient Computationcited by 155
- 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 154
- 2020A Two-Timescale Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Criticcited by 144
- 2017On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learningcited by 142
- 2023In-Context Convergence of Transformerscited by 115
- 2021A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentumcited by 106
- 2021Provably Faster Algorithms for Bilevel Optimizationcited by 106
- 2024Data-efficient Fine-tuning for LLM-based Recommendationcited by 104
- 2023A Fully First-Order Method for Stochastic Bilevel Optimizationcited by 100
- 2025Learning What Reinforcement Learning Can't: Interleaved Online Fine-Tuning for Hardest Questionscited by 97
- 2024Learning Dynamics of LLM Finetuningcited by 95
- 2024Lisa: Lazy Safety Alignment for Large Language Models against Harmful Fine-tuning Attackcited by 92
- 2025On-Policy RL Meets Off-Policy Experts: Harmonizing Supervised Fine-Tuning and Reinforcement Learning via Dynamic Weightingcited by 91
- 2023On Penalty-based Bilevel Gradient Descent Methodcited by 87
- 2024Panacea: Pareto Alignment via Preference Adaptation for LLMscited by 80
- 2020A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singletoncited by 79
- 2024SEAL: Safety-enhanced Aligned LLM Fine-tuning via Bilevel Data Selectioncited by 64
- 2021Amortized Implicit Differentiation for Stochastic Bilevel Optimizationcited by 63
50 most cited of 71 All 71 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.