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.
arXiv:2603.00889v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have exhibited remarkable reasoning capabilities, largely enabled by supervised fine-tuning (SFT)- and reinforce...
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.
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.
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.
arXiv:2605. 28742v2 Announce Type: replace Abstract: Language models can use verifiable rewards to improve at a wide variety of reasoning tasks.
arXiv:2512. 13278v2 Announce Type: replace-cross Abstract: Agentic reinforcement learning has advanced large language models (LLMs) to reason through long chain-of-thought trajectories while interleaving external tool use.
arXiv:2606. 17803v1 Announce Type: new Abstract: Large language models achieve strong reasoning performance by scaling inference-time compute, yet remain fundamentally stateless, discarding the rich, self-produced reasoning traces generated during this process.
arXiv:2610.00571v1 Announce Type: cross Abstract: Large reasoning models (LRMs) have achieved substantial improvements in solving complex mathematical problems, but often produce lengthy, repetitive,...
arXiv:2603.00578v2 Announce Type: replace-cross Abstract: Long chain-of-thought~(CoT) reasoning improves the problem-solving capability of large reasoning models~(LRMs), but often incurs substantial...
arXiv:2607. 03065v1 Announce Type: cross Abstract: Reinforcement learning has become a standard post-training recipe for large language models, but dense full-parameter updates create two deployment-relevant bottlenecks: suppressed reasoning performance, often reflected by premature saturation of test-time scaling, and interference when consolidating multiple capabilities through multi-domain training or model merging.
arXiv:2510. 18428v4 Announce Type: replace Abstract: Optimization modeling underlies critical decision-making across industries, yet remains difficult to automate: natural-language problem descriptions must be translated into precise mathematical formulations and executable solver code.
arXiv:2608. 15303v1 Announce Type: new Abstract: Test-time compute can substantially improve Large Language Model (LLM) reasoning performance, yet how and when additional compute helps remains poorly understood.