Principled Reinforcement Learning with Human Feedback from Pairwise or K-wise Comparisons

By Banghua Zhu, Jiantao Jiao, Michael I. Jordan. International Conference on Machine Learning, 2023

299 citations recorded by the source corpus.

We provide a theoretical framework for Reinforcement Learning with Human Feedback (RLHF). Our analysis shows that when the true reward function is linear, the widely used maximum likelihood estimator (MLE) converges under both the Bradley-Terry-Luce (BTL) model and the Plackett-Luce (PL) model. However, we show that when training a policy based on the learned reward model, MLE fails while a pessimistic MLE provides policies with improved performance under certain coverage assumptions. Additionally, we demonstrate that under the PL model, the true MLE and an alternative MLE that splits the $K$-wise comparison into pairwise comparisons both converge. Moreover, the true MLE is asymptotically more efficient. Our results validate the empirical success of existing RLHF algorithms in InstructGPT and provide new insights for algorithm design. Furthermore, our results unify the problem of RLHF and max-entropy Inverse Reinforcement Learning (IRL), and provide the first sample complexity bound for max-entropy IRL.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/4f16e5f4793cdf2a184ae9259ea0f0c04b889eb4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Anca Dragan
  2. Dylan Hadfield-Menell
  3. Dorsa Sadigh
  4. J'er'emy Scheurer
  5. David Krueger
  6. Longo Luca
  7. Wei Xiong
  8. Hanze Dong

In Computational Theory and Mathematics

  1. Anca Dragan
  2. Dylan Hadfield-Menell
  3. Stewart Slocum
  4. Dorsa Sadigh
  5. Tomasz Korbak
  6. Longo Luca
  7. Javier Del Ser
  8. Shane Legg

Citations in the corpus