Pith. sign in

REVIEW 53 cited by

LESS: Selecting Influential Data for Targeted Instruction Tuning

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 2402.04333 v3 pith:2BAMEOZM submitted 2024-02-06 cs.CL cs.AIcs.LG

Mengzhou Xia , Sadhika Malladi , Suchin Gururangan , Sanjeev Arora , Danqi Chen This is my paper · ORCID
classification cs.CLcs.AIcs.LG
keywords datainstructionlessmodelseffectivelygradienttuningcapabilities
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Instruction tuning has unlocked powerful capabilities in large language models (LLMs), effectively using combined datasets to develop generalpurpose chatbots. However, real-world applications often require a specialized suite of skills (e.g., reasoning). The challenge lies in identifying the most relevant data from these extensive datasets to effectively develop specific capabilities, a setting we frame as targeted instruction tuning. We propose LESS, an optimizer-aware and practically efficient algorithm to effectively estimate data influences and perform Low-rank gradiEnt Similarity Search for instruction data selection. Crucially, LESS adapts existing influence formulations to work with the Adam optimizer and variable-length instruction data. LESS first constructs a highly reusable and transferable gradient datastore with low-dimensional gradient features and then selects examples based on their similarity to few-shot examples embodying a specific capability. Experiments show that training on a LESS-selected 5% of the data can often outperform training on the full dataset across diverse downstream tasks. Furthermore, the selected data is highly transferable: smaller models can be leveraged to select useful data for larger models and models from different families. Our qualitative analysis shows that our method goes beyond surface form cues to identify data that exemplifies the necessary reasoning skills for the intended downstream application.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 53 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bridging Compute- and Data-Optimal Pretraining

    cs.LG 2026-07 conditional novelty 7.0 of 10

    Pretraining loss obeys a single law in which repeated or paraphrased tokens count as η(N, data-per-parameter, expansion-ratio) fresh tokens, with total effective data saturating as derived tokens grow.

  2. Towards Efficient and Effective Alignment of Large Language Models

    cs.CL 2025-06 conditional novelty 7.0 of 10

    A thesis presenting Lion, WebR, LTE, BMC, and FollowBench, five empirical methods that together address LLM alignment data, training, and evaluation.

  3. LittleLearner: Language Models Under Pedagogically Controlled Knowledge Exposure

    cs.CL 2026-08 conditional novelty 6.0 of 10

    A K-5-only pretraining corpus and 5B model show that language model capabilities track the knowledge boundary of the training data, and standard post-training methods do not cross it.

  4. CODS: Iterative Bellman-Residual Data Selection for Reusable Offline Reinforcement Learning

    cs.LG 2026-08 conditional novelty 6.0 of 10

    CODS iteratively picks high-Bellman-residual transitions into a frozen reusable subset, retaining 96.6% of eligible-pool D4RL performance at a 10% budget and beating one-shot and gradient-matching baselines.

  5. SafeBuild-Bench: A Temporal-Robust Construction Safety Benchmark with Graph-Enhanced Data Mining

    cs.CV 2026-07 conditional novelty 6.0 of 10

    A temporal-aware construction-safety benchmark built from real inspection archives shows current multimodal models remain far from reliable, with best overall scores near 60.

  6. RSIBench-Data: Benchmarking Data-Centric Research for Recursive Self-Improvement

    cs.SE 2026-07 conditional novelty 6.0 of 10

    A controlled benchmark shows LLM agents can sometimes discover better training-data strategies through feedback, but their improvements are fragile and usually not sustained.

  7. DataShield: Uncovering Risky Fine-Tuning Data Across LLMs Through Consensus Subspace Alignment

    cs.CR 2026-07 conditional novelty 6.0 of 10

    DataShield filters or masks LLM fine-tuning data by measuring alignment with consensus safe/unsafe subspaces from multiple source models, cutting attack success rates after fine-tuning while preserving utility.

  8. GradAlign: Gradient-Aligned Data Selection for LLM Reinforcement Learning

    cs.LG 2026-02 reject novelty 6.0 of 10

    GradAlign selects RL training problems whose policy gradients align with validation-set gradients, claiming more stable and better-performing LLM post-training.

  9. BLISS: A Lightweight Bilevel Influence Scoring Method for Data Selection in Language Model Pretraining

    cs.LG 2025-10 conditional novelty 6.0 of 10

    A bilevel optimization method ranks pretraining data by training a small proxy model on weighted samples, yielding modest downstream-task gains without external pretrained models.

  10. Influence-driven Curriculum Learning for Pre-training on Limited Data

    cs.CL 2025-08 unverdicted novelty 6.0 of 10

    Sorting pre-training examples by training-data influence instead of human-judged difficulty reportedly gives over 10 percentage point benchmark gains over random order in limited-data language model pre-training.

  11. Understanding Data Influence with Differential Approximation

    cs.LG 2025-08 conditional novelty 6.0 of 10

    This paper introduces Diff-In, an influence estimator that accumulates second-order approximations of influence differences across training steps and shows strong accuracy in data cleaning, deletion, and coreset selec...

  12. Vision-G1: Towards General Vision Language Reasoning with Multi-Domain Data Curation

    cs.CV 2025-08 reject novelty 6.0 of 10

    Vision-G1 trains a 7B VLM with multi-round GRPO on an influence-filtered, difficulty-curated 46-source dataset spanning eight visual reasoning domains.

  13. CaughtCheating: Is Your MLLM a Good Cheating Detective? Exploring the Boundary of Visual Perception and Reasoning

    cs.CV 2025-06 conditional novelty 6.0 of 10

    A new 100-image benchmark shows that state-of-the-art multimodal models detect subtle, socially meaningful visual clues at near-chance levels and hallucinate accusations on innocent images.

  14. Approximating Language Model Training Data from Weights

    cs.CL 2025-06 conditional novelty 6.0 of 10

    A gradient-based greedy selection method (SELECT) recovers effective substitute fine-tuning data from two language model checkpoints, approaching the original model's performance on classification and SFT tasks.

  15. EPiC: Towards Lossless Speedup for Reasoning Training through Edge-Preserving CoT Condensation

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Keeping only the first and last parts of chain-of-thought training traces preserves math reasoning accuracy on MATH500 at half the sequence length, but not on harder benchmarks.

  16. SynthRL: Scaling Visual Reasoning with Verifiable Data Synthesis

    cs.LG 2025-06 conditional novelty 6.0 of 10

    SynthRL synthesizes harder, answer-preserving visual math questions from easy seed questions and reports small but mixed out-of-domain RLVR gains for Qwen2.5-VL-7B.

  17. Data Pruning by Information Maximization

    cs.CV 2025-06 conditional novelty 6.0 of 10

    InfoMax selects a training subset by solving a discrete quadratic program that balances sample importance scores against pairwise similarity penalties, and reports state-of-the-art pruning results across three deep le...

  18. Reasoning Like an Economist: Post-Training on Economic Problems Induces Strategic Generalization in LLMs

    cs.AI 2025-05 conditional novelty 6.0 of 10

    Post-training an LLM on economic reasoning problems improves accuracy on economic benchmarks and, without game-specific training, raises its Nash equilibrium frequency and win rates in strategic games.

  19. Daunce: Data Attribution through Uncertainty Estimation

    cs.LG 2025-05 conditional novelty 6.0 of 10

    DAUNCE computes training-data attribution as the covariance of per-example losses across an ensemble of perturbed fine-tuned models, reporting state-of-the-art LDS scores and the first attribution runs on proprietary LLMs.

  20. Merge to Mix: Mixing Datasets via Model Merging

    cs.LG 2025-05 conditional novelty 6.0 of 10

    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.

  21. UFO-RL: Uncertainty-Focused Optimization for Efficient Reinforcement Learning Data Selection

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Selecting the 10% of math problems whose model confidence is closest to the dataset average performs as well as training on all problems, at a fraction of the compute.

  22. RICo: Refined In-Context Contribution for Automatic Instruction-Tuning Data Selection

    cs.CL 2025-05 conditional novelty 6.0 of 10

    RICo scores instruction examples by their in-context perplexity effect on an assessment set, then trains a lightweight selector to pick top-scoring data, achieving better benchmark results from 5% to 15% of the original data.

  23. GRAIT: Gradient-Driven Refusal-Aware Instruction Tuning for Effective Hallucination Mitigation

    cs.CL 2025-02 conditional novelty 6.0 of 10

    GRAIT selects and reweights refusal-training examples using gradient influence, reporting lower hallucination rates and better helpfulness scores than prior refusal-aware tuning baselines.

  24. R.I.P.: Better Models by Survival of the Fittest Prompts

    cs.CL 2025-01 conditional novelty 6.0 of 10

    RIP filters preference-optimization training data by keeping prompts whose rejected responses are high quality and whose chosen/rejected reward gap is small, yielding consistent benchmark gains over unfiltered data.

  25. Improving Influence-based Instruction Tuning Data Selection for Balanced Learning of Diverse Capabilities

    cs.CL 2025-01 conditional novelty 6.0 of 10

    BIDS, a balanced influence-based data selection algorithm using per-task normalization and iterative greedy selection, improves balanced multi-capability instruction tuning and can outperform full-dataset training on ...

  26. Evaluating Sample Utility for Efficient Data Selection by Mimicking Model Weights

    cs.LG 2025-01 conditional novelty 6.0 of 10

    A gradient alignment score against a reference model's weights selects and reweights training samples, improving data efficiency in image classification and CLIP pretraining.

  27. Error-driven Data-efficient Large Multimodal Model Tuning

    cs.CL 2024-12 conditional novelty 6.0 of 10

    An error-driven teacher-student pipeline extracts a student LMM's missing skills from validation mistakes and retrieves targeted samples from a task-agnostic dataset to fine-tune it.

  28. ResoFilter: Fine-grained Synthetic Data Filtering for Large Language Models through Data-Parameter Resonance Analysis

    cs.CL 2024-12 conditional novelty 6.0 of 10

    ResoFilter keeps fine-tuning examples that produce small parameter updates in the last layers, matching full-data fine-tuning on GSM8k with 50% of the math data.

  29. How to Synthesize Text Data without Model Collapse?

    cs.CL 2024-12 reject novelty 6.0 of 10

    Token-level editing of human text with a high-confidence threshold yields modest performance gains over the original data and avoids the sharp degradation seen with purely synthetic data.

  30. LLMCL-GEC: Advancing Grammatical Error Correction with LLM-Driven Curriculum Learning

    cs.CL 2024-12 conditional novelty 6.0 of 10

    An LLM-scored easy-to-hard curriculum for training grammatical error correction models yields small but consistent F0.5 gains over one-shot and length-based training.

  31. ROSE: A Reward-Oriented Data Selection Framework for LLM Task-Specific Instruction Tuning

    cs.LG 2024-12 conditional novelty 6.0 of 10

    A reward-oriented influence scoring method that uses pairwise preference loss to select 5% of instruction-tuning data, outperforming similarity-based selection baselines on SHP, SE, and HH-RLHF.

  32. Star-Agents: Automatic Data Optimization with LLM Agents for Instruction Tuning

    cs.CL 2024-11 conditional novelty 6.0 of 10

    A multi-agent LLM framework that generates, selects, and evolves instruction-tuning data improves downstream instruction-following by about 12% over Evol-Instruct baselines.

  33. Less Data, Better Alignment: Data-Centric Multi-Evaluator Agreement for Preference Optimization

    cs.AI 2026-07 conditional novelty 5.0 of 10

    On-policy multi-evaluator consensus filtering retains ~3.5% of candidates and, with KTO on 1.9k labels, improves Mistral-7B preference metrics over stronger data-heavy baselines, with mixed transfer to Llama.

  34. DomainPilot: Domain-Level Loss-Guided Two-Stage Data Mixture Optimization for Efficient Language Model Fine-Tuning

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Reallocating fine-tuning data proportions according to fitted per-domain loss curves improved benchmark scores by 1.8–3.8 points on Qwen3-1.7B, in a single unseeded run; the planned second stage is not yet implemented.

  35. DataPrep-Bench: Benchmarking LLMs as Training Data Preparators

    cs.LG 2026-05 conditional novelty 5.0 of 10

    DataPrep-Bench jointly benchmarks data construction and data-quality evaluation for LLMs across six domains with downstream fine-tuning performance as ground truth.

  36. Active Domain Knowledge Acquisition with 100-Dollar Budget: Enhancing LLMs via Cost-Efficient, Expert-Involved Interaction in Sensitive Domains

    cs.CL 2025-08 unverdicted novelty 5.0 of 10

    A budget-aware framework (PU-ADKA) selects which domain expert an LLM should query under a fixed $100 budget, improving specialized-domain answers at low cost.

  37. ADMIRE-BayesOpt: Accelerated Data MIxture RE-weighting for Language Models with Bayesian Optimization

    stat.ML 2025-08 conditional novelty 5.0 of 10

    Using Bayesian optimization over Gaussian-process surrogates, data mixtures for LLM training can be found much faster than with linear or exponential regression baselines, including across model sizes.

  38. Efficient Data Selection at Scale via Influence Distillation

    cs.CL 2025-05 conditional novelty 5.0 of 10

    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...

  39. IDEAL: Data Equilibrium Adaptation for Multi-Capability Language Model Alignment

    cs.AI 2025-05 reject novelty 5.0 of 10

    IDEAL tunes SFT data mixture proportions per domain with influence-function gradients, claiming about 7% average benchmark improvement over uniform mixing.

  40. Adversarial Cooperative Rationalization: The Risk of Spurious Correlations in Even Clean Datasets

    cs.AI 2025-05 conditional novelty 5.0 of 10

    A new adversarial training method detects and removes spurious correlations that rationalization models introduce even on clean datasets, improving explanation quality.

  41. R&B: Domain Regrouping and Data Mixture Balancing for Efficient Foundation Model Training

    cs.LG 2025-05 conditional novelty 5.0 of 10

    R&B repartitions training data into embedding-based semantic clusters and reweights them online via a gradient Gram matrix, matching or exceeding prior data-mixing methods at under 0.1% extra compute.

  42. DONOD: Efficient and Generalizable Instruction Fine-Tuning for LLMs via Model-Intrinsic Dataset Pruning

    cs.AI 2025-04 conditional novelty 5.0 of 10

    A model-intrinsic data pruning method using two weight-change metrics and TOPSIS reportedly improves instruction fine-tuning accuracy and robustness while using 70-80% less data.

  43. Ensembles of Low-Rank Expert Adapters

    cs.CL 2025-01 conditional novelty 5.0 of 10

    ELREA clusters instruction-tuning data by gradient direction, trains one LoRA expert per cluster, and routes new instructions to experts via gradient similarity, giving modest benchmark gains over full-data LoRA.

  44. RobustFT: Robust Supervised Fine-tuning for Large Language Models under Noisy Response

    cs.CL 2024-12 conditional novelty 5.0 of 10

    A noise-robust SFT framework that detects noisy responses via multi-expert LLM consensus, relabels them with context-enhanced reasoning, and filters low-confidence samples, improving LLM performance on five benchmarks.

  45. Mastering Collaborative Multi-modal Data Selection: A Focus on Informativeness, Uniqueness, and Representativeness

    cs.CV 2024-12 conditional novelty 5.0 of 10

    Selecting 15% of visual instruction data with DataTailor's three-principle scores matches or slightly beats full-data fine-tuning on multimodal benchmarks.

  46. BPO: Towards Balanced Preference Optimization between Knowledge Breadth and Depth in Alignment

    cs.CL 2024-11 conditional novelty 5.0 of 10

    BPO balances knowledge breadth and depth in preference data by compressing prompts and dynamically augmenting the number of response pairs per prompt using gradient-based clustering, achieving stronger alignment with ...

  47. SDO: Structure-Aware Data Organization for Efficient LLM Post-Training

    cs.LG 2026-07 conditional novelty 4.0 of 10

    SDO accelerates LLM post-training by forming coherent KNN-based mini-batches and dynamically rebalancing sample exposure across epochs.

  48. Class-Proportional Coreset Selection for Difficulty-Separable Data

    cs.LG 2025-07 conditional novelty 4.0 of 10

    Class-proportional variants of difficulty-based coreset selection outperform class-agnostic methods on class-imbalanced security and medical datasets, particularly at 90-99.9% pruning rates.

  49. Attributing Data for Sharpness-Aware Minimization

    cs.LG 2025-07 reject novelty 4.0 of 10

    SAM-HIF and SAM-GIF are proposed as data attribution scores for SAM-trained models, but SAM-GIF is TracIn with SAM gradients and SAM-HIF's derivation contains a load-bearing error.

  50. Data Diversification Methods In Alignment Enhance Math Performance In LLMs

    cs.AI 2025-07 reject novelty 4.0 of 10

    DTS, which generates diverse solution strategies before writing solutions, improves GSM8K by 7.1 points and MATH by 4.2 points over an untuned base model at 1.03x baseline compute.

  51. Generalizing Large Language Model Usability Across Resource-Constrained

    cs.LG 2025-05 conditional novelty 4.0 of 10

    The dissertation shows that text-centric prompting, inference-time optimization, and correct-by-construction synthetic data can improve LLM robustness and Verilog code generation under resource constraints.

  52. Data-efficient LLM Fine-tuning for Code Generation

    cs.CL 2025-04 conditional novelty 4.0 of 10

    Selecting the hardest 30% to 40% of code examples per cluster and packing tokens by length matches or beats full-data fine-tuning on HumanEval and MBPP while cutting training time and GPU memory.

  53. Foundations of Large Language Models

    cs.CL 2025-01 unverdicted

    A textbook-style review of core LLM concepts, drawn from the authors' existing NLPBook, with no new experimental or theoretical results.

Pith tools