Prefix-Adaptive Block Diffusion for Efficient Document Recognition

📰 ArXiv cs.AI

arXiv:2605.16861v1 Announce Type: cross Abstract: Block Diffusion Models (BDMs) support parallel generation, flexible-length output, and KV caching, making them promising for efficient document parsing. However, existing BDMs bind denoising and cache commitment to fixed block boundaries: parallelism shrinks during intra-block denoising, while generated tokens cannot be cached until the whole block is completed. Moreover, intra-block bidirectional denoising conflicts with inter-block autoregressi

Published 19 May 2026
Read full paper → ← Back to Reads