Skip to content

CARVE: Verified Expansion for Variable-Length Generation in Diffusion Language Models

Aug 2026 · 0 citations · 20 references
Computer Science

TL;DR

CARVE (Counterfactual-Aware Reveal with Verified Expansion), a training-free variable-length algorithm for masked diffusion LMs that consistently improves average performance over fixed-length baselines across all evaluated model families.

Abstract

Masked diffusion language models predict tokens from a partially observed response canvas, enabling bidirectional conditioning and parallel token refinement. Yet standard masked-diffusion decoders use a rigid inference interface: the number of masked positions allocated to the answer is fixed before generation begins. Choosing this length is difficult. A short canvas can truncate reasoning or code, while a long canvas wastes computation and can perturb denoising. We introduce CARVE (Counterfactual-Aware Reveal with Verified Expansion), a training-free variable-length algorithm for masked diffusion LMs. Starting from a shorter canvas, CARVE can grow the response during decoding by inserting additional [MASK] positions. Rather than keeping every insertion, CARVE tests a candidate expanded canvas and asks a counterfactual question: would the model make similar predictions for the unresolved positions in the original canvas if the extra masked space were present? The inserted masks are kept only when they induce low Jensen-Shannon (JS) divergence on aligned unresolved positions. This makes length growth a verified stability decision rather than a pure confidence heuristic. CARVE applies without retraining to both full-canvas and blockwise diffusion decoders. Across code generation and mathematical reasoning benchmarks, CARVE consistently improves average performance over fixed-length baselines across all evaluated model families. Crucially, CARVE achieves these accuracy gains while reducing inference cost, reaching half the FLOPs of fixed-length decoding in some settings.

View source

Similar papers

Preprint Jul 2026

CORA-Diff: Confidence-Oriented Residual Acceptance for Efficient Diffusion Language Model Inference

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...

Yifan Wu, Yu-Feng Zhang, Kenli Li · 0 citations
#natural language process... Preprint Aug 2026

Ripple-Pivot Search: Active Parallel Decoding for Diffusion Large Language Models

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
Preprint Aug 2026

Dependency-Aware Revocable Decoding for Efficient Diffusion Large Language Model Inference

DARD is proposed, a training-free framework that separates tokens into masked, candidate, and unmasked states and adaptively regulates their influence on subsequent decoding, and consistently improves the speed-quality Pareto frontier over recent revocable decoding methods.

Woo-Soon Park, Insu Lee, Minyoung Noh et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Predict, Don't Iterate: Efficient Adaptive-Length Infilling for Diffusion Language Models

PILL (Probing-based InfiLling with preset-Length-free decoding), an efficient infilling method for DLMs that requires no preset initial length and adds far fewer extra forward passes than baselines, substantially reducing inference time is proposed.

Hao-Bo Xu, Si-Rui Chen, Yuan-Chen Bei et al. · 5 citations
#artificial intelligence Preprint Aug 2026

Beyond Token Positions: Safety Alignment Across Denoising Steps in Diffusion Language Models

This paper measures dLLM safety behavior under harmful prompts by tracing intermediate token distributions and commitment decisions throughout denoising, and proposes Refusal-Aware Early Commitment (RAEC), a simple training-free decoding method that commits persistent refusal signals from early steps.

Guoli Wang, Haonan Shi, Tu Ouyang et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.