← Latest papers
💬 NLP

Rethinking the Generation Order of Block Diffusion Language Models

This paper introduces Parallel Autoregressive Decoding (PARD), a training-free sampling method that leverages the inherent left-to-right alignment of block diffusion language models to achieve faster generation speeds with minimal quality loss compared to pure autoregressive decoding.

Original authors: Kai Syun Hou, James Kwok

Published 2026-07-28
📖 8 min read🧠 Deep dive

Original authors: Kai Syun Hou, James Kwok

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to teach a robot how to write a story. For a long time, the best way to do this was to make the robot write one word at a time, from left to right, just like a human reading a book. This method, called "autoregressive" generation, is very reliable but can be slow, like a single person typing a novel on a typewriter. Recently, scientists discovered a new way called "diffusion," which is more like a painter starting with a blank canvas covered in static noise and gradually cleaning it up until a clear picture appears. This new method allows the robot to guess many words at once, potentially writing much faster. However, there's a catch: while this "noise-cleaning" method is great at being flexible, it sometimes gets confused about the order of words, leading to gibberish. The big question for researchers is: how do we get the speed of the painter without losing the logical flow of the typewriter?

This paper tackles that exact puzzle by looking at a specific, newer version of these "noise-cleaning" models called Block Diffusion Language Models (BDLMs). The authors, Kai Syun Hou and James Kwok, discovered something surprising: even though these models are built to be flexible and guess words in any order, they actually "think" much more like the old-fashioned left-to-right typewriter than anyone expected. They found that forcing these models to stick to a strict left-to-right order, while still allowing them to guess a few words at a time, creates a perfect sweet spot. They call this new method PARD (Parallel Autoregressive Decoding). Think of it as a team of writers who agree to write in order, but instead of waiting for one person to finish a whole sentence before the next starts, they all jump in to finish the next few words simultaneously if they are confident enough. The result? The robot writes significantly faster than the old slow method, but the story stays just as logical and high-quality.

The Story of the "Noise-Cleaning" Robot

To understand why this matters, let's picture two different ways a robot might try to write a sentence.

The Old Way (Autoregressive): Imagine a robot that writes a story one letter at a time. It writes "T", then "h", then "e", then " ". It can't write the next word until it has finished the current one. It's very careful and rarely makes mistakes, but it's slow. It's like a single person typing a novel; they can't type the last page until they've finished the first.

The New Way (Diffusion): Now imagine a robot that starts with a sentence where every word is replaced by a question mark (or a "mask"). Its job is to look at the whole sentence and guess what the missing words should be. It doesn't have to guess them in order. It could guess the last word first, then the first word, then the middle. This is like a painter looking at a messy, blurry canvas and trying to figure out what the final image is. The advantage is speed: the robot can fix many parts of the sentence at the same time. The disadvantage is that if it guesses the end of the sentence before the beginning, it might get the context wrong and produce nonsense.

For a while, scientists tried to make the "noise-cleaning" robot work by letting it guess words in whatever order it wanted, hoping it would figure out the best path. But the authors of this paper noticed something weird. They tested a new type of robot called a Block Diffusion Language Model (BDLM). These robots are special because they are trained to work in chunks (blocks) of text, using the clean text from previous chunks to help guess the next chunk.

The Big Discovery: The Robot Prefers Order

The authors ran a series of experiments to see how these robots actually behave. They compared a standard "noise-cleaning" robot (LLaDA) with the newer "block" robot (SDAR).

They found that the standard robot really does like to guess words in random orders. But the new block robot behaves very differently. Even though it can guess words in any order, it naturally prefers to guess them from left to right, just like the old typewriter robot.

To prove this, they looked at the "confidence" of the robot. If you ask a robot to guess the next word, it usually has a "confidence score" for each possibility. The authors found that for the block robot, the most confident guesses were almost always the words at the very beginning of the remaining sentence. It's as if the robot has a secret habit: "I know I can jump around, but I really feel most comfortable starting from the left."

They even did some math to explain why this happens. They realized that during training, the block robot is shown a lot of examples where the left side of the sentence is already written, and it only has to guess the right side. This is exactly how the old "typewriter" robot learns. The standard "noise-cleaning" robot, on the other hand, is trained on sentences where words are missing all over the place, so it never really learns to rely on the left side first. Because the block robot is trained this way, it "wants" to be left-to-right.

The Solution: PARD (The Team of Writers)

So, if the block robot naturally wants to go left-to-right, why not just make it go left-to-right? The problem is that if it goes strictly left-to-right, it loses the speed advantage of guessing multiple words at once. It becomes slow again.

The authors came up with a clever solution called PARD (Parallel Autoregressive Decoding).

Imagine a group of writers working on a story together.

  1. The Rule: They must write in order, from left to right.
  2. The Twist: Instead of waiting for one person to finish a word before the next starts, they all look at the next few words. If they are very confident about the next word, they write it. If they are also very confident about the word after that, they write that one too.
  3. The Safety Net: If they aren't sure about the second word, they stop. They don't guess the second word just to be fast; they wait until they are sure.

This is what PARD does. It looks at the robot's confidence scores. If the robot is confident about the first masked word, it writes it. Then it immediately checks if the robot is also confident about the next word. If yes, it writes that too. It keeps going down the line, writing a "prefix" of confident words, until it hits a word where the robot is unsure.

The Results: Fast and Accurate

The authors tested this new method on three different block robots and six different tasks, including writing code and solving math problems.

  • Speed: PARD was much faster than the old "typewriter" method. In some cases, it was 3.64 times faster on one of the models. It wrote tokens (chunks of text) at a rate of up to 152 tokens per second, compared to just 70 for the slow method.
  • Quality: Despite being faster, the stories and code it wrote were just as good, and often better, than other fast methods that tried to guess words in random orders. In fact, on the SDAR model, PARD was actually better than the random-order methods, scoring 81.1% on a coding test compared to 75.0% for the random method.
  • The Comparison: They compared PARD to other fancy "fast" methods that use complex rules to decide which words to guess. PARD consistently beat them all. The complex methods were like trying to solve a puzzle by jumping around randomly; PARD was like solving it by following the edge pieces first, which turned out to be the most efficient path for these specific robots.

Why This Matters

The paper suggests that for these newer "block" robots, the old idea of "guessing in any order" isn't actually the best way to go. The robots are naturally biased toward left-to-right thinking because of how they were trained. By respecting that bias and only adding parallel speed when the robot is sure, we get the best of both worlds: the speed of a team of writers and the accuracy of a careful typist.

The authors are careful to note that this is a "training-free" method. They didn't have to retrain the robots or change their brains; they just changed how they asked the robots to write. This makes it a very practical tool that can be used right now with existing models.

In short, the paper shows that sometimes, the fastest way to move forward is to remember to move in a straight line, but to take bigger steps when you're sure of where you're going.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →