Pith. sign in

REVIEW 4 cited by

#InsTag: Instruction Tagging for Analyzing Supervised Fine-tuning of 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

arxiv 2308.07074 v2 pith:WK73HPJO submitted 2023-08-14 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords instagmodelsdatacomplexitydatasetsdiversityopen-sourceability
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Foundation language models obtain the instruction-following ability through supervised fine-tuning (SFT). Diversity and complexity are considered critical factors of a successful SFT dataset, while their definitions remain obscure and lack quantitative analyses. In this work, we propose InsTag, an open-set fine-grained tagger, to tag samples within SFT datasets based on semantics and intentions and define instruction diversity and complexity regarding tags. We obtain 6.6K tags to describe comprehensive user queries. Then we analyze popular open-sourced SFT datasets and find that the model ability grows with more diverse and complex data. Based on this observation, we propose a data selector based on InsTag to select 6K diverse and complex samples from open-source datasets and fine-tune models on InsTag-selected data. The resulting models, TagLM, outperform open-source models based on considerably larger SFT data evaluated by MT-Bench, echoing the importance of query diversity and complexity. We open-source InsTag in https://github.com/OFA-Sys/InsTag.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. SFGA: A Statistics-First Gating Architecture with Adjudicative Escalation for Trustworthy SFT Data Procurement

    cs.LG 2026-07 conditional novelty 6.0 of 10

    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.

  2. ClusterUCB: Efficient Gradient-Based Data Selection for Targeted Fine-Tuning of LLMs

    cs.CL 2025-06 conditional novelty 6.0 of 10

    ClusterUCB uses gradient clustering plus a modified UCB bandit to match full-budget gradient influence data selection at a 20% computing budget.

  3. Seed-Coder: Let the Code Model Curate Data for Itself

    cs.CL 2025-06 conditional novelty 6.0 of 10

    Seed-Coder shows that an LLM-trained quality scorer can filter 6T tokens of code data and yield 8B models that outperform similar-size open code models.

  4. ClimateChat: Designing Data and Methods for Instruction Tuning LLMs to Answer Climate Change Queries

    cs.CL 2025-06 conditional novelty 5.0 of 10

    An automated pipeline creates climate instruction data, and fine-tuning a geoscience LLM on it improves climate question-answering accuracy over general instruction tuning.

Pith tools