RACC: Regret-Aware Confidence Calibration for Consistent Masked Discrete Diffusion Decoding (2026.findings-acl)
Copied to clipboard
| Challenge: | Masked Discrete Diffusion Models (MDMs) enable parallel generation via iterative refinement, but their current decoding paradigms are static and myopic. |
| Approach: | They propose a Regret-Aware Confidence Calibration framework that aligns decoding decisions with the model’s latent self-correction capabilities. |
| Outcome: | The proposed framework aligns decoding decisions with model’s latent self-correction capabilities. |
Similar Papers
Empirical Analysis of Decoding Biases in Masked Diffusion Models (2026.acl-long)
Copied to clipboard
Pengcheng Huang, Tianming Liu, Zhenghao Liu, Yukun Yan, Shuo Wang, Tong Xiao, Zulong Chen, Maosong Sun
| Challenge: | Existing MDMs employ uncertainty-based decoding strategies that limit their reasoning ability and ultimately degrade generation quality. |
| Approach: | They propose a framework that regularizes uncertainty-based decoding by incorporating two complementary priors to shape global decoding trajectories and promote content informativeness. |
| Outcome: | The proposed framework outperforms existing decoding strategies by more than 7% while achieving comparable performance to autoregressive models of similar parameter scales. |
DecoCal: Decoding with Calibration in Diffusion Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Diffusion Large Language Models (DLLMs) generate text via iterative token denoising . but decoding is challenging, with many tokens appearing predictable early . |
| Approach: | They propose a Decoding framework that performs Calibration of token-level confidence across diffusion steps and leverages the calibrated results to guide decoding decisions. |
| Outcome: | Experiments on multiple DLLMs and benchmarks show that DecoCal improves generation accuracy compared to existing strategies. |
PURE: Post-hoc Unlocking and REfinement for Discrete Diffusion Decoding (2026.findings-acl)
Copied to clipboard
| Challenge: | Masked diffusion language models (MDLMs) are limited by a monotonic unmasking policy, where committed tokens cannot be revised. |
| Approach: | They propose a training-free inference algorithm for two-phase decoding that unlocks unstable regions through deterministic window masking and stochastic leftward relaxation. |
| Outcome: | The proposed algorithm significantly improves accuracy on reasoning benchmarks on GSM8K. |
TA-GRPO-d: Trajectory-Aware GRPO for Optimizing Denoising Trajectories in Diffusion LLMs (2026.acl-long)
Copied to clipboard
| Challenge: | Existing dLLMs rely on fixed denoising schedules and cannot learn efficient unmasking orders. |
| Approach: | They propose a framework that transforms dLLM decoding into a trajectory-aware policy . it uses a confidence-gated denoising strategy that decides which tokens to unmask . |
| Outcome: | The proposed model can learn which tokens to unmask and how many to unmak per step . it can learn the output quality and efficiency of the decoding path itself . |
Improving the Throughput of Diffusion-based Large Language Models via a Training-Free Confidence-Aware Calibration (2026.findings-acl)
Copied to clipboard
Jucheng Shen, Gaurav Sarkar, Yeonju Ro, Sharath Nittur Sridhar, Zhangyang Wang, Aditya Akella, Souvik Kundu
| Challenge: | CadLLM is a plug-and-play model-agnostic with KV caching based dLLMs. |
| Approach: | They propose a lightweight adaptive method that can control the generation block size, step size, and threshold based on the average confidence score of unmasked tokens. |
| Outcome: | The proposed method can increase throughput by up to 1.1-2.28x over the state-of-the-art model with competitive accuracy. |
SpecBound: Adaptive Bounded Self-Speculation with Layer-wise Confidence Calibration (2026.findings-acl)
Copied to clipboard
| Challenge: | Speculative decoding has emerged as a promising approach to accelerate autoregressive inference in large language models. |
| Approach: | They propose a self-draft framework that suppresses spurious confidence via layer-wise temperature annealing in early-exit decision and adaptively bounds speculation length based on token-wise decoding difficulty. |
| Outcome: | The proposed framework suppresses spurious confidence and bounds speculation length based on token-wise decoding difficulty. |
NeuroSym-Cal: Bridging the Reasoning-Execution Gap in Code Generation via Hierarchical Calibration (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing calibration methods rely on the assumption that consensus implies correctness . Existing methods fail under systematic errors, leading to miscalibrated high-confidence predictions. |
| Approach: | They propose a hierarchical calibration framework that measures confidence at two levels . they propose sensitivity analysis to measure local curvature of deductive process . |
| Outcome: | The proposed framework de-saturates overconfident errors and improves selective generation performance on OOD benchmarks. |
The Confidence Paradox: Unveiling the Latent Discriminative Power of Diffusion Large Language Models in Mathematical Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Diffusion large language models (DLLMs) are a promising alternative to autoregressive (AR) generation, offering token-level probabilities under bidirectional context. |
| Approach: | They propose to use diffusion large language models to generate token-level probabilities under bidirectional context and to examine the calibration paradox inherent to their native uncertainty estimates. |
| Outcome: | The proposed model outperforms AR baselines on mathematical reasoning benchmarks and is highly miscalibrated on reasoning benchmark. |
You Can Have a Second Chance: Unbiased and Multi-bit Watermarking for Diffusion Language Models with Regret-based Remasking (2026.acl-long)
Copied to clipboard
| Challenge: | Existing sequential LLMs cannot be directly applied to DLMs, as their generation order is arbitrary. |
| Approach: | They propose a stability-aware constraint that allows watermarking only in stable contexts and a bit-controlled, unbiased modulation to preserve the original DLM output distribution. |
| Outcome: | The proposed scheme achieves stable watermarking with minimal quality impact while maintaining high detection accuracy and multi-bit capacity. |
Calibrated Speculative Decoding: Frequency-Guided Candidate Selection for Efficient Inference (2026.acl-long)
Copied to clipboard
| Challenge: | Speculative decoding (SD) is a powerful and efficient way to accelerate autoregressive generation. |
| Approach: | They propose a training-free framework that recovers valid tokens discarded by standard verification . they use online correction memory and Semantic Consistency Gating to analyze rejections . |
| Outcome: | The proposed framework outperforms existing methods and achieves peak throughput speedup of 2.33x. |