arXiv Computation and Language

Why Struggle with Continuous Latents? Interpretable Discrete Latent Reasoning via Rendered Compression

The paper introduces Discrete Latent Reasoning (DLR), a method that transforms continuous latent states into explicit discrete tokens by rendering textual chains of thought into images, extracting visual features, and clustering them to build a discrete latent vocabulary. DLR enables standard autoregressive modeling over both natural language and latent tokens, supporting pretraining alignment, supervised fine-tuning, and reinforcement learning. Experiments on five reasoning benchmarks and two model series (Qwen3‑VL and LLaMA‑3) show that DLR outperforms prior latent reasoning baselines with up to 20× compression while preserving interpretable semantic structure.

arXiv Computer Vision
Oct 12

VaME: Exploring Variational Latent Reasoning for Multimodal Embeddings

VaME (Variational Multimodal Embeddings) introduces a framework that treats latent reasoning as a learnable distribution over trajectories, enabling autoregressive exploration in latent space guided by answer reconstruction. By augmenting embedding-token readout with a latent-fused embedding and optimizing over stochastic variational trajectories via reinforcement learning with a Semantic Decoding Reward, VaME achieves superior performance on the MMEB-V2 benchmark and reasoning-intensive tasks like MRMR. The method also delivers at least a 4.25× inference speedup compared to deterministic latent autoregressive baselines.

By Peixi Wu, Mingzhou Jiang, Feipeng Ma, Biao Yang, Yunhao Zhou, Wei Yuan, Bosong Chai, Huizu Lin, Jie Chen, Zhangchi Hu, Fan Yang, Wenwu Ou, Hebei Li, Xiaoyan Sun
arXiv AI
Sep 10

A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM

A*-Thought-V2 is a framework that models Chain-of-Thought reasoning as a geometric trajectory in a 3D PCA space, using explicit-implicit latent tokens to compress steps that deviate from the main question-to-solution direction. The method measures alignment angles to decide which steps remain text and which become latent, and introduces stepwise embedding forcing and label forcing to train the architecture. Experiments on Qwen models show up to 2.6% accuracy gains, halved response length, and significant reductions in computation and training time.

By Xiaoang Xu, Siyuan Liu, Shuo Wang, Junlan Feng, Fanyu Meng, Zhu Zhang, Jixun Wang, Xiaorong Wang, Zihan Zhou, Xin Li, Chaojun Xiao, Yiming Zhang, Huijia Wu, Liuyu Xiang, Peipei Li, Zhaofeng He
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 AI
Sep 11

Structural Process Supervision for Latent Chain-of-Thought Reasoning

The paper introduces Prototype-Mediated Process Supervision (PMPS), a method that uses learnable reasoning prototypes to provide structural supervision for latent chain-of-thought embeddings, addressing representation collapse and uneven information distribution. PMPS aligns latent and explicit CoT embeddings in a shared prototype space via many-to-many soft assignment and employs a Progressive Sequential Alignment module to guide training from positional priors to adaptive matching. Experiments show PMPS reduces output token length to under 50% of explicit CoT on GSM8K-Aug and improves accuracy by 2.08% over SIM-CoT, even surpassing CoT-SFT on GPT-2 and achieving the highest accuracy among latent reasoning methods on larger models and harder tasks.

By Yiqi Li, Xu Chen, Chen Ju, Jiangchao Yao, Zhaoyang Li, Jinsong Lan, Xiaoyong Zhu, Bo Zheng, Yu Wang
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