pith. sign in

arxiv: 2502.04270 · v1 · pith:AMSWVV7Rnew · submitted 2025-02-06 · 💻 cs.LG · stat.ML

PILAF: Optimal Human Preference Sampling for Reward Modeling

classification 💻 cs.LG stat.ML
keywords humanpreferencerewardfeedbacklearningmodelspilafrlhf
0
0 comments X
read the original abstract

As large language models increasingly drive real-world applications, aligning them with human values becomes paramount. Reinforcement Learning from Human Feedback (RLHF) has emerged as a key technique, translating preference data into reward models when oracle human values remain inaccessible. In practice, RLHF mostly relies on approximate reward models, which may not consistently guide the policy toward maximizing the underlying human values. We propose Policy-Interpolated Learning for Aligned Feedback (PILAF), a novel response sampling strategy for preference labeling that explicitly aligns preference learning with maximizing the underlying oracle reward. PILAF is theoretically grounded, demonstrating optimality from both an optimization and a statistical perspective. The method is straightforward to implement and demonstrates strong performance in iterative and online RLHF settings where feedback curation is critical.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Which Pairs to Compare for LLM Post-Training?

    cs.AI 2026-06 unverdicted novelty 7.0

    Matching upper and lower bounds on DPO policy optimality gap are derived that depend on a single design-dependent information matrix linking pair selection to estimation error and suboptimality.

  2. $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses

    cs.LG 2026-05 unverdicted novelty 7.0

    The paper establishes the first O(log T) regret and O(1/T) sub-optimality bounds for online RLHF under general f-divergence regularization via two sampling algorithms.