Metraipolis › archive › dc_c2ea3543273d
PACT: Certifying What Is Written in Parallel Decoding of Diffusion Language Models — arXiv:2611.04152
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04152
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T18:38:39.747Z
- SHA-256 of the archived text
b2accf5ccbca7e8d6d59ad3710604db7fa46e0da91d330bbca7b6336c9541fec- Stable URL of this page
https://metraipolis.com/documento/dc_c2ea3543273d
How to cite
PACT: Certifying What Is Written in Parallel Decoding of Diffusion Language Models — arXiv:2611.04152 — arXiv (en), https://arxiv.org/abs/2611.04152 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c2ea3543273d (Metraipolis archive dc_c2ea3543273d, sha256 b2accf5ccbca7e8d6d59ad3710604db7fa46e0da91d330bbca7b6336c9541fec)
BibTeX
@misc{dcc2ea3543273d,
title = {PACT: Certifying What Is Written in Parallel Decoding of Diffusion Language Models — arXiv:2611.04152},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04152},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c2ea3543273d; sha256 b2accf5ccbca7e8d6d59ad3710604db7fa46e0da91d330bbca7b6336c9541fec},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04152. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Parallel decoding speeds up masked diffusion language models by writing several tokens per forward pass. Published commit rules choose these tokens by testing the predicted distributions. Under sampling the written tokens are drawn, and these tests do not see them. We find that answer quality follows the reliability of the tokens actually written. An answer's log probability splits into this reliability and the dependence within each step. We propose PACT, a training-free commit rule that draws the tokens first, certifies the set it will write and spaces the positions of each step apart. This certificate holds at every temperature, and we show that no rule with the same guarantee commits more positions. Experiments use four models of the LLaDA and Dream families and HumanEval, MBPP, GSM8K, MATH500 and IFEval benchmarks. PACT reaches the quality of published commit rules with fewer forward passes. Spacing removes positions from each step, yet it usually lowers the total cost because later steps then write more tokens. At the same speed, published decoders also write a word twice in a row far more often than PACT. These results suggest that commit rules should certify the tokens they write. Code is available at this https URL . Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.CL, nuovi lavori del giorno). Categorie arXiv: Computation and Language (cs.CL). Pagina del lavoro: https://arxiv.org/abs/2611.04152 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T18:32:52.141Z dalla pagina https://arxiv.org/list/cs.CL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).