<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>Reward Modeling - Tag - lilfry's library</title><link>https://lilfry09.github.io/en/tags/reward-modeling/</link><description>Reward Modeling - Tag - lilfry's library</description><generator>Hugo -- gohugo.io</generator><language>en</language><managingEditor>lilfry@sjtu.edu.cn (lilfry)</managingEditor><webMaster>lilfry@sjtu.edu.cn (lilfry)</webMaster><copyright>All rights reserved.</copyright><lastBuildDate>Wed, 08 Apr 2026 14:20:00 +0800</lastBuildDate><atom:link href="https://lilfry09.github.io/en/tags/reward-modeling/" rel="self" type="application/rss+xml"/><item><title>High frequency interview: Bradley-Terry vs Plackett-Luce, what is the difference between reward modeling?</title><link>https://lilfry09.github.io/en/ai/bt-vs-pl-ranking-in-alignment/</link><pubDate>Wed, 08 Apr 2026 14:20:00 +0800</pubDate><author>fry</author><guid>https://lilfry09.github.io/en/ai/bt-vs-pl-ranking-in-alignment/</guid><description>In a word: BT is a special case of PL when the number of candidates is N=2. BT is lighter, more stable, and more suitable for existing RLHF/DPO; PL has more complete information, but the labeling and training costs are significantly higher.</description></item></channel></rss>