mlsanityData to 14 Oct 2026

Reward-Shifted Speculative Sampling Is An Efficient Test-Time Weak-to-Strong Aligner

arXiv 2508.15044 ↗First posted 20 Aug 2025cs.CLcited by 4

On the map: LLM alignment / RLHF / preference optimisation → LLM preference optimization methods

also in 1 more
Abstract (arXiv)

Aligning large language models (LLMs) with human preferences has become a critical step in their development. Recent research has increasingly focused on test-time alignment, where additional compute is allocated during inference to enhance LLM safety and reasoning capabilities. However, these test-time alignment techniques often incur substantial inference costs, limiting their practical application. We are inspired by the speculative sampling acceleration, which leverages a small draft model to efficiently predict future tokens, to address the efficiency bottleneck of test-time alignment. We introduce the reward-shifted speculative sampling (SSS) algorithm, in which the draft model is aligned with human preferences, while the target model remains unchanged. We theoretically demonstrate that the distributional shift between the aligned draft model and the unaligned target model can be exploited to recover the RLHF optimal solution without actually obtaining it, by modifying the acceptance criterion and bonus token distribution. Our algorithm achieves superior gold reward scores at a significantly reduced inference cost in test-time weak-to-strong alignment experiments, thereby validating both its effectiveness and efficiency.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in LLM preference optimization methods, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 25 of its 38 references that are in the map. First posted on arXiv 20 Aug 2025.

Builds on

25 of 38 references.

Closest ancestors · 5

Same direction, newest first

  1. 2024TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling18 Oct
  2. 2024Your Weak LLM is Secretly a Strong Teacher for Alignment13 Sep
  3. 2024Cascade Reward Sampling for Efficient Decoding-Time Alignment24 Jun
  4. 2024ARGS: Alignment as Reward-Guided Search23 Jan
  5. 2023Aligning Language Models with Preferences through f-divergence Minimization16 Feb

Other references · 20

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
  3. 2017Deep reinforcement learning from human preferencescited by 3,912
  4. 2020Learning to summarize from human feedbackcited by 2,588
  5. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,653
  6. 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 1,006
  7. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 843
  8. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertaintycited by 578
  9. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verificationcited by 365
  10. 2023Toxicity in ChatGPT: Analyzing Persona-assigned Language Modelscited by 360
  11. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  12. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decodingcited by 298
8 more
  1. 2023How is ChatGPT's behavior changing over time?cited by 270
  2. 2024Fast Best-of-N Decoding via Speculative Rejectioncited by 112
  3. 2025Reward-Guided Speculative Decoding for Efficient LLM Reasoningcited by 106
  4. 2022On Reinforcement Learning and Distribution Matching for Fine-Tuning Language Models with no Catastrophic Forgettingcited by 82
  5. 2024Creativity Has Left the Chat: The Price of Debiasing Language Modelscited by 29
  6. 2025Training Domain Draft Models for Speculative Decoding: Best Practices and Insightscited by 10
  7. 2024Constrained Decoding with Speculative Lookaheadscited by 6
  8. 2025Performance Review on LLM for solving leetcode problemscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Sample, Don't Search: Rethinking Test-Time Alignment for Language Models
  2. 2025Guided Speculative Inference for Efficient Test-Time Alignment of LLMs
  3. 2026Gradient-Guided Reward Optimization for Inference-time Alignment
  4. 2024GenARM: Reward Guided Generation with Autoregressive Reward Model for Test-time Alignment
  5. 2025Test-Time Preference Optimization: On-the-Fly Alignment via Iterative Textual Feedback
  6. 2025Towards Bridging the Reward-Generation Gap in Direct Alignment Algorithms
  7. 2026Revisiting the (Sub)Optimality of Best-of-N for Inference-Time Alignment
  8. 2024Sample-Efficient Alignment for LLMs