Pith. sign in

REVIEW 7 cited by

CoT-Self-Instruct: Building high-quality synthetic prompts for reasoning and non-reasoning tasks

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 2507.23751 v2 pith:JKGA6TUV submitted 2025-07-31 cs.AI cs.CL

CoT-Self-Instruct: Building high-quality synthetic prompts for reasoning and non-reasoning tasks

classification cs.AI cs.CL
keywords datasynthetictaskstrainingcot-self-instructhigh-qualitymethodreasoning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose CoT-Self-Instruct, a synthetic data generation method that instructs LLMs to first reason and plan via Chain-of-Thought (CoT) based on given seed tasks, and then generate a new synthetic example of similar quality and complexity. This is followed by a filtering step to select high-quality data using automatic metrics, which are then used for LLM training. In verifiable reasoning, our synthetic data significantly outperforms existing training datasets, such as s1k and OpenMathReasoning, when evaluated on MATH500, AMC23, AIME24, and GPQA-Diamond. For non-verifiable instruction-following tasks, our method surpasses the performance of both human and standard Self-Instruct training data on the AlpacaEval 2.0 and Arena-Hard benchmarks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

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

  1. Skill Self-Play: Pushing the Frontier of LLM Capability with Co-Evolving Skills

    cs.CL 2026-07 conditional novelty 6.0

    Skill Self-Play uses an evolving skill library to guide LLM self-training, improving tool-call and reasoning accuracy beyond unguided self-play on five model backbones.

  2. Autodata: An agentic data scientist to create high quality synthetic data

    cs.AI 2026-06 unverdicted novelty 6.0

    Autodata trains meta-optimized AI agents to generate superior synthetic datasets, yielding performance gains over classical methods on CS research, legal, and math reasoning tasks.

  3. Autodata: An agentic data scientist to create high quality synthetic data

    cs.AI 2026-06 unverdicted novelty 6.0

    Autodata introduces an agentic method with meta-optimization to create higher-quality synthetic data, yielding performance gains over standard methods on CS, legal, and math tasks.

  4. Autodata: An agentic data scientist to create high quality synthetic data

    cs.AI 2026-06 conditional novelty 6.0

    An agentic weak–strong Self-Instruct loop, optionally meta-optimized, produces synthetic data that trains small models better than standard CoT Self-Instruct across three domains.

  5. Less is Enough: Synthesizing Diverse Data in LLM Feature Space with Sparse Autoencoders

    cs.CL 2026-02 conditional novelty 6.0

    Coverage of sparse-autoencoder-identified task features predicts post-training performance and can guide synthesis of small, high-impact datasets (2,000 vs. 300,000 samples).

  6. On the Generalization Gap in Self-Evolving Language Model Reasoning

    cs.CL 2026-05 unverdicted novelty 5.0

    Closed-loop self-evolution on LLMs improves reasoning on Knights and Knaves tasks but plateaus short of oracle-supervised levels, with multi-turn revision nearly matching it for large models.

  7. Learning to Pose Problems: Reasoning-Driven and Solver-Adaptive Data Synthesis

    cs.AI 2025-11 unverdicted novelty 5.0

    A reasoning-driven problem generator plans synthesis directions with CoT and uses solver performance feedback to adapt difficulty, producing complementary problems that yield a 3.4% average improvement across 10 reaso...