Pith. sign in

REVIEW 2 cited by

Weak-to-Strong Preference Optimization: Stealing Reward from Weak Aligned Model

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

arxiv 2410.18640 v2 pith:EMBB3LLI submitted 2024-10-24 cs.CL

classification cs.CL
keywords modelalignmentmodelsweakstrongweak-to-strongoptimizationpreference
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Aligning language models (LMs) with human preferences has become a key area of research, enabling these models to meet diverse user needs better. Inspired by weak-to-strong generalization, where a strong LM fine-tuned on labels generated by a weaker model can consistently outperform its weak supervisor, we extend this idea to model alignment. In this work, we observe that the alignment behavior in weaker models can be effectively transferred to stronger models and even exhibit an amplification effect. Based on this insight, we propose a method called Weak-to-Strong Preference Optimization (WSPO), which achieves strong model alignment by learning the distribution differences before and after the alignment of the weak model. Experiments demonstrate that WSPO delivers outstanding performance, improving the win rate of Qwen2-7B-Instruct on Arena-Hard from 39.70 to 49.60, achieving a remarkable 47.04 length-controlled win rate on AlpacaEval 2, and scoring 7.33 on MT-bench. Our results suggest that using the weak model to elicit a strong model with a high alignment ability is feasible.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Weak-to-Strong Generalization via Direct On-Policy Distillation

    cs.LG 2026-07 conditional novelty 7.0 of 10

    Transferring the log-ratio of a small model's pre-RL and post-RL checkpoints provides a dense implicit reward that improves stronger student models at a fraction of the cost of direct RL.

  2. BIRD: Behavior Induction via Representation-structure Distillation

    cs.LG 2025-05 conditional novelty 6.0 of 10

    BIRD transfers aligned behavior across models with different architectures, tasks, and data by minimizing linear CKA between teacher and student representations, and three teacher representation properties explain mos...

Pith tools