Skip to main content
Search

# Parallel Decoding

6 related articles

Subscribe to updates
  1. arXiv

    Diffusion language models without pretraining from scratch: LoRA-only conversion turns four autoregressive models diffusive in hours on one GPU

    BYOD is a LoRA-only recipe for converting autoregressive language models into diffusion language models: every base parameter stays frozen, each layer's causal mask becomes bidirectional, and a masked-diffusion objective trains at most 102.4M tokens in 3.1–4.0 hours on one Google Colab GPU, turning Gemma 2 9B, Llama 3.1 8B, Qwen2.5 7B and Ministral 8B into models that generate from fully masked sequences, with adapters at 4.1–5.8% of final parameters. The strongest conversion, BYOD-Gemma, reaches 50.6% average accuracy on nine tasks against 51.9% for LLaDA 8B Instruct in the same harness; open-generation quality at low NFE budgets remains the main limitation.

  2. arXiv

    Diffusion LLMs lose accuracy fast at high parallelism; RePara trains two-token blocks and lifts GSM8K from 28.20 to 68.54

    Diffusion language models lose much of their accuracy when committing many tokens per step, and RePara reinforces short consecutive token blocks with group-relative policy optimization, raising LLaDA's GSM8K accuracy at Diff#16 from JustGRPO's 28.20 to 68.54.

  3. arXiv

    WaveFront Decoding fuses drafting and verification into the same recurrent call, speeding up decoding 2.42x on Ouro-2.6B and 3.54x on Huginn-3.5B

    The work introduces WaveFront Decoding (WFD), a training-free self-speculative decoding framework for looped language models that exploits two properties of these architectures, namely that intermediate recurrence outputs provide effective draft predictions and that weight sharing lets token states at different positions and recurrence depths be processed in one batched recurrent-block call, organizing these mixed-depth states into a diagonal wavefront so that drafting and verification proceed concurrently within the same recurrent calls while rejected drafts are corrected using full-depth predictions; across six Spec-Bench task categories it achieves 2.42x speedup on Ouro-2.6B and 3.54x on Huginn-3.5B over autoregressive decoding, rising to 4.81x on Huginn-3.

  4. USTC and Baidu team survey parallel reasoning: a unified formal framework maps non-interactive, interactive, and efficiency methods into one roadmap

    This survey defines parallel reasoning as a three-stage inference paradigm of decomposition, parallel processing, and aggregation, gives a formal formulation and distinguishes it from Chain-of-Thought and long-thinking, then organizes representative methods along three lines—non-interactive (self-consistency, Best-of-N ranking, structured reasoning), interactive (intra-model and multi-agent interaction), and efficiency (parallel decoding, parallel function calling, speculative decoding)—and summarizes applications, core challenges, and future directions.

  5. First systematic empirical study of diffusion LLMs for code generation: 7 diffusion models reach 79.1% on MBPP+ versus 73.3% for the best autoregressive baseline, yet open-source diffusion models still do not consistently match strong autoregressive models

    This study empirically evaluates 7 representative diffusion LLMs (including the closed-source Mercury-Coder-Small) against 4 open-source autoregressive baselines on HumanEval/HumanEval+, MBPP/MBPP+, HumanEval-X, LiveCodeBench, RepoQA, RepoBench-C, and SWE-Bench Verified, finding promising but uneven code-generation ability: the closed-source diffusion model leads on most benchmarks (e.g., 79.1% on MBPP+ versus 73.

  6. arXiv

    Flash-dLLM: I/O-Aware KV Caching and Parallel Decoding for Fast, Memory-Efficient Diffusion LLMs

    Flash-dLLM is a training-free inference acceleration framework for diffusion large language models: it pairs an I/O-aware fused KV-cache kernel — folding QKV projection, RoPE and cache writes together in SRAM and writing keys and values straight into the cache — with scheduled Flash Attention to ease GPU memory-traffic bottlenecks, keeps only a small set of most-attended tokens through selective cache updates, and lets the dLLM serve as both drafter and verifier (Flash-Verify); evaluated on LLaDA-1.5 across GSM8K, MATH, HumanEval and MBPP, it reports 5.1× and 11.0× speedups over the strongest baseline Elastic-Cache on GSM8K and HumanEval while preserving generation quality.

You’re all caught up