arXiv

Plan, Verify and Fill: A Structured Parallel Decoding Approach for Diffusion Language Models

Title: Plan, Verify and Fill: A Structured Parallel Decoding Approach for Diffusion Language Models

Original: arXiv:2601.12247v3 Announce Type: replace-cross Abstract: Diffusion Language Models (DLMs) present a promising non-sequential paradigm for text generation, distinct from standard autoregressive (AR) approaches. However, current decoding strategies often adopt a reactive stance, underutilizing the global bidirectional context to dictate global trajectories. To address this, we propose Plan-Verify-Fill (PVF), a training-free paradigm that grounds planning via quantitative validation. PVF actively constructs a hierarchical skeleton by prioritizing high-leverage semantic anchors and employs a verification protocol to operationalize pragmatic structural stopping where further deliberation yields diminishing returns. Extensive evaluations on LLaDA-8B-Instruct and Dream-7B-Instruct demonstrate that PVF reduces the Number of Function Evaluations (NFE) by up to 65% compared to confidence-based parallel decoding across benchmark datasets, unlocking superior efficiency without compromising accuracy.

Rewrite: Diffusion Language Models (DLMs) offer a compelling alternative to traditional autoregressive (AR) methods by enabling non-sequential text generation. Despite this potential, existing decoding mechanisms tend to be reactive, failing to fully leverage global bidirectional context to guide the overall generation trajectory. In response, we introduce Plan-Verify-Fill (PVF), a training-free framework that anchors its planning process through quantitative validation. PVF builds a hierarchical structure by focusing on high-impact semantic anchors and utilizes a verification protocol to implement a pragmatic stopping criterion, halting the process when additional deliberation provides minimal benefit. Our extensive testing on LLaDA-8B-Instruct and Dream-7B-Instruct models reveals that PVF decreases the Number of Function Evaluations (NFE) by as much as 65% relative to confidence-based parallel decoding across various benchmarks. This approach achieves significant gains in efficiency while maintaining high accuracy.


Source: arXiv Generated at: 2026-06-03 00:00:00 UTC

Related Articles

TikTok Billionaire Tops Ambani as Asia’s Second-Richest
Bloomberg

TikTok Billionaire Tops Ambani as Asia’s Second-Richest

TikTok founder surpasses Mukesh Ambani to become Asia’s second-richest person, marking a significant shift in the region...

Publishers in UK can opt out of Google AI search results
BBC News

Publishers in UK can opt out of Google AI search results

UK publishers can now opt out of Google’s AI search summaries, a CMA ruling designed to boost their bargaining power and...

Kioxia Edges Nearer Toyota’s Market Cap in Shakeup to Japan Inc.
Bloomberg

Kioxia Edges Nearer Toyota’s Market Cap in Shakeup to Japan Inc.

Kioxia’s market cap nears Toyota’s, signaling a major shift in Japan’s corporate hierarchy. This narrowing gap highlight...

Reuters

Morning Bid: Marvell, a fitting name for the latest AI darling

Reuters highlights Marvell as a top AI stock, noting its name perfectly suits its status as the newest market darling.

Financial Times

Tim Hayward: I built the Jaguar E-Type of computer keyboards

Tim Hayward compares his bespoke keyboard designs to the Jaguar E-Type. He explores high-end customization for personal ...

Financial Times

AI Labs: Zuckerberg’s $100bn gamble

Meta’s $100 billion AI investment aims to secure AI dominance, but questions remain whether sheer spending can outpace c...