REVIEW 5 cited by
Transfer Q Star: Principled Decoding for LLM Alignment
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Aligning foundation models is essential for their safe and trustworthy deployment. However, traditional fine-tuning methods are computationally intensive and require updating billions of model parameters. A promising alternative, alignment via decoding, adjusts the response distribution directly without model updates to maximize a target reward $r$, thus providing a lightweight and adaptable framework for alignment. However, principled decoding methods rely on oracle access to an optimal Q-function ($Q^*$), which is often unavailable in practice. Hence, prior SoTA methods either approximate this $Q^*$ using $Q^{\pi_{\texttt{sft}}}$ (derived from the reference $\texttt{SFT}$ model) or rely on short-term rewards, resulting in sub-optimal decoding performance. In this work, we propose Transfer $Q^*$, which implicitly estimates the optimal value function for a target reward $r$ through a baseline model $\rho_{\texttt{BL}}$ aligned with a baseline reward $\rho_{\texttt{BL}}$ (which can be different from the target reward $r$). Theoretical analyses of Transfer $Q^*$ provide a rigorous characterization of its optimality, deriving an upper bound on the sub-optimality gap and identifying a hyperparameter to control the deviation from the pre-trained reference $\texttt{SFT}$ model based on user needs. Our approach significantly reduces the sub-optimality gap observed in prior SoTA methods and demonstrates superior empirical performance across key metrics such as coherence, diversity, and quality in extensive tests on several synthetic and real datasets.
Forward citations
Cited by 5 Pith papers
-
From Outcomes to Processes: Guiding PRM Learning from ORM for Inference-Time Alignment
SP-PRM trains process reward models from outcome reward models via score and preference consistency, improving reward-guided search on dialogue, summarization, and reasoning tasks.
-
Bounded Rationality for LLMs: Satisficing Alignment at Inference-Time
SITAlign is an inference-time constrained decoder that maximizes a primary reward while enforcing thresholds on secondary rewards, and it reports better primary-reward win-tie rates than weighted-objective decoding.
-
Speeding up Speculative Decoding via Sequential Approximate Verification
A lightweight trained verifier sequentially accepts or rejects draft tokens, reducing calls to the target LLM and speeding up speculative decoding with minimal quality loss.
-
InfAlign: Inference-aware language model alignment
Reward calibration plus a procedure-specific reward transformation lets RLHF optimize inference-time (best-of-N / worst-of-N) win rates better than standard RLHF, IPO, BoND, and BoNBoN.
-
Scaling Inference-Time Search with Vision Value Model for Improved Visual Comprehension
A TD-trained vision value model guides sentence-level inference-time search in VLMs, cutting hallucination and improving caption quality, with self-training gains on nine benchmarks.
Discussion (0). Continue with ORCID to comment.