Abstract
DRLMs refine draft answers via parallel token revisions and a single-pass cavity energy evaluation, outperforming autoregressive and diffusion baselines on reasoning tasks.
Drafting an answer allows a reasoning model to reconsider each decision in the context of the others. Yet repeated diffusion denoising does not ensure that individually plausible token updates form a better answer together. We introduce Draft Refinement Language Models (DRLMs), which use a single denoiser to propose parallel revisions and evaluate a candidate draft. We train the denoiser to reconstruct every token from uniformly corrupted drafts, teaching both preservation and repair. Its predictions specify revisions directly, without a diffusion reverse transition. Evaluation requires a different use of these predictions: confidence in an existing token reflects both contextual support and evidence from observing the token itself. Using the known corruption process, we correct for this self-token evidence to estimate how well each token is supported by the prompt and the remaining draft. Aggregating these estimates yields a cavity energy computed in one forward pass, without an additional scoring model. Each round proposes a revision, reads the completed candidate in its revised context, and retains it only if its energy is lower. Across Countdown, Sudoku-Extreme, and Maze-Hard, our method outperforms autoregressive and discrete diffusion baselines. With 6M parameters, DRLM reaches 44.4% on Countdown-5 and 93.9% on Sudoku-Extreme. The results establish complete-draft parallel refinement as an effective alternative to reverse diffusion for complex reasoning.
Community
We introduce Draft Refinement Language Models (DRLMs), a new approach to parallel reasoning that generates a complete draft and iteratively refines it, rather than generating tokens sequentially or following a diffusion reverse process.
DRLM uses a single denoiser to propose parallel revisions and evaluate the resulting drafts. We derive a cavity-energy score that measures how well each token is supported by its surrounding context, allowing the model to retain better-scoring drafts without a separate verifier or scoring model.
Across Countdown, Sudoku-Extreme, and Maze-Hard, DRLM outperforms autoregressive and discrete diffusion baselines. With just 6M parameters, it achieves 44.4% on Countdown-5, 93.9% on Sudoku-Extreme, and 73.0% on Maze-Hard, outperforming the strongest diffusion baselines by 34.1, 28.4, and 33.7 percentage points, respectively.
Our results highlight complete-draft refinement as a promising alternative to conventional diffusion decoding, enabling reasoning through parallel revision and explicit evaluation of candidate solutions.
Get this paper in your agent:
hf papers read 2610.26542 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper