NeFut Logo NeFut
Admin Login

[CS.AI] BRAID: A Unified Decision Process for Multi-Modal Reasoning

Published at: 2026-07-07 22:00 Last updated: 2026-07-09 03:23
#AI #Machine Learning #optimization

Abstract

Unified multi-modal models (UMMs) have shown promising interleaved text-image reasoning capabilities, yet effectively optimizing such multi-turn generation via reinforcement learning (RL) remains an open challenge. Existing approaches apply RL exclusively to text steps, relegating image generation to supervised surrogates, preventing policy gradients from propagating through the full interleaved trajectory across heterogeneous modalities.

In this paper, we introduce BRAID (Bridging inteRleAved multI-modal reasoning as a unified Decision process), a simple framework that casts multi-turn text-image-text reasoning as a unified Markov decision process (MDP), enabling joint optimization of textual and visual generation via a single, principled RL objective. BRAID computes a shared trajectory-level advantage and propagates it coherently into both text tokens and image denoising paths, each optimized through its modality-native policy gradient mechanism.

To further address long-horizon credit assignment, BRAID employs a vision-language model (VLM) judge that scores each intermediate image on its reasoning utility, supplying dense turn-level feedback to sharpen learning at critical visual branches. Experiments on spatial reasoning and visual perception benchmarks show that BRAID consistently outperforms various baselines, confirming that a unified MDP formulation with vision-thinking guidance is essential for effective multi-modal reasoning.

Blogger's Review: The introduction of the BRAID framework represents a significant advancement in the field of multi-modal reasoning. By unifying the optimization of text and image generation into a single decision process, BRAID not only enhances the efficiency of RL applications but also provides new avenues for future research, making it a topic worth following closely.

Original Source: https://arxiv.org/abs/2607.03748

[h] Back to Home