English

Efficient Document Parsing via Parallel Token Prediction

Computation and Language 2026-03-17 v1 Computer Vision and Pattern Recognition

Abstract

Document parsing, as a fundamental yet crucial vision task, is being revolutionized by vision-language models (VLMs). However, the autoregressive (AR) decoding inherent to VLMs creates a significant bottleneck, severely limiting parsing speed. In this paper, we propose Parallel-Token Prediction (PTP), a plugable, model-agnostic and simple-yet-effective method that enables VLMs to generate multiple future tokens in parallel with improved sample efficiency. Specifically, we insert some learnable tokens into the input sequence and design corresponding training objectives to equip the model with parallel decoding capabilities for document parsing. Furthermore, to support effective training, we develop a comprehensive data generation pipeline that efficiently produces large-scale, high-quality document parsing training data for VLMs. Extensive experiments on OmniDocBench and olmOCR-bench demonstrate that our method not only significantly improves decoding speed (1.6x-2.2x) but also reduces model hallucinations and exhibits strong generalization abilities.

Keywords

Cite

@article{arxiv.2603.15206,
  title  = {Efficient Document Parsing via Parallel Token Prediction},
  author = {Lei Li and Ze Zhao and Meng Li and Zhongwang Lun and Yi Yuan and Xingjing Lu and Zheng Wei and Jiang Bian and Zang Li},
  journal= {arXiv preprint arXiv:2603.15206},
  year   = {2026}
}

Comments

Accepted by CVPR 2026 Findings

R2 v1 2026-07-01T11:22:11.188Z