arXiv AI By Jie Yu, Yuxi Sun, Zhaoxu Li, Chunxiao Liu, Xudong Jiang

CoTS: Competitive Token Selection for Latent Reasoning in Large Language Models

Read the original on arXiv AI →

CoTS: Competitive Token Selection for Latent Reasoning in Large Language Models proposes a training‑free framework that replaces binary latent reasoning decisions with continuous token‑level allocation. By using the probability competition between the two most likely tokens, CoTS dynamically balances discrete commitment and soft exploration at each reasoning step, eliminating the need for manually tuned thresholds or additional forward passes. Experiments on six reasoning benchmarks show that CoTS consistently outperforms standard Chain‑of‑Thought and other state‑of‑the‑art training‑free latent reasoning methods.

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 AI.

arXiv AI
Oct 9

From Chain-of-Thought to Loops: Non-Autoregressive Latent Reasoning via Looped Transformers

The paper introduces LLoCoT, a looped latent‑reasoning framework that replaces the traditional left‑to‑right generation of chain‑of‑thought tokens with iterative refinement of a compact latent workspace using a shared transformer. By jointly updating latent slots over a few iterations and sampling latent tokens in parallel, LLoCoT feeds these into an autoregressive decoder for answer generation. Experiments on HumanEval and MBPP show that LLoCoT matches or surpasses explicit‑CoT baselines while dramatically reducing reasoning latency and increasing throughput.

By Gerard Grau Garc\'ia, Arnau Padr\'es Masdemont, Niccol\`o Grillo, Jordi Ros-Giralt, Arash Behboodi, Victor Conchello Vendrell
arXiv Machine Learning
Jun 5

Latent Reasoning with Normalizing Flows

arXiv:2606. 06447v1 Announce Type: cross Abstract: Large language models often improve reasoning by generating explicit chain-of-thought (CoT), demonstrating the importance of intermediate computation.

By Guancheng Tu, Xiangjun Fu, Suhao Yu, Yao Tang, Haoqiang Kang, Lianhui Qin, Yizhe Zhang, Jiatao Gu
arXiv AI
Oct 9

Efficient Reasoning via Constrained Optimization in Latent Space

Large Reasoning Models often overthink, producing redundant reasoning steps that consume many tokens. The authors observe that efficient reasoning steps cluster in a concentrated region of latent space, while verbose steps lie outside this region. By projecting deviating hidden states back into the region via a quadratic program, they propose a training‑free framework that cuts token generation by up to 52.8% while improving accuracy by up to 12.1% across several benchmarks.

By Zhinan Hou, Xingchen Li, Keyou You
arXiv AI
Jun 15

Fractured Chain-of-Thought Reasoning

arXiv:2505. 12992v4 Announce Type: replace-cross Abstract: Inference-time scaling techniques have significantly bolstered the reasoning capabilities of large language models (LLMs) by harnessing additional computational effort at inference without retraining.

By Baohao Liao, Hanze Dong, Yuhui Xu, Doyen Sahoo, Christof Monz, Junnan Li, Caiming Xiong
Hugging Face Trending Papers
Jun 4

Latent Reasoning with Normalizing Flows

Large language models often improve reasoning by generating explicit chain-of-thought (CoT), demonstrating the importance of intermediate computation. However, textual CoT forces this computation through a discrete, serial, and communication-oriented token stream: each reasoning step must be verbalized before the model can proceed, even when the underlying update is semantic, uncertain, or only partially formed.