Skip to yearly menu bar Skip to main content


Poster

Multi-turn Reinforcement Learning with Preference Human Feedback

Lior Shani · Aviv Rosenberg · Asaf Cassel · Oran Lang · Daniele Calandriello · Avital Zipori · Hila Noga · Orgad Keller · Bilal Piot · Idan Szpektor · Avinatan Hassidim · Yossi Matias · Remi Munos

West Ballroom A-D #6402
[ ]
Wed 11 Dec 4:30 p.m. PST — 7:30 p.m. PST

Abstract:

Reinforcement Learning from Human Feedback (RLHF) has become the standard approach for aligning Large Language Models (LLMs) with human preferences, allowing LLMs to demonstrate remarkable abilities in various tasks. Existing methods work by emulating the human preference at the single decision (turn) level, limiting their capabilities in settings that require planning or multi-turn interactions to achieve a long-term goal. In this paper, we address this issue by developing novel methods for Reinforcement Learning (RL) from preference feedback between two full multi-turn conversations. In the tabular setting, we present a novel mirror-descent-based policy optimization algorithm for the general multi-turn preference-based RL problem, and prove its convergence to Nash equilibrium. To evaluate performance, we create a new environment, Education Dialogue, where a teacher agent guides a student in learning a random topic, and show that a deep RL variant of our algorithm outperforms RLHF baselines. Finally, we show that in an environment with explicit rewards, our algorithm recovers the same performance as a reward-based RL baseline, despite relying solely on a weaker preference signal.

Live content is unavailable. Log in and register to view live content