paper-with-me

Papers

Reward-Guided Speculative Decoding for Efficient LLM Reasoning

2025-01-31 · Baohao Liao, Yuhui Xu, Hanze Dong, Junnan Li, Christof Monz, Silvio Savarese, Doyen Sahoo, Caiming Xiong

We introduce Reward-Guided Speculative Decoding (RSD), a novel framework aimed at improving the efficiency of inference in large language models (LLMs). RSD synergistically combines a lightweight draft model with a more powerful target model, incorporating a controlled bias to prioritize high-reward outputs, in contrast to existing speculative decoding methods that enforce strict unbiasedness. RSD employs a process reward model to evaluate intermediate decoding steps and dynamically decide whether to invoke the target model, optimizing the trade-off between computational cost and output quality. We theoretically demonstrate that a threshold-based mixture strategy achieves an optimal balance between resource utilization and performance. Extensive evaluations on challenging reasoning benchmarks, including Olympiad-level tasks, show that RSD delivers significant efficiency gains against decoding with the target model only (up to 4.4x fewer FLOPs), while achieving significant better accuracy than parallel decoding method on average (up to +3.5). These results highlight RSD as a robust and cost-effective approach for deploying LLMs in resource-intensive scenarios.

📄 PDF Abstract BibTeX arXiv:2501.19324

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Guided Speculative Inference for Efficient Test-Time Alignment of LLMs

2025-06-04 · Jonathan Geuter, Youssef Mroueh, David Alvarez-Melis

We propose Guided Speculative Inference (GSI), a novel algorithm for efficient reward-guided decoding in large language models. GSI combines soft best-of-$n$ test-time scaling with a reward model $r(x,y)$ and speculative…

Math

From Tokens to Steps: Verification-Aware Speculative Decoding for Efficient Multi-Step Reasoning

2026-04-16 · Kiran Purohit, Ramasuri Narayanam, Soumyabrata Pal arxiv

Speculative decoding (SD) accelerates large language model inference by allowing a lightweight draft model to propose outputs that a stronger target model verifies. However, its token-centric nature allows erroneous step…

Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration

2026-05-11 · Shuzhang Zhong, Haochen Huang, Shengxuan Qiu, Pengfei Zuo 외 arxiv

Tree-of-Thought (ToT) reasoning structures Large Language Model (LLM) inference as a tree-based search, demonstrating strong potential for solving complex mathematical and programming tasks. However, its efficiency is co…

Calibrated Speculative Decoding: Frequency-Guided Candidate Selection for Efficient Inference

2026-04-15 · Xuwen Zhou, Fangxin Liu, Chao Wang, Xiao Zheng 외 arxiv

Speculative decoding accelerates autoregressive generation by letting draft tokens bypass full verification, but conventional frameworks suffer from frequent false rejections, particularly when draft models produce seman…

Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing

2026-05-14 · Jie Jiang, Xing Sun, Ruotian Chen, Jianan Su 외 arxiv

Speculative decoding accelerates LLM inference by having a lightweight draft model propose speculative windows of candidate tokens for parallel verification by a larger target model. In practice, speculative efficiency i…

Reinforcement Learning