parallel-decoding

Tag

Cards List
#parallel-decoding

Roll Out and Roll Back: Diffusion LLMs are Their Own Efficiency Teachers

arXiv cs.CL ↗ · 2026-05-19 Cached

This paper introduces WINO and WINO+, methods that enable revokable parallel decoding in diffusion LLMs and distill efficient denoising trajectories, significantly improving the quality-speed trade-off.

0 favorites 0 likes
#parallel-decoding

PSD: Pushing the Pareto Frontier of Diffusion LLMs via Parallel Speculative Decoding

arXiv cs.CL ↗ · 2026-05-18 Cached

This paper introduces Parallel Speculative Decoding (PSD), a training-free framework that accelerates diffusion LLM inference by jointly improving spatial and temporal efficiency, achieving up to 5.5× tokens per forward pass with comparable quality to greedy decoding.

0 favorites 0 likes
#parallel-decoding

@DivyanshT91162: Autoregressive LLMs might already be getting replaced Someone built dLLM — an open-source library that can turn ANY aut…

X AI KOLs Timeline ↗ · 2026-05-16 Cached

dLLM is an open-source library that converts any autoregressive LLM into a diffusion LLM, enabling parallel decoding and faster text generation.

0 favorites 0 likes
#parallel-decoding

Orthrus-Qwen3-8B : up to 7.8×tokens/forward on Qwen3-8B, frozen backbone, provably identical output distribution

Reddit r/LocalLLaMA ↗ · 2026-05-15

Introduces Orthrus, a method that injects a trainable diffusion attention module into a frozen autoregressive transformer to achieve up to 7.8× tokens per forward pass and ~6× wall-clock speedup on MATH-500, with provably identical output distribution to the base Qwen3-8B model. The approach requires minimal additional parameters and training, and avoids the TTFT penalty of external drafters.

0 favorites 0 likes
#parallel-decoding

LEAP: Unlocking dLLM Parallelism via Lookahead Early-Convergence Token Detection

arXiv cs.LG ↗ · 2026-05-13 Cached

This paper introduces LEAP, a training-free method to accelerate inference in Diffusion Language Models (dLLMs) by detecting early-converging tokens, reducing denoising steps by 30% without losing accuracy.

0 favorites 0 likes
#parallel-decoding

@JulieKallini: Fast Byte Latent Transformer is accepted to ICML 2026! Byte-level LMs promise to free us from subword tokenizers, but d…

X AI KOLs Following ↗ · 2026-05-11 Cached

The Fast Byte Latent Transformer (BLT-D) has been accepted to ICML 2026, introducing a text diffusion method for parallel byte-level decoding to overcome the speed limitations of traditional byte-level language models.

0 favorites 0 likes
#parallel-decoding

LACE: Lattice Attention for Cross-thread Exploration

arXiv cs.AI ↗ · 2026-04-20 Cached

LACE introduces a lattice attention mechanism that enables concurrent reasoning paths in LLMs to share intermediate insights and correct errors during inference, improving reasoning accuracy by over 7 points compared to standard isolated parallel sampling.

0 favorites 0 likes
#parallel-decoding

Cut Your Losses! Learning to Prune Paths Early for Efficient Parallel Reasoning

Hugging Face Daily Papers ↗ · 2026-04-17 Cached

This paper introduces STOP (Super Token for Pruning), a lightweight method that learns to prune unpromising reasoning paths early during parallel decoding by appending learnable tokens and reading KV cache states, achieving 70% token reduction while improving performance on AIME and GPQA benchmarks.

0 favorites 0 likes
#parallel-decoding

Youtu-Parsing: Perception, Structuring and Recognition via High-Parallelism Decoding

Papers with Code Trending ↗ · 2026-01-28 Cached

Youtu-Parsing is a document parsing model combining a dynamic-resolution ViT with a prompt-guided Youtu-LLM-2B, using token and query parallelism for 5-11x faster decoding while achieving SOTA on OmniDocBench and olmOCR-bench.

0 favorites 0 likes
← Previous
← Back to home

Submit Feedback