Salvato in:
Dettagli Bibliografici
Autori principali: Li, Shufan, Kallidromitis, Konstantinos, Bansal, Hritik, Gokul, Akash, Kato, Yusuke, Kozuka, Kazuki, Kuen, Jason, Lin, Zhe, Chang, Kai-Wei, Grover, Aditya
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:https://arxiv.org/abs/2505.16839
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912437405483008
author Li, Shufan
Kallidromitis, Konstantinos
Bansal, Hritik
Gokul, Akash
Kato, Yusuke
Kozuka, Kazuki
Kuen, Jason
Lin, Zhe
Chang, Kai-Wei
Grover, Aditya
author_facet Li, Shufan
Kallidromitis, Konstantinos
Bansal, Hritik
Gokul, Akash
Kato, Yusuke
Kozuka, Kazuki
Kuen, Jason
Lin, Zhe
Chang, Kai-Wei
Grover, Aditya
contents Modern Vision-Language Models (VLMs) can solve a wide range of tasks requiring visual reasoning. In real-world scenarios, desirable properties for VLMs include fast inference and controllable generation (e.g., constraining outputs to adhere to a desired format). However, existing autoregressive (AR) VLMs like LLaVA struggle in these aspects. Discrete diffusion models (DMs) offer a promising alternative, enabling parallel decoding for faster inference and bidirectional context for controllable generation through text-infilling. While effective in language-only settings, DMs' potential for multimodal tasks is underexplored. We introduce LaViDa, a family of VLMs built on DMs. We build LaViDa by equipping DMs with a vision encoder and jointly fine-tune the combined parts for multimodal instruction following. To address challenges encountered, LaViDa incorporates novel techniques such as complementary masking for effective training, prefix KV cache for efficient inference, and timestep shifting for high-quality sampling. Experiments show that LaViDa achieves competitive or superior performance to AR VLMs on multi-modal benchmarks such as MMMU, while offering unique advantages of DMs, including flexible speed-quality tradeoff, controllability, and bidirectional reasoning. On COCO captioning, LaViDa surpasses Open-LLaVa-Next-8B by +4.1 CIDEr with 1.92x speedup. On bidirectional tasks, it achieves +59% improvement on Constrained Poem Completion. These results demonstrate LaViDa as a strong alternative to AR VLMs. Code and models will be released in the camera-ready version.
format Preprint
id arxiv_https___arxiv_org_abs_2505_16839
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle LaViDa: A Large Diffusion Language Model for Multimodal Understanding
Li, Shufan
Kallidromitis, Konstantinos
Bansal, Hritik
Gokul, Akash
Kato, Yusuke
Kozuka, Kazuki
Kuen, Jason
Lin, Zhe
Chang, Kai-Wei
Grover, Aditya
Computer Vision and Pattern Recognition
Modern Vision-Language Models (VLMs) can solve a wide range of tasks requiring visual reasoning. In real-world scenarios, desirable properties for VLMs include fast inference and controllable generation (e.g., constraining outputs to adhere to a desired format). However, existing autoregressive (AR) VLMs like LLaVA struggle in these aspects. Discrete diffusion models (DMs) offer a promising alternative, enabling parallel decoding for faster inference and bidirectional context for controllable generation through text-infilling. While effective in language-only settings, DMs' potential for multimodal tasks is underexplored. We introduce LaViDa, a family of VLMs built on DMs. We build LaViDa by equipping DMs with a vision encoder and jointly fine-tune the combined parts for multimodal instruction following. To address challenges encountered, LaViDa incorporates novel techniques such as complementary masking for effective training, prefix KV cache for efficient inference, and timestep shifting for high-quality sampling. Experiments show that LaViDa achieves competitive or superior performance to AR VLMs on multi-modal benchmarks such as MMMU, while offering unique advantages of DMs, including flexible speed-quality tradeoff, controllability, and bidirectional reasoning. On COCO captioning, LaViDa surpasses Open-LLaVa-Next-8B by +4.1 CIDEr with 1.92x speedup. On bidirectional tasks, it achieves +59% improvement on Constrained Poem Completion. These results demonstrate LaViDa as a strong alternative to AR VLMs. Code and models will be released in the camera-ready version.
title LaViDa: A Large Diffusion Language Model for Multimodal Understanding
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2505.16839