Abstract:Large language models solve complex problems by generating lengthy chains of explicit reasoning tokens. While effective, this makes reasoning expensive, length-sensitive, and constrained to (discrete) natural language. While latent reasoning offers a continuous alternative, determining useful structures for intermediate latent states is an open challenge. In this paper, we formulate latent reasoning as a geometric path-approximation problem within the model's pretrained token-embedding space. We introduce Geometric Latent Reasoning (GLR), which uses a lightweight transition head to predict iterative direction updates in embedding space. Using textual chain-of-thought traces as anchors, GLR learns to approximate discrete reasoning trajectories while permitting continuous deviations from exact token embeddings. Evaluations on mathematical reasoning benchmarks using Qwen3 models reveal an emergent phenomenon: geometric latent reasoning induces substantially shorter generations without an explicit length objective. By replacing early explicit reasoning with continuous latent steps, models often reach correct answers using substantially fewer total generation steps. These findings suggest that continuous trajectories act as compact intermediate reasoning states, exposing a new tradeoff between latent computation budget, output length, and accuracy.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2606.02248 [cs.CL] |
| (or arXiv:2606.02248v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2606.02248 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Shashi Kumar [view email]
[v1]
Mon, 1 Jun 2026 13:40:55 UTC (2,626 KB)