arXiv Computation and Language By Haotian Wu, Zeming Chen, Hao Zhao, Antoine Bosselut

Consolidating Reasoning with Test-Time Training

Read the original on arXiv Computation and Language →

The paper introduces TTT‑Consolidate, a framework that leverages multi‑agent reasoning trajectories as adaptation data to improve subsequent reasoning. It consolidates these trajectories into parametric representations via test‑time training and then generates a new solution conditioned on the consolidated information, with meta‑learning used to optimize the consolidation process. Using the newly created OpenParallelThinking corpus of 12,810 math problems and trajectories from six LLMs, TTT‑Consolidate outperforms existing aggregation baselines by up to 20 percentage points on challenging math and STEM benchmarks, especially as model size grows.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Oct 12

Collaborative Learning and Reasoning over Model Slices

The paper introduces collaborative learning for large language models, where a single large model is replaced by smaller, heterogeneous models—called model slices—under a comparable parameter budget. By enabling prior reasoning to be reassessed across different model parameterizations and employing pyramid supervision that blends protocol distillation with step‑level supervision, the authors refine reasoning and interaction decisions during collaboration. Experiments on multi‑hop question answering, mathematical reasoning, code generation, and open‑ended constrained generation show that the trained heterogeneous models match or surpass the performance of the original large model and established multi‑agent baselines, while also achieving higher inference efficiency and exhibiting task‑specific collaboration patterns.

By Yuheng Wang, Runde Yang, Zhuohan Bao, Qiran Zhang, Huatao Li, Yiyang Zheng, Lin Wu, Jingru Fan, Shu Yao, Yihan Li, Zhi Li, Chen Qian
arXiv AI
Jun 30

Beyond Scaling Law: A Data-Efficient Distillation Framework for Reasoning

arXiv:2508. 09883v2 Announce Type: replace-cross Abstract: Large language models (LLMs) demonstrate remarkable reasoning capabilities in tasks such as algorithmic coding and mathematical problem-solving.

By Xiaojun Wu, Xiaoguang Jiang, Huiyang Li, Jucai Zhai, Dengfeng Liu, Qiaobo Hao, Huang Liu, Zhiguo Yang, Ji Xie, Ninglun Gu, Jin Yang, Kailai Zhang, Yelun Bao, Jun Wang
arXiv Computation and Language
Sep 14

Chopthin-Consensus Power Sampling: A Diversity-Preserving Approach to LLM Decoding

Chopthin-Consensus Power Sampling (CCPS) is a new inference-time decoding method for large language models that uses the Chopthin resampler to preserve diversity among particle trajectories. By enforcing an upper bound on weight ratios instead of equal-weight resampling, CCPS maintains a richer set of distinct reasoning paths and guarantees a lower bound on effective sample size. Coupled with a semantic-majority selection mechanism, CCPS achieves higher oracle coverage and matches or surpasses baseline accuracy on multiple reasoning benchmarks.

By Minoo Ahmadi, Seyedarmin Azizi, Erfan Baghaei Potraghloo, Mehdi Kamal, Massoud Pedram