REVIEW 9 cited by
Instruction Mining: Instruction Data Selection for Tuning Large Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large language models (LLMs) are initially pretrained for broad capabilities and then finetuned with instruction-following datasets to improve their performance in interacting with humans. Despite advances in finetuning, a standardized guideline for selecting high-quality datasets to optimize this process remains elusive. In this paper, we first propose InstructMining, an innovative method designed for automatically selecting premium instruction-following data for finetuning LLMs. Specifically, InstructMining utilizes natural language indicators as a measure of data quality, applying them to evaluate unseen datasets. During experimentation, we discover that double descent phenomenon exists in large language model finetuning. Based on this observation, we further leverage BlendSearch to help find the best subset among the entire dataset (i.e., 2,532 out of 100,000). Experiment results show that InstructMining-7B achieves state-of-the-art performance on two of the most popular benchmarks: LLM-as-a-judge and Huggingface OpenLLM leaderboard.
Forward citations
Cited by 9 Pith papers
-
Towards Efficient and Effective Alignment of Large Language Models
A thesis presenting Lion, WebR, LTE, BMC, and FollowBench, five empirical methods that together address LLM alignment data, training, and evaluation.
-
SFGA: A Statistics-First Gating Architecture with Adjudicative Escalation for Trustworthy SFT Data Procurement
A cost-aware gate that routes simple SFT procurement cases to cheap statistics and hard cases to an adjudicated LLM debate reports 0.90 accuracy on a synthetic closed-loop benchmark.
-
ClusterUCB: Efficient Gradient-Based Data Selection for Targeted Fine-Tuning of LLMs
ClusterUCB uses gradient clustering plus a modified UCB bandit to match full-budget gradient influence data selection at a 20% computing budget.
-
GraphGen: Enhancing Supervised Fine-Tuning for LLMs with Knowledge-Driven Synthetic Data Generation
A knowledge-graph-guided method that scores an LLM's knowledge gaps and generates atomic, aggregated, and multi-hop QA pairs, improving closed-book QA after fine-tuning.
-
TAG-INSTRUCT: Controlled Instruction Complexity Enhancement through Structure-based Augmentation
Operating on compressed semantic tags instead of raw text gives more controllable and effective instruction complexity augmentation for LLM fine-tuning, with reported gains over Evol-Instruct, Tree-Instruct, Auto-Inst...
-
Merge to Mix: Mixing Datasets via Model Merging
Merge to Mix shows that the performance of a parameter-averaged model predicts the performance of a model fine-tuned on any dataset mixture, enabling fast and accurate dataset mixture selection.
-
Efficient Data Selection at Scale via Influence Distillation
Influence Distillation selects LLM fine-tuning data by approximating each sample's gradient influence on a target task via landmarks and JVP embeddings, matching or beating RDS+ accuracy at roughly one third the selec...
-
A Survey of LLM $\times$ DATA
A comprehensive survey of the bidirectional links between LLMs and data management, organized as DATA4LLM and LLM4DATA with a new 'IaaS' data-quality framework.
-
Walk&Retrieve: Simple Yet Effective Zero-shot Retrieval-Augmented Generation via Knowledge Graph Walks
Offline walks over a knowledge graph, verbalized into text and retrieved by embedding similarity, let a single LLM call answer multi-hop questions competitively without any fine-tuning.
Discussion (0). Sign in to comment.