pith. sign in

arxiv: 2402.09401 · v2 · pith:IVJJQV5Ynew · submitted 2024-02-14 · 💻 cs.LG · cs.AI· cs.CL· math.OC· stat.ML

Reinforcement Learning from Human Feedback with Active Queries

classification 💻 cs.LG cs.AIcs.CLmath.OCstat.ML
keywords humanpreferencedeltalearningproblemrlhfactiveadpo
0
0 comments X
read the original abstract

Aligning large language models (LLM) with human preference plays a key role in building modern generative models and can be achieved by reinforcement learning from human feedback (RLHF). Despite their superior performance, current RLHF approaches often require a large amount of human-labelled preference data, which is expensive to collect. In this paper, inspired by the success of active learning, we address this problem by proposing query-efficient RLHF methods. We first formalize the alignment problem as a contextual dueling bandit problem and design an active-query-based proximal policy optimization (APPO) algorithm with an $\tilde{O}(d^2/\Delta)$ instance-dependent regret bound and an $\tilde{O}(d^2/\Delta^2)$ query complexity, where $d$ is the dimension of feature space and $\Delta$ is the sub-optimality gap over all the contexts. We then propose ADPO, a practical version of our algorithm based on direct preference optimization (DPO) and apply it to fine-tuning LLMs. Our experiments show that ADPO, while only making about half of queries for human preference, matches the performance of the state-of-the-art DPO method.

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 4 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. When Self-Belief Misleads: Active Label Acquisition for Reinforcement Learning with Verifiable Rewards

    cs.LG 2026-05 unverdicted novelty 5.0

    RLAVR uses the Corrective Advantage Gap metric and CARE policy to actively acquire ground-truth labels for key samples, stabilizing RLVR training and boosting performance with limited annotation budgets.

  3. Test-Time Alignment via Hypothesis Reweighting

    cs.LG 2024-12 unverdicted novelty 5.0

    HyRe personalizes reward models at test time by reweighting an ensemble of heads trained on aggregate preferences, using few target examples to outperform uniform averaging and prior methods on RewardBench and 32 tasks.

  4. Reinforcement Learning from Human Feedback: A Statistical Perspective

    stat.ML 2026-04 accept novelty 2.0

    A statistical survey of RLHF for LLM alignment that connects preference learning and policy optimization to models like Bradley-Terry-Luce while reviewing methods, extensions, and open challenges.