Information-Guided Frontier Decoding: Contextual Utility-Driven Commitment in dMLLMs

Xingyou Fang; Jingxing Zhong; Xiaosong Yuan; Xiaofeng Zhang

cs.CLAug 27, 2026

Information-Guided Frontier Decoding: Contextual Utility-Driven Commitment in dMLLMs

Authors: Xingyou Fang, Jingxing Zhong, Xiaosong Yuan, Xiaofeng Zhang

Organizations: Fuzhou University · Jilin University · Shanghai Jiao Tong University

Abstract

Decoding quality in diffusion multimodal language models (dMLLMs) depends heavily on the order in which masked tokens are committed. Existing confidence-based strategies prioritize locally easy tokens, but confidence does not necessarily reflect contextual usefulness. As a result, structurally easy tokens such as punctuation may be committed before informative semantic anchors, weakening context propagation and increasing error accumulation. We propose Information-Guided Frontier Decoding (IGFD), a training-free decoding strategy that ranks candidates using token confidence, neighborhood uncertainty, and structural commitment risk. IGFD encourages early commitment of reliable semantic anchors while delaying fragile structural tokens, improving contextual support during decoding. A dynamic candidate frontier further constrains token selection to locally expandable regions under the same decoding budget. The method requires no additional training, auxiliary models, or extra forward passes. Experiments across multimodal understanding, reasoning, grounding, and hallucination benchmarks show that IGFD consistently outperforms existing decoding strategies across the majority of benchmarks and diffusion MLLM backbones under identical decoding budgets.

Figures & tables

Figure 1: Confidence-only decoding may commit locally easy but low-utility tokens too early, while delaying content-bearing anchors that are more helpful for resolving nearby masked positions.

Figure 2: Single-token intervention. Each subplot compares local entropy profiles before and after committing exactly one token. The x-axis denotes relative position to the committed token. The semantic anchor “Starbucks” produces the largest local entropy reduction, the date token “2024” produces a moderate reduction, and punctuation produces minimal change.

Figure 3: Single-token intervention on nearby ground-truth NLL. After committing one token, we measure the change in NLL of neighboring correct tokens. Semantic tokens such as “mug” and “is” reduce local NLL, whereas the structural token “.” provides little benefit and may increase prediction loss.

Figure 4: Framework of IGFD. Given a partially masked sequence, IGFD first builds a dynamic candidate frontier, then computes confidence, entropy-based neighborhood need, and structural risk for each candidate. These signals are combined into an information-guided commitment score, which selects the top-ranked tokens to commit and then expands the frontier for the next denoising step.

Model	Method	LLaVA-Bench				CHAIR			MathVista	ScienceQA	MME		GQA
Model	Method	all $\uparrow$	conv $\uparrow$	detail $\uparrow$	complex $\uparrow$	$C_{S}\downarrow$	$C_{i}\downarrow$	recall $\uparrow$	acc $\uparrow$	acc $\uparrow$	cog. $\uparrow$	perc. $\uparrow$	EM $\uparrow$
LLaDA-V	Original	50.4	43.4	57.5	63.6	5.6	4.0	36.6	30.8	79.2	338.6	1411.4	52.3
	AdaBlock	71.8	59.7	68.8	79.2	5.8	4.3	37.3	32.3	81.2	350.8	1412.6	52.6
	Wavefront	71.6	61.6	71.7	75.9	5.3	5.2	34.2	33.4	81.8	355.7	1397.5	51.7
	IGFD	72.8	63.1	74.6	80.8	5.2	3.7	37.1	34.2	82.7	363.6	1422.7	53.7
MMaDA	Original	35.1	34.4	39.7	33.7	24.6	11.3	39.5	23.5	50.2	232.6	843.9	39.4

Table 1: Comparison of different methods across multiple benchmarks.

Figure 5: Analysis of decoding behavior and commitment dynamics. Metrics are tracked across normalized decoding progress intervals. (a) illustrates the frequency of high-need tokens (top 20% uncertainty); (b) shows the punctuation commitment rate per interval; (c) displays the cumulative frequency of committed content-bearing tokens. IGFD significantly prioritizes critical content over structural tokens in early decoding stages.

Variant	$C_{S}\downarrow$	$C_{i}\downarrow$	Recall $\uparrow$
Confidence only	12.3	8.4	37.0
w/o neighborhood need	10.3	6.7	37.5
w/o structural penalty	10.3	6.7	37.6
w/o dynamic frontier	10.2	6.6	37.7
Full IGFD	9.7	6.4	37.9

Table 2: Ablation study of IGFD on CHAIR, averaged over three dMLLMs.

Method	Precision $\uparrow$	Recall $\uparrow$	F1 $\uparrow$
Original	0.842	0.834	0.838
AdaBlock	0.856	0.849	0.852
Wavefront	0.861	0.854	0.857
IGFD	0.873	0.866	0.869

Table 3: Semantic quality evaluation on WikiText using BERTScore. Higher scores indicate better semantic fidelity to reference text.

Appendix figures & tables2 assets

Supplementary material from the paper’s appendix.

Appendix

Model	Variant	LLaVA-Bench				CHAIR			MathVista
Model	Variant	all $\uparrow$	conv $\uparrow$	detail $\uparrow$	complex $\uparrow$	$C_{S}\downarrow$	$C_{i}\downarrow$	recall $\uparrow$	acc $\uparrow$
LLaDA-V	Confidence	50.4	43.4	57.5	63.6	5.6	4.0	36.6	30.8
	w/o neighborhood need	71.7	61.9	73.1	79.1	5.3	3.8	37.0	33.5
	w/o structural penalty	72.1	62.4	73.8	79.7	5.4	3.9	36.9	33.7
	w/o dynamic frontier	72.0	62.2	73.5	79.5	5.4	3.9	37.0	33.6
	Full IGFD	72.8	63.1	74.6	80.8	5.2	3.7	37.1	34.2

Appendix

Table 4: Ablation study of IGFD components across three dMLLMs.

Figure 6: Hyperparameter sensitivity analysis of the proposed decoding strategy. We evaluate four key hyperparameters: (a) the confidence weight

\alpha

, (b) the neighborhood utility weight

\beta

, (c) the structural penalty weight

\gamma

, and (d) the neighborhood radius

r

. Each curve reports the average performance across three diffusion-based multimodal language models, including LLaDA-V, MMaDA, and LaViDa. The results show that moderate values of

\alpha

\beta

, and

\gamma

generally achieve better trade-offs across perception, reasoning, and hallucination-related metrics, while an overly large structural penalty or neighborhood radius may degrade performance. The dashed vertical line in each subfigure indicates the selected default setting used in our main experiments.

Diffusion Language Model Decoding

Diffusion language model decoding generates text through iterative parallel refinement, balancing fewer denoising steps with accuracy, coherence, and control.

See all 247 papers

Context-Aware Cluster Decoding: Semantic Anchor-Driven Coherence in dMLLMs
Aug 23, 2026Yikai Zhao, Qiyan Zhao, Jiaquan Zhang +3Diffusion Language Model Decoding Long-Form Document Generation
Sun Yat-sen University · Shanghai Jiao Tong University · University of Electronic Science and Technology of China +2
Visual Information-Guided Parallel Decoding for Diffusion Multimodal Large Language Models
Aug 27, 2026Insu Lee, Wooje Park, Wonseok Shin +2Diffusion Language Model Decoding Parallel Decoding
Seoul National University
Supportive Token Revealing for Fast Diffusion Language Model Decoding
Jun 2, 2026Giries Abu Ayoub, Mario Barbara, Lluís Pastor-Pérez +4Masked Diffusion Models Diffusion Language Model Decoding
Department of Computer Science, University of Haifa · Institute for AI, University of Stuttgart · IMPRS-IS

Aug 23, 2026J/K move · Enter open · S save

Context-Aware Cluster Decoding: Semantic Anchor-Driven Coherence in dMLLMs

Yikai Zhao, Qiyan Zhao, Jiaquan Zhang, Xiaofeng Zhang+2

Sun Yat-sen University · Shanghai Jiao Tong University · University of Electronic Science and Technology of China+2

Diffusion Language Model Decoding Long-Form Document Generation Multimodal Hallucination

Open paper AskPDF arXiv

Diffusion multimodal large language models (dMLLMs) frequently produce long-form outputs marred by semantic drift and repetition, with quality generally degrading as output length increases. We identify two structural deficiencies in existing decoding methods as primary drivers of these failures: confidence-based scoring ignores decoded-neighbor support, and block partitioning prevents access to high-readiness semantic anchors, together causing tokens to be committed before their local context is sufficiently established. We propose \ours{} (Context-Aware Cluster Decoding), a training-free decoding method that scores each masked position by a multiplicative composite of softmax confidence and neighbor proximity, promoting contextually ready tokens above isolated candidates while suppressing low-confidence positional noise, operating block-free to keep high-readiness anchors globally accessible. \ours{} further applies architecture-aware calibration to handle confidence heterogeneity induced by diverse visual integration strategies. Experiments on three dMLLMs across four benchmarks demonstrate consistent quality gains and hallucination reduction over Original, with larger gains in several longer generation settings, highlighting the importance of neighbor support and visual integration strategy for future dMLLM decoding method design. Our code is openly available at https://github.com/zhaoyk-sysu/CACD-dMLLM.

Abstract

Diffusion Language Model Decoding

Explore similar work

Context-Aware Cluster Decoding: Semantic Anchor-Driven Coherence in dMLLMs

Visual Information-Guided Parallel Decoding for Diffusion Multimodal Large Language Models

Supportive Token Revealing for Fast Diffusion Language Model Decoding