arXiv AI

Learn Your Own Thoughts: Abstract Token Curriculum

The paper introduces Abstract Token Curriculum (ATC), a curriculum learning framework that enables large language models to develop continuous intermediate representations—referred to as abstract thoughts—without explicit supervision or manual scratchpad design. ATC incrementally raises problem difficulty through a sequence of distributions, guiding models to focus attention on the most informative tokens for predicting subsequent tokens. The authors provide theoretical analysis for parity function learning with single‑layer softmax attention and demonstrate ATC’s effectiveness on graph reachability and arithmetic learning tasks.

arXiv AI
Sep 1

Learning Composable Chains-of-Thought

arXiv:2505.22635v2 Announce Type: replace-cross Abstract: A common approach for teaching large language models (LLMs) to reason is to train on chain-of-thought (CoT) traces of in-distribution reasoni...

By Fangcong Yin, Zeyu Leo Liu, Liu Leqi, Xi Ye, Greg Durrett
arXiv AI
Jun 15

SuperThoughts: Reasoning Tokens in Superposition

arXiv:2606. 13862v1 Announce Type: cross Abstract: Long Chain-of-Thought (CoT) reasoning improves LLM problem-solving but is computationally expensive due to sequential token generation.

By Zheyang Xiong, Shivam Garg, Max Yu, Vaishnavi Shrivastava, Haoyu Zhao, Anastasios Kyrillidis, Dimitris Papailiopoulos
arXiv Machine Learning
Sep 1

A Model with No Head and Many Thoughts

arXiv:2608.31069v1 Announce Type: new Abstract: Large language models decode by projecting hidden states through a large vocabulary head at every step. This operation is computationally costly and fo...

By Nikita Koriagin, Yaroslav Aksenov, George Bredis, Gleb Gerasimov, Nikita Balagansky, Daniil Gavrilov
arXiv AI
Sep 1

Zipping the Thought: When and How Compressed Reasoning Data Works in LLM Post-Training

The paper investigates how different forms of compressed chain‑of‑thought (CoT) reasoning—Explicit, Composed, and Implicit—affect large language model (LLM) performance after supervised fine‑tuning (SFT). Using a synthetic compositional reasoning task, the authors show that coarser CoT requires more SFT data, that Composed and Implicit CoT benefit more from data scaling (with Composed also benefiting from repetition), and that reinforcement learning with verifiable rewards (RLVR) can decompose compressed steps learned during SFT. Additionally, unidirectional CoT ordering improves generalization on longer sequential tasks.

By Kohsei Matsutani, Gouki Minegishi, Takeshi Kojima, Yusuke Iwasawa, Yutaka Matsuo
arXiv Machine Learning
Jun 4

Can Large Language Models Generalize Procedures Across Representations?

arXiv:2602. 03542v2 Announce Type: replace-cross Abstract: Large language models (LLMs) are trained and tested extensively on symbolic representations such as code and graphs, yet real-world user tasks are often specified in natural language.

By Fangru Lin, Valentin Hofmann, Xingchen Wan, Weixing Wang, Zifeng Ding, Anthony G. Cohn, Janet B. Pierrehumbert