Allspark: Weak to Strong Transfer via Alternating Chain of Thought

Kaizhao Liang, Junxiong Wang, Chen Liang, Zhendong Wang, Qiang Liu

UT Austin · Together AI · Microsoft

Published September 26, 2026 · on the feed September 29, 2026 · ▲ 3 · arXiv 2609.32913

Reasoning & math No code arXiv ↗Hugging Face ↗

The abstract

Recent progress in frontier models has renewed interest in large-scale reinforcement learning (RL), but the cost of generating large-model rollouts makes even testing RL recipes expensive. We ask whether reasoning improvements learned by a small, weak model can benefit a larger, stronger model without using the strong model's rollouts during training. We introduce Allspark, a training and inference framework for weak-to-strong transfer through alternating chains of thought. A weak teacher is trained alongside a frozen copy of the same model; the two alternate reasoning segments, and the frozen model produces the final answer. At inference time, a stronger student replaces the frozen training partner, while both models remain fixed. Because they communicate through text, the teacher can steer students from different model families and with different tokenizers. We study Allspark at two scales: controlled Qwen experiments across math and reasoning, and larger-scale Inkling experiments on ARC-AGI-2. The Inkling experiments show accuracy gains in within-family and cross-family settings, including transfer to Kimi and Nemotron, with benefits that vary across inference settings. These findings motivate reusing a trained weak teacher across strong students and examining the resulting accuracy--token tradeoff.

The Brief

2:18

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Allspark. Weak to Strong Transfer via Alternating Chain of Thought. By Kaizhao Liang and four others, from the University of Texas at Austin, Together A I, and one other institution. Published on the twenty-sixth of September. No code repository is linked to it.

Progress in frontier models has revived interest in large-scale reinforcement learning. Yet generating rollouts from a large model is costly enough that even testing an RL recipe becomes expensive. The question here is whether that cost can be sidestepped: can reasoning improvements learned by a small, weak model benefit a larger, stronger one, without ever using the strong model's rollouts during training? If it can, the expensive part of the loop moves to a model that is cheap to run, and the strong model only has to show up at the end.

Allspark is a framework for training and inference built on alternating chains of thought. A weak teacher learns to reason in turns with a partner, and later that partner is swapped for a stronger one. The teacher's contribution is text inside a shared chain of thought, so what it learned can be carried to a different model.

During training, the weak teacher is paired with a frozen copy of the same model. The two alternate reasoning segments, and the frozen copy produces the final answer. At inference time a stronger student takes the frozen partner's place, and neither model is updated. Because the two communicate only through text, the teacher can steer students from other model families, including ones that use different tokenizers. Nothing about the arrangement requires the two models to share weights, vocabulary, or lineage. They only need to be able to read each other's segments of reasoning, and continue from them.

Two scales are studied. Controlled experiments with Qwen cover math and reasoning. Larger experiments with Inkling target ARC-AGI-2. The Inkling experiments show accuracy gains both within a model family and across families, including transfer to Kimi and to Nemotron. The benefits vary across inference settings, and the abstract says so directly. That caveat is part of the result: the transfer is shown to happen, but how much it helps depends on how the pair is run.

Train cheaply on the small side, then lend what was learned to something bigger through the only channel every model shares, which is text. The authors draw two directions from their findings: reusing one trained weak teacher across several strong students, and looking closely at the tradeoff between accuracy and the tokens spent to reach it.

Paper Quest · 7 chapters · about 39 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Big-model rollouts are the bill. The question is whether a small model can pay it instead.

You want to test reinforcement learning recipes for reasoning on a large model. Every experiment needs long rollouts sampled from that large model, and the bill makes even early tests expensive.

The road ahead

  1. 1 · The problem ~6 min Testing reinforcement learning recipes on a large model is expensive because every experiment needs long reasoning rollouts sampled from that large model.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~8 min A small teacher learns, using only small-model rollouts, to write reasoning chunks that help a partner answer, then helps a stronger model.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Pair a teacher with a frozen copy, alternate chunks, let the copy answer, then swap in a stronger frozen student.
  6. 6 · The experiment ~6 min You’ll guess: In the Inkling experiments, did a weak teacher trained with Allspark's alternating chains of thought improve accuracy for strong students from other model families?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.