2025/12/24 by Felix Draxler, Justus C. Will, Draxler, Felix +9 · 1 citation
Computer Science · #Autoregressive model #Bottleneck #Computation and Language (cs.CL) #Decoding methods #FOS: Computer and information sciences #Language model #Machine Learning (cs.LG) #Natural Language Processing Techniques #Security token #Sequence (biology) #Speech Recognition and Synthesis #Topic Modeling #Transformer
paper · doi:10.48550/arxiv.2512.21323
published in Open MIND
openalex publication_date 2025/12/24 · openalex created_date 2025/12/26 · openalex updated_date 2026/07/28
Autoregressive decoding in language models is inherently slow, generating only one token per forward pass. We propose Parallel Token Prediction (PTP), a general-purpose framework for predicting multiple tokens in a single model call. PTP moves the source of randomness from post-hoc sampling to random input variables, making future tokens deterministic functions of those inputs and thus jointly predictable in a single forward pass. We prove that a single PTP call can represent arbitrary dependencies between tokens. PTP is trained by distilling an existing model or through inverse autoregressive training without a teacher. Experimentally, PTP achieves a 2.4x speedup on a diverse-task speculative decoding benchmark. We provide code and checkpoints at https://github.com/mandt-lab/ptp.