Online Policy Learning from Offline Preferences

Guoxi Zhang, Han Bao, Hisashi Kashima
3/15/2024
cs.LG

No confident code implementation found for this paper.

Abstract

In preference-based reinforcement learning (PbRL), a reward function is learned from a type of human feedback called preference. To expedite preference collection, recent works have leveraged \emph{offline preferences}, which are preferences collected for some offline data. In this scenario, the learned reward function is fitted on the offline data. If a learning agent exhibits behaviors that do not overlap with the offline data, the learned reward function may encounter generalizability issues. To address this problem, the present study introduces a framework that consolidates offline preferences and \emph{virtual preferences} for PbRL, which are comparisons between the agent's behaviors and the offline data. Critically, the reward function can track the agent's behaviors using the virtual preferences, thereby offering well-aligned guidance to the agent. Through experiments on continuous control tasks, this study demonstrates the effectiveness of incorporating the virtual preferences in PbRL.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zhang2024online,
  title  = {Online Policy Learning from Offline Preferences},
  author = {Guoxi Zhang and Han Bao and Hisashi Kashima},
  year   = {2024},
  eprint = {2403.10160},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.10160v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.10160.svg)](https://codeofpaper.com/paper/2403.10160)

Discussion