Jadwal Sholat

Memuat jadwal sholat…

Ilmu Komputer & AI editorial

Open AccessOA2026

Ladders of Thought: A Self-Evolving Curriculum of Progressively Simplified Reasoning Traces

A framework that boosts small language model reasoning via progressive question rewrites and adaptive bandit scheduling
Minghui Liu; Thomas Magelinski; Dehao Yuan; Qi Yu; Furong Huang· 2026· DOI 10.48550/arXiv.2609.25643

The core problem

Large language models (LLMs) achieve strong reasoning when scaled to hundreds of billions of parameters, but small- and mid-scale models remain brittle reasoners even with knowledge distillation (KD). This work introduces Ladders-of-Thought (LoT), a framework that improves reasoning by combining progressive question rewrites with a self-evolving curriculum. LoT automatically generates semantically faithful but easier variants of reasoning problems, organizes them into difficulty buckets using step-based measures, and employs a self-evolving bandit scheduler to allocate training adaptively. The authors evaluate LoT on two reasoning domains—math and multi-hop reasoning—across 1–8B models from different families. The central hypothesis is that progressive rewrites coupled with adaptive curricula provide a simple yet effective recipe for strengthening reasoning in smaller LLMs.

Innovation

LoT consistently improves over KD across 1–8B models from different families. On arithmetic tasks, it delivers large gains: **+32 percentage points on AddSub** and **+25pp on SVAMP**. On in-domain test splits, improvements range from **+2 to +8pp**. For multi-hop reasoning, benefits are strong but dataset-dependent: **+16pp on QASC** and **+25pp on StrategyQA**. The framework also converges faster than staged curricula, highlighting the value of adaptive progression. These results demonstrate that progressive rewrites coupled with adaptive curricula provide a simple yet effective recipe for strengthening reasoning in smaller LLMs.
Large language models (LLMs) achieve strong reasoning when scaled to hundreds of billions of parameters, but small- and mid-scale models remain brittle reasoners even with knowledge distillation (KD). This work introduces Ladders-of-Thought (LoT), a framework that improves reasoning by combining progressive question rewrites with a self-evolving curriculum. LoT automatically generates semantically faithful but easier variants of reasoning problems, organizes them into difficulty buckets using step-based measures, and employs a self-evolving bandit scheduler to allocate training adaptively. The authors evaluate LoT on two reasoning domains—math and multi-hop reasoning—across 1–8B models from different families. The central hypothesis is that progressive rewrites coupled with adaptive curricula provide a simple yet effective recipe for strengthening reasoning in smaller LLMs.
LoT operates in three stages: (1) **Progressive question rewriting**: For each original reasoning problem, the framework generates a sequence of semantically equivalent but progressively simpler variants. Simplicity is measured by the number of reasoning steps required, e.g., a problem requiring steps is rewritten into variants requiring steps. (2) **Difficulty bucketing**: Rewritten problems are grouped into buckets based on step-based difficulty metrics, forming a ladder of increasing complexity. (3) **Self-evolving bandit scheduler**: A multi-armed bandit algorithm dynamically allocates training compute across buckets. The scheduler treats each bucket as an arm and updates its policy based on the model's performance, allowing the curriculum to evolve as the model improves. Formally, the scheduler maintains a probability distribution over buckets at training step , updated via reward signals (e.g., validation accuracy on bucket ). The training objective combines KD loss with a curriculum-weighted sampling strategy:

Why it matters

The effectiveness of LoT stems from two key mechanisms: progressive simplification and adaptive scheduling. Progressive rewrites create a ladder of examples that bridge the gap between the student's current ability and the target task, reducing the brittleness observed in small models. The self-evolving bandit scheduler ensures that training focuses on the most informative difficulty level at each stage, avoiding the inefficiencies of static curricula. The faster convergence compared to staged curricula suggests that dynamic allocation is crucial. However, the dataset-dependent benefits on multi-hop reasoning indicate that the quality of rewrites and the nature of the task influence outcomes. Future work could explore more sophisticated rewriting strategies and extend LoT to other domains such as code generation and logical deduction. Overall, LoT offers a practical path to enhance reasoning in resource-constrained settings.

Who should read this

CS practitioners and researchers

Opening member content…