mlsanityData to 14 Oct 2026

RAISE: Reinforced Adaptive Instruction Selection For Large Language Models

arXiv 2504.07282 ↗First posted 9 Apr 2025cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

In the instruction fine-tuning of large language models (LLMs), it is widely recognized that a few high-quality instructions are superior to a large number of low-quality instructions. At present, many instruction selection methods have been proposed, but most of these methods select instruction based on heuristic quality metrics, and only consider data selection before training. These designs lead to insufficient optimization of instruction fine-tuning, and fixed heuristic indicators are often difficult to optimize for specific tasks. Therefore, we design a dynamic, task-objective-driven instruction selection framework RAISE(Reinforced Adaptive Instruction SElection), which incorporates the entire instruction fine-tuning process into optimization, selecting instructions at each step based on the expected impact of each instruction on model performance improvement. Our approach is well interpretable and has strong task-specific optimization capabilities. By modeling dynamic instruction selection as a sequential decision-making process, we use RL to train our selection strategy. Extensive experiments and result analysis prove the superiority of our method compared with other instruction selection methods. Notably, RAISE achieves superior performance by updating only 1% of the training steps compared to full-data training, demonstrating its efficiency and effectiveness.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 46 references that are in the map. First posted on arXiv 9 Apr 2025.

Builds on

24 of 46 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2023GPT-4 Technical Reportcited by 18,396
  3. 2017Proximal Policy Optimization Algorithmscited by 15,215
  4. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  5. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  6. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  7. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
  8. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
  9. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
  10. 2023LIMA: Less Is More for Alignmentcited by 1,100
  11. 2022Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Taskscited by 868
  12. 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 739
12 more
  1. 2020Aligning AI With Shared Human Valuescited by 723
  2. 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 532
  3. 2020UnifiedQA: Crossing Format Boundaries With a Single QA Systemcited by 476
  4. 2023What Makes Good Data for Alignment? A Comprehensive Study of Automatic Data Selection in Instruction Tuningcited by 364
  5. 2023From Quantity to Quality: Boosting LLM Performance with Self-Guided Data Selection for Instruction Tuningcited by 307
  6. 2023MMC: Advancing Multimodal Chart Understanding with Large-scale Instruction Tuningcited by 150
  7. 2021CrossFit: A Few-shot Learning Challenge for Cross-task Generalization in NLPcited by 142
  8. 2023HYTREL: Hypergraph-enhanced Tabular Data Representation Learningcited by 36
  9. 2024G-DIG: Towards Gradient-based Diverse and High-quality Instruction Data Selection for Machine Translationcited by 30
  10. 2024Perception Compressor: A Training-Free Prompt Compression Framework in Long Context Scenarioscited by 23
  11. 2024ItD: Large Language Models Can Teach Themselves Induction through Deductioncited by 8
  12. 2024Length-Aware Multi-Kernel Transformer for Long Document Classificationcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.