atlas

Research map / Large language models / Agents, code and math

Learning to Solve Complex Problems via Dataset Decomposition

NeurIPS 2025 · Large language models › Agents, code and math · approach: Code generation benchmarks · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes DECOMP, a teacher-led recursive decomposition of math and code datasets into verified sub-problems with a concept-dependency-graph difficulty score, used to build easy-to-hard curricula for SFT of small LMs.

Problem

Curriculum learning for LMs has yielded mixed results because difficulty ranking within fixed datasets is hard to estimate and datasets lack granularity of atomic skills; the paper asks whether recursively decomposing complex problems into simpler verified sub-problems can enable better curricula fo

Approach

A teacher LLM recursively splits each worked solution into steps, tags each step with a concept, generates grounded sub-problems verified by consistency checks, and scores difficulty via a concept dependency graph depth plus structural branching factor, then trains students easy-to-hard.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add recursive dataset decomposition to SFTQwen2.5-1.5B on MATH · MATH-500accuracy: $48.4 \pm 2.2$ -> $50.8 \pm 2.2$Helped
Add easy-to-hard curriculum to SFT-Decomp (ablation)Qwen2.5-1.5B on MATH · MATH-500accuracy: $50.8 \pm 2.2$ -> $51.6 \pm 2.2$Helped
Add recursive dataset decomposition to SFTQwen3-4B-Base on AIME2024 training data · AIME2025accuracy: $3.3 \pm 3.3$ -> $13.3 \pm 6.3$Helped
Add easy-to-hard curriculum to SFT-Decomp (ablation)Qwen3-4B-Base on AIME2024 training data · AIME2025accuracy: $13.3 \pm 6.3$ -> $16.7 \pm 6.9$Helped
Add recursive dataset decomposition to SFTDeepSeek-R1-Distill-Qwen-1.5B on MATH · AIME2025accuracy: $23.33 \pm 7.85$ -> $30.00 \pm 8.51 $Helped
Add recursive dataset decomposition to SFTQwen2.5-1.5B-Instruct on Codeforces-CoTs · HumanEvalpass@1: $35.37 \pm 3.74$ -> $42.68 \pm 3.87$Helped
Add recursive dataset decomposition to SFTDeepSeek-R1-Distill-Qwen-1.5B on Codeforces-CoTs · HumanEvalpass@1: $36.01 \pm 1.85$ -> $57.90 \pm 0.98$Helped
Fine-tune on the original AIME2024 dataset with standard SFTQwen3-4B-Base · AIME2025accuracy: $10.0 \pm 5.6$ -> $3.3 \pm 3.3$Hurt

Surprising findings

Limitations

Experimental setup

Datasets: MATH AIME 2024 AIME 2025 CodeForces-CoTs GSM8K

Benchmarks: MATH-500 AIME 2025 HumanEval

Metrics: accuracy pass@1

Baselines: SFT SFT-Direct Distillation SFT-MetaMATH-Aug SFT-MuggleMath S1-32B Qwen2.5-72B-Instruct GPT-4o Llama3-8B Mistral-7B Gemma2-9B

Builds on: curriculum learning MetaMath MuggleMath s1

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy