Joint commitment improves accuracy on all six benchmarks the authors evaluate, with the largest gains on reasoning and exact-answer tasks.
Abstract
Diffusion large language models (dLLMs) commit multiple tokens per denoising step by decoding each selected position independently from the shared context; when those positions are dependent, the resulting factorization error is captured by conditional total correlation, which confidence-based selection cannot observe from marginals alone. We propose CoCommit, a marker-gated coordination pass that briefly defers commitment: after the usual bundle selection, a learned marker announces the commit set and the backbone's last-$n$ layers are re-applied so marked positions coordinate -- approximating joint-mode decoding -- before greedy argmax writes tokens. The method reuses existing weights with one extra partial forward pass and no auxiliary model. On LLaDA2.1-mini with LoRA adapters and matched greedy inference, joint commitment improves accuracy on all six benchmarks we evaluate, with the largest gains on reasoning and exact-answer tasks.
CoCommit is proposed, a marker-gated coordination pass that delays commitment that approximates joint-mode decoding while reusing existing weights, requiring only one partial forward pass and no auxiliary model.
Trajectory-Aware Commit Gating (TACG), a training-free gate-level decoder that anchors token identities to the base posterior and uses trajectory-aware signals only to decide whether the current proposal is ready to commit, is proposed.
Chengcheng Wang, Tingzhang Luo, Wenhao Li et al.· arXiv.org· 3 citations
RPS is proposed, a novel training-free decoding method that seeks mid-entropy positions as promising candidate pivots (where to decode), and determines their token assignment that yields the greatest downstream benefit via lookahead evaluation (what to decode).
Yu-Shi Ye, Xu Chen, Hao-Yun Jiang et al.· 1 citation
Results show that learned token-level handoffs can reduce LLM use while preserving strong reasoning performance, and show that learned token-level handoffs can reduce LLM use while preserving strong reasoning performance.
This work proposes CORA-Diff, a training-free method that preserves the original transfer rule and applies confidence-and-persistence gating only to positions that rule leaves unresolved, and shows that native confidence and persistence enable reliable residual acceptance, reducing repeated denoising computation while...
This work proposes CAI-DLLM, a training-free inference method that uses first-step confidence to guide denoising and reduce inference time, and evaluates CAI-DLLM on LLaDA-8B-Instruct and Dream-7B-Instruct across math, code, reasoning, commonsense, and long-context tasks.
Farhana Amin, Sabiha Afroz, D. Nikolopoulos· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.