Representation Forcing for Bottleneck-Free Unified Multimodal Models

35d ago · Global · primary source: export.arxiv.org

Multi-source synthesis by The Embedding Report from 2 sources. Every numeric and quoted claim traces to a cited source body (see methodology).

Researchers have proposed new techniques to improve unified multimodal models (UMMs), which integrate understanding and generation within a single framework.

A technique called Representation Forcing (RF) has been proposed to eliminate the structural bottleneck in UMMs, which currently rely on a frozen, separately pretrained VAE for image generation[2]. Removing this bottleneck introduces a quality gap, as the model must learn both high-level structure and low-level details from raw pixels. RF forces the decoder to autoregressively predict visual representations as intermediate tokens before pixels, eliminating the need for any external generative latent space[2]. According to the researchers, RF benefits both understanding and generation in UMMs, and a pixel-space model with RF matches state-of-the-art VAE-based unified models on image generation[2]. Another research effort has highlighted an 'understanding-generation gap' in UMMs, where models can capture user intent but fail to translate this semantic knowledge into precise pixel-level manipulation[1]. This gap results in two bottlenecks in the anything-to-image task (X2I): the attention entanglement bottleneck and the visual refinement bottleneck. To address this, a novel framework has been proposed to empower unified models to autonomously switch between generation strategies based on instruction complexity and model capability. A high-quality dataset with over 50,000 samples has been contributed, and a two-stage training strategy comprising SFT and RL has been implemented[1].

research-paperbenchmark

Background sources we checked (3)
  • en.wikipedia.org ↗ In deep learning, the transformer is a family of artificial neural network architectures built around the attention mechanism. Transformers were introduced to model sequential data without recurrence and without convolutions, allowing much more parallel computation during trainin…
  • en.wikipedia.org ↗ This article presents a detailed timeline of events in the history of computing from 2020 to the present. For narratives explaining the overall developments, see the history of computing. Significant events in computing include events relating directly or indirectly to software, …
  • en.wikipedia.org ↗ Non-canonical base pairs are planar, hydrogen-bonded pairs of nucleobases with hydrogen-bonding patterns that differ from those of standard Watson–Crick base pairs found in the classic double-helical structure of DNA. Although non-canonical pairs can occur in both DNA and RNA, th…

Sources cited (2)

  1. arxiv.org ↗ E
  2. arxiv.org ↗ E
Spot something wrong? Report an issue