← Back to all news
arXiv Computation and Language By Zhixuan Liu, Zhichen Dong, Yuanfu Wang, Chao Yang

Decoupled Contrastive Decoding via Expert-Aligned Drafting

Read the original on arXiv Computation and Language →

The paper introduces Decoupled Contrastive Decoding (DCD), a method that separates drafting from verification in contrastive decoding. DCD uses an expert‑aligned lightweight proposer for drafting and applies contrastive correction only during verification, preserving the vanilla contrastive decoding distribution. Experiments on 8B models show that DCD achieves 1.65–1.95× speedups in greedy decoding and reduces MMLU proposal‑path latency by 5–12× compared to amateur‑coupled approaches.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

Related stories

arXiv Computation and Language
Sep 4

Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding

The paper introduces AdaptiveSpec, a training‑free speculative decoding method that simultaneously adapts the per‑step verification rule and the draft‑tree shape using signals generated during decoding. It replaces the fixed token‑match rule with a margin‑based threshold and adjusts tree depth, width, and node count based on draft confidence and recent acceptance history, allowing the total draft count to vary. Experiments on SGLang show up to 56% throughput gains over EAGLE‑3 while maintaining 93% of lossless task accuracy on GSM8K, MATH‑500, and HumanEval across three models.

By Oszk\'ar Urb\'an, Young D. Kwon, Stylianos I. Venieris, Cecilia Mascolo
llmsefficiencybenchmarks
More like this →
arXiv Computation and Language
Sep 24

When Parallel Drafter Meets Parallel Speculative Decoding

The paper introduces DPara, a parallel speculative decoding framework that builds on DSpark-style parallel drafters. DPara eliminates the need for probabilistic guesses by precomputing draft representations for every acceptance boundary and using a lightweight autoregressive head to combine verification outcomes with these representations, enabling full parallelization of the backbone forward pass. Experiments on Qwen3-8B and Qwen3-14B across multiple benchmarks demonstrate average speedups of 3.21× and 3.52× over autoregressive decoding, outperforming existing serial and parallel speculative decoding methods.

By Fuliang Liu, Xue Li, Kun Qian, Zhibin Wang, Wanchun Dou, Wenyuan Yu, Chen Tian
diffusionbenchmarks
More like this →