156

VTCBench: Can Vision-Language Models Understand Long Context with Vision-Text Compression?

Hongbo Zhao
Meng Wang
Fei Zhu
Wenzhuo Liu
Bolin Ni
Fanhu Zeng
Gaofeng Meng
Zhaoxiang Zhang
Main:28 Pages
9 Figures
Bibliography:4 Pages
12 Tables
Abstract

The computational and memory overheads associated with expanding the context window of LLMs severely limit their scalability. A noteworthy solution is vision-text compression (VTC), exemplified by frameworks like DeepSeek-OCR and Glyph, which convert long texts into dense 2D visual representations, thereby achieving token compression ratios of 3x-20x. However, the impact of this high information density on the core long-context capabilities of vision-language models (VLMs) remains under-investigated. To address this gap, we introduce the first benchmark for VTC and systematically assess the performance of VLMs across three long-context understanding settings: VTC-Retrieval, which evaluates the model's ability to retrieve and aggregate information; VTC-Reasoning, which requires models to infer latent associations to locate facts with minimal lexical overlap; and VTC-Memory, which measures comprehensive question answering within long-term dialogue memory. Furthermore, we establish the VTCBench-Wild to simulate diverse inputthis http URLcomprehensively evaluate leading open-source and proprietary models on our benchmarks. The results indicate that, despite being able to decode textual information (e.g., OCR) well, most VLMs exhibit a surprisingly poor long-context understanding ability with VTC-processed information, failing to capture long associations or dependencies in thethis http URLstudy provides a deep understanding of VTC and serves as a foundation for designing more efficient and scalable VLMs.

View on arXiv
Comments on this paper