arXiv AI
Reasoning with Continuous Latent Diffusion
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jul 29
Penelope: Localized Latent Recurrence for Efficient Structured Reasoning
arXiv:2607. 25915v1 Announce Type: new Abstract: Complex structured reasoning tasks often require additional computation, yet current language models obtain it mainly by increasing parameter scale or by serializing intermediate steps as chain-of-thought (CoT) tokens.
arXiv Machine Learning
Sep 18
Uni-LaDiR: Latent Diffusion Unifies Multimodal Reasoning
Uni-LaDiR (Unified Latent Diffusion Reasoner) is a new framework that unifies multimodal reasoning by mapping teacher reasoning steps from different modalities into a shared latent space of thought tokens. It employs a diffusion model to predict the next block of thought tokens, jointly training the encoder and reasoner with shared weights to ensure tokens are both useful and predictable. The approach achieves relative gains of 7.3% on visual reasoning benchmarks and 6.1% on robot manipulation tasks compared to the strongest baselines.
arXiv AI
Jul 2
Diffusion-GR2: Diffusion Generative Reasoning Re-ranker
arXiv:2607. 01170v1 Announce Type: cross Abstract: Generative reasoning re-rankers achieve strong recommendation accuracy by emitting a chain-of-thought before re-ordering a candidate list, but they are slow at inference: an autoregressive (AR) decoder spends one sequential forward pass per reasoning token, and the reasoning trace far exceeds the ranking it produces.
arXiv Machine Learning
Sep 25
ELF-REG: Scaling Continuous Diffusion Language Models to Reasoning Tasks
The paper introduces ELF-REG, a scaling of continuous diffusion language models (dLMs) for reasoning tasks. By aligning representations and using a frozen autoregressive teacher to supervise intermediate denoiser features, ELF-REG achieves higher pass@1 rates on GSM8K, MATH-500, HumanEval, and MBPP compared to prior dLMs. The method also enables strong low‑NFE performance through early‑stop decoding of intermediate predictions.
arXiv AI
Sep 2
Flow Reasoning Models: Turning Flows Into Efficient Recurrent Reasoners
Flow Reasoning Models (FRMs) are a new framework that turns continuous flow models into efficient recurrent reasoners for structured tasks. By self‑conditioning a flow model on its own past outputs, FRMs iteratively refine solutions, allowing parallel decision making and revision. The authors introduce Fixed‑Point Forcing (FPF) to mitigate exposure bias at deeper recursion, and report near‑perfect solve rates on Sudoku‑Extreme, Zebra, and Maze‑Unique, outperforming existing masked‑diffusion and specialized baselines while using far fewer inference FLOPs.
arXiv AI
Sep 2
Latent Recurrent Thoughts: Recurrent Refinement of Proposed Latents for Reasoning with Frozen LLMs
Latent Recurrent Thoughts (LRT) proposes a method for reasoning with frozen large language models by operating in the model’s continuous representation space. A small auxiliary network generates initial latent vectors, which a tiny recurrent reasoner refines over multiple steps, decoupling computational depth from model size. Experiments on symbolic and natural‑language reasoning tasks show that LRT outperforms prior frozen‑decoder continuous‑space methods and chain‑of‑thought prompting while using far less inference compute.