Research
Latent Reasoning in Continuous Space for Unified Multimodal Models
Overview Research area: Multimodal generative AI — unified multimodal models (UMMs) that both understand and generate images, with a focus on reasoning before image generation. Technical level: Advanc
- arXiv
- 2610.42149
- Published
- 2026-10-30
- Authors
- Byungwoo Jeon, Yoonwoo Jeong, Hyunseok Lee, Minsu Cho, Jinwoo Shin
AI summary
Overview
Research area: Multimodal generative AI — unified multimodal models (UMMs) that both understand and generate images, with a focus on reasoning before image generation.
Technical level: Advanced. The paper combines latent/continuous-space chain-of-thought, curriculum supervised fine-tuning, and reinforcement learning (GRPO) with an information-theoretic reward.
Scope (one sentence): The paper argues that reasoning for image generation should happen in continuous hidden-state space rather than discrete token space, and introduces LARC, a two-stage training framework built on BAGEL that improves text-to-image quality, editing, and multimodal understanding while enabling test-time scaling.
What This Paper Is About
Unified multimodal models can already understand and generate images, but adding language-based chain-of-thought reasoning gives them only narrow gains — and, unlike large language models, they do not improve smoothly when given more reasoning compute at test time. The authors trace this failure to a "modality mismatch": reasoning happens in discrete tokens while image generation happens in a continuous latent space. Their goal is to close that gap by moving reasoning itself into continuous space, so that extra reasoning steps actually help the generated image.
Key Contributions
- A diagnosis of the failure mode. The paper identifies the discrete-versus-continuous mismatch between reasoning and image generation as the root cause of limited gains and absent test-time scaling in reasoning-augmented UMMs.
- LARC, a continuous-space latent reasoning framework. The model alternates between "language mode" (sampled text tokens) and "latent mode," where the last hidden state at a
<latent>token is fed back as the next input embedding; the resulting trajectory is read by the image module via cross-attention. The authors describe it as the first framework to reason in the same continuous latent space used for image generation within a UMM. - A self-evolving two-stage training recipe. Stage 1 is curriculum supervised fine-tuning that gradually converts token-level reasoning into latent reasoning (including controlled stochasticity so policy gradients are possible). Stage 2 is reinforcement learning with an information-gain reward plus a collapse-prevention (diversity) reward, requiring no ground-truth latent chains and no external critic.
- Evidence of test-time scaling in a UMM. The paper reports that under budget forcing, doubling latent reasoning compute yields monotonic gains across all three text-to-image benchmarks, and that LARC outperforms best-of-N sampling under matched compute on image generation, image editing, and visual reasoning.
Main Findings
- GenEval (text-to-image): LARC reaches 0.88 overall, versus 0.81 for BAGEL and 0.83 for Uni-CoT — a 7%p gain over BAGEL as stated in the abstract and conclusion. Sub-scores: single object 1.00, two objects 0.98, counting 0.86, colors 0.93, position 0.77, attribute binding 0.78.
- Attribute binding is the biggest jump: a +15%p increase over the baseline (0.78 for LARC vs 0.63 for BAGEL), which the authors attribute to latent reasoning handling joint visual realization and compositional planning.
- DPG-Bench (prompt following): LARC scores 90.04 overall versus 85.07 for BAGEL, reported as a +5.8% improvement; sub-scores are Global 92.25, Entity 91.89, Attribute 93.00, Relation 94.70, Other 92.35.
- OneIG-Bench: LARC scores 0.866 overall versus 0.764 for BAGEL (a +10.2%p gain over the base model) and 0.790 for Uni-CoT (+7.6 absolute points). Gains appear across prompt types and lengths (NP 0.892, T&P 0.840, short 0.887, medium 0.869, long 0.840).
- Image editing (CompBench): LARC improves LC-T from 20.434 (BAGEL) to 22.509, described as a +10.2% gain; PSNR rises from 24.3 to 25.7, LPIPS falls from 0.069 to 0.049, LC-I reaches 0.880 and SSIM 0.953.
- Multimodal understanding: LARC improves over both BAGEL and Uni-CoT on all four benchmarks — MME 1725.3 (vs 1687.0 BAGEL, 1691.7 Uni-CoT), MMB 88.1 (vs 85.0 / 85.4), MMMU 56.2 (vs 55.3 / 55.5), and MIRA 11.7 (vs 7.5 / 10.6). The authors note the MIRA gain (7.5 → 11.7) is the most pronounced.
- Reasoning space ablation: switching from token-level to latent reasoning improves all four benchmarks in Stage 1 (GenEval 0.82 → 0.83, OneIG-Bench 0.79 → 0.81, CompBench 20.81 → 21.46, MIRA 7.1 → 9.7). Token-level reasoning actually degrades MIRA relative to the 7.5 baseline.
- Interleaved vs naive latent reasoning: the interleaved design beats naive latent-only reasoning on OneIG-Bench (0.81 vs 0.79) and CompBench (21.46 vs 21.02), while MIRA is comparable (9.7 vs 9.9).
- Stage ablation: Stage 1 alone gives GenEval 0.83, OneIG-Bench 0.81, CompBench 21.46, MIRA 9.7; adding Stage 2 raises these to 0.88, 0.87, 22.51, and 11.7 — showing the RL stage refines traces beyond SFT.
Methodology in Plain English
The starting point is BAGEL, a unified multimodal model that can both understand and generate images. The authors teach it a new reasoning habit: instead of writing out reasoning as words, the model occasionally emits a special <latent> marker and then simply continues from its own internal hidden state rather than from a decoded word. Reasoning therefore becomes an alternating sequence of ordinary text spans and continuous latent steps, and the whole sequence is passed to the image module to produce the picture.
Training happens in two stages. First, curriculum supervised fine-tuning: the model is trained on 1M interleaved chain-of-thought samples (drawn from FLUX-Reason, WEAVE, and ScaleEdit) in which <latent> markers have been inserted at reasoning-step boundaries. Latent steps are introduced gradually — first none (text-only reasoning), then one, two, and so on up to all N, with the learning rate lowered at each phase — because switching on all latent steps at once is unstable. The loss combines standard next-token prediction on the text spans with a flow-matching loss on the target image, and gradients flow through the latent steps even though those steps have no explicit target.
Second, reinforcement learning. Because the latent reasoning is deterministic and has no ground-truth answer key, the authors design an intrinsic reward: the information gain — how much more likely a frozen copy of the Stage-1 model finds the target image when the reasoning trace is included versus when only the prompt is given. This is estimated as the difference between two flow-matching losses evaluated with the same noise sample; in expectation it equals a conditional mutual information between the trace and the image. A second term rewards diversity among latent steps (average pairwise cosine dissimilarity) to stop all latents collapsing into the same vector. The combined reward is optimized with GRPO, using group rollouts so no separate value model is needed. Training used 8 NVIDIA A100 GPUs, approximately 300 GPU hours for Stage 1 and 96 GPU hours for Stage 2; only the understanding expert is updated during RL.
Why This Matters
- Research impact: the paper reframes a specific limitation of reasoning-augmented multimodal models (no test-time scaling for image generation) as a representation-space problem, and shows a training recipe that produces monotonic gains from extra latent compute. That connects the latent-reasoning line of work in LLMs (Coconut-style) to image generation and gives the field a concrete target to beat.
- Real-world applications:
- Design and content creation tools where prompts specify precise attribute combinations and spatial layouts.
- Accessibility and visual communication tools that need faithful rendering of detailed textual descriptions.
- Education and scientific visualization, where prompt fidelity directly determines whether the output is usable.
- Image editing workflows that require localized, instruction-faithful attribute changes.
- Industry relevance: test-time scaling is the mechanism behind current reasoning-model economics — more inference compute buys better outputs. A UMM that scales this way lets providers offer quality tiers on the same model, and the framework is designed as an add-on to an existing UMM backbone (BAGEL) rather than a new architecture, which lowers adoption cost. The reward design also removes the need for human- or model-written reasoning annotations.
Future Directions
- Pushing latent budgets further: the paper demonstrates monotonic gains from increasing latent reasoning compute and from budget forcing, but the shape of the curve at much larger budgets, and where returns saturate, remains open.
- Generalizing beyond BAGEL: LARC is instantiated only on BAGEL; whether the recipe transfers to other UMM architectures (e.g., discrete-token UMMs such as Emu3 or Janus-Pro) is not established.
- Cheaper adaptation: the authors themselves flag parameter-efficient variants (adapter-based or low-rank) for latent reasoning as future work to reduce the cost of training a multi-billion-parameter backbone with RL.
- Evaluation of reasoning-augmented generators: the impact statement calls for evaluation protocols specifically for reasoning-augmented generative models, since the relationship between reasoning fidelity and harmful output is described as understudied.
Target Audience
Researchers and engineers working on unified multimodal models, latent/continuous chain-of-thought, and RL post-training for generative models. It is most useful to readers already comfortable with diffusion/flow-matching objectives, policy-gradient methods such as GRPO, and the mechanics of latent reasoning in LLMs; the ablation structure (reasoning space, interleaving strategy, training stage) makes it valuable for practitioners deciding where to invest in a reasoning-augmented generation pipeline. Readers seeking a beginner-level introduction to text-to-image generation will find the density of RL and information-theoretic notation steep.
Authors’ abstract
Unified Multimodal Models (UMMs) achieve remarkable success on diverse multimodal understanding and generation tasks, yet they still struggle to effectively leverage language-based chain-of-thought reasoning for image generation. As a result, existing reasoning-augmented UMMs often fail to inherit the test-time scaling and fine-grained controllability observed in large language models. We attribute this failure to a fundamental modality mismatch: reasoning is performed in a discrete token space, whereas image generation operates in a continuous space. To bridge this gap, we introduce a Latent Reasoning framework in Continuous space (LARC), which alleviates the token-level bottleneck by reasoning over continuous hidden states. Specifically, the training framework consists of two stages: (i) curriculum supervised fine-tuning (SFT), and (ii) information-gain reinforcement learning (RL). First, the curriculum SFT stage gradually converts token-level reasoning into latent reasoning. Subsequently, the information-gain RL stage self-evolves latent reasoning without ground truth supervision. Experiments across diverse text-to-image generation benchmarks show that LARC consistently improves generation quality, prompt following, and compositional fidelity. Notably, LARC achieves state-of-the-art performance on GenEval with a 7%p gain over BAGEL and demonstrates clear test-time scaling behavior, outperforming token-based generation under both parallel and sequential test-time scaling strategies.