Truncate Bad, Upweight Good: BoN-Style Distillation via Rank-Based Classification

📅 2026-08-20
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
研究提出TUP方法,通过移除低排名完成项并锐化重权高排名完成项,以改进基于排名的蒸馏策略,解决生成模型中的选择问题。
📝 Abstract
Inference-time selection methods, such as Best-of-N, improve generation by sampling a pool of candidates and selecting the top-ranked completion according to a reward model. Distillation seeks to amortize this procedure into a single policy by replacing raw rewards with in-pool ranks and learning a policy that upweights higher-ranked completions. However, existing rank-based policies typically use smooth full-support reweighting, so low-ranked completions receive less mass but remain in the target support. Although a sharper reweighting reduces lower-tail mass, it also increases reliance on brittle ranking at the top made by a single reward model. We propose TUP: a Truncate-bad, Upweight-good Policy that removes low-ranked completions from the support and reweights only the retained upper tail with a tunable sharpness. TUP admits a closed-form, prompt-independent normalization and can be trained fully offline via binary cross-entropy, using shifted-truncated win-rates as soft labels and distilled-to-reference log-likelihood ratios as logits. Theoretically, under certain assumptions, we show that for any unknown oracle reward, the best monotone rank-reweighting can be matched by a lower-tail truncation rule, providing formal support for removing the lower tail rather than merely downweighting it. Empirically, we show that TUP is competitive with strong offline alignment baselines.
Problem

Research questions and friction points this paper is trying to address.

rank-based classification
reweighting
completion generation
Innovation

Methods, ideas, or system contributions that make the work stand out.

Truncate-bad, Upweight-good Policy
rank-based classification
offline training
closed-form normalization
lower-tail truncation
🔎 Similar Papers
2024-06-19International Conference on Computational LinguisticsCitations: 1