Paper
HPD-Parsing Proposes Hierarchical Parallel Decoding, Achieving Document Parsing Throughput of 4,752 tokens/s
HPD-Parsing replaces full-page autoregressive generation with hierarchical parallel decoding: a main layout branch coordinates the global structure and dynamically assigns block-level content decoding to concurrent branches, while progressive multi-token prediction (P-MTP) further reduces decoding steps per branch. It achieves a throughput of 4,752 tokens/s on public benchmarks, a 3.06x improvement over autoregressive baselines, while maintaining competitive parsing accuracy. This method opens a new direction for efficient unified document parsing.
Read the original (opens in a new tab)
News stream data aggregated by AI HOT