The Flow has not summarised this story yet — read it at arXiv Computation and Language.
arXiv:2610.07175v1 Announce Type: new Abstract: Visual latent reasoning compresses rendered derivations into compact intermediate states, reducing textual reasoning overhead. Existing approaches diff...
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.
arXiv:2606. 16222v1 Announce Type: new Abstract: Large Language Models (LLMs) increasingly rely on intermediate reasoning, yet explicit Chain-of-Thought (CoT) suffers from a linguistic space bottleneck: each thought must be decoded into tokens, causing high inference overhead.
arXiv:2606. 06252v1 Announce Type: new Abstract: Recent work moves intermediate reasoning from natural-language traces into latent or cache-level representations to reduce token overhead and avoid a discrete communication bottleneck.
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.
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.