Challenge: Experimental results show that instruction tuning improves zero-shot generalization across various tasks and improves performance of specific tasks.
Approach: They propose a task selection method that leverages instruction information alone to identify relevant tasks and optimize instruction tuning for specific tasks.
Outcome: The proposed method is significantly more efficient than traditional approaches, which require complex measurements of pairwise transferability between tasks or the creation of data samples for the target task.

Similar Papers

Active Instruction Tuning: Improving Cross-Task Generalization by Training on Prompt Sensitive Tasks (2023.emnlp-main)

Copied to clipboard

Challenge: Instruction tuning (IT) achieves impressive zero-shot generalization results by training large language models on diverse tasks with instructions.
Approach: They propose a framework to identify informative tasks and then actively tune models on selected tasks.
Outcome: The proposed method outperforms baseline strategies for task selection on NIV2 and Self-Instruct datasets.
Differentiable Instruction Optimization for Cross-Task Generalization (2023.findings-acl)

Copied to clipboard

Challenge: Existing studies have shown that instruction tuning is effective for generalizing to arbitrary tasks unseen during training.
Approach: They propose to introduce learnable instructions and optimize them with gradient descent to optimize instruction for generalization ability.
Outcome: The proposed instruction extractor extracts appropriate instruction and improves generalization ability compared to manual instruction tuning.
Chasing Random: Instruction Selection Strategies Fail to Generalize (2025.findings-naacl)

Copied to clipboard

Challenge: Prior work has shown that language models can be tuned to follow user instructions using only a small set of high-quality instructions.
Approach: They analyze popular selection strategies across different datasets and benchmarks to find out whether they generalize poorly.
Outcome: The proposed methods outperform random baselines and cost-performance trade-offs on the full dataset and a random subset.
Do Models Really Learn to Follow Instructions? An Empirical Study of Instruction Tuning (2023.acl-short)

Copied to clipboard

Challenge: Recent studies on instruction tuning (IT) have achieved great performance with zero-shot generalizability to unseen tasks.
Approach: They analyze how models utilize instructions during IT by comparing model training with altered vs. original instructions.
Outcome: The proposed model outperforms naive models in low resource setting.
Multi-Task Transfer Matters During Instruction-Tuning (2024.findings-acl)

Copied to clipboard

Challenge: Instruction-tuning improves a model’s ability to learn in-context, but the mechanisms that drive in-constext learning are poorly understood.
Approach: They propose to train a model on hundreds of tasks to improve its ability to learn in-context.
Outcome: The proposed methods improve model transfer and in-context generalization, suggesting catastrophic forgetting may impact in-constext learning.
Demystifying Instruction Mixing for Fine-tuning Large Language Models (2024.acl-srw)

Copied to clipboard

Challenge: Instruction tuning is effective for aligning large language models with human instructions, but the procedure to optimizing the mixing of instruction datasets is still unclear.
Approach: They categorize instructions into three primary types: NLP downstream tasks, coding, and general chat.
Outcome: The proposed method improves performance of large language models (LLMs) but it is difficult to combine different instruction datasets to optimize overall performance.
Fine-Tuning Large Language Models with Sequential Instructions (2025.naacl-long)

Copied to clipboard

Challenge: Existing instruction-tuned models struggle to adhere to a query with multiple intentions, which impairs their performance when the completion of several tasks is demanded by a single command.
Approach: They develop an automatic process that turns existing data into diverse and complex task chains and a new benchmark to evaluate a model’s ability to follow all the instructions in a sequence.
Outcome: The proposed model can follow instructions better and deliver higher results in coding, maths, and open-ended generation.
From Selection to Refinement: Iterative Optimization for Instruction Data (2026.acl-long)

Copied to clipboard

Challenge: Existing methods to optimize instruction tuning datasets face two main challenges: unreasonable pruning of potentially valuable low-quality data and the persistence of noise or semantic drift during revision.
Approach: They propose an automated iterative framework for instruction data optimization that prunes low-quality data and refines low quality data using feedback-driven iteration.
Outcome: The proposed framework outperforms state-of-the-art methods on seven public benchmark datasets with high data efficiency.
Task-aware Retrieval with Instructions (2023.findings-acl)

Copied to clipboard

Challenge: Existing models that learn intents from labeled data are complicated and require a vast number of annotated examples to train a model.
Approach: They propose a general-purpose task-aware retrieval system with instructions that can adapt to a new task without any parameter updates.
Outcome: The proposed system outperforms two benchmarks on a set of domains and tasks on X2-Retrieval.
ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning (2025.findings-emnlp)

Copied to clipboard

Challenge: Prevailing methods for task-specific instruction tuning use similarity metrics to select training data . but instruction tuning loss often fails to exhibit a monotonic relationship with actual task performance .
Approach: They propose a task-specific instruction tuning method that leverages pairwise preference loss as a reward signal.
Outcome: The proposed method surpasses state-of-the-art methods for task-specific instruction tuning.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations