CLARIFY: Contrastive Preference Reinforcement Learning for Untangling Ambiguous Queries

Ni Mu, Hao Hu, Xiao Hu, Yiqin Yang, Bo Xu +1 more
2/14/2026

No official code found. Best implementation: MoonOutCloudBack/CLARIFY_PbRL (1 star, last commit 2025-10-30).

Abstract

Preference-based reinforcement learning (PbRL) bypasses explicit reward engineering by inferring reward functions from human preference comparisons, enabling better alignment with human intentions. However, humans often struggle to label a clear preference between similar segments, reducing label efficiency and limiting PbRL's real-world applicability. To address this, we propose an offline PbRL method: Contrastive LeArning for ResolvIng Ambiguous Feedback (CLARIFY), which learns a trajectory embedding space that incorporates preference information, ensuring clearly distinguished segments are spaced apart, thus facilitating the selection of more unambiguous queries. Extensive experiments demonstrate that CLARIFY outperforms baselines in both non-ideal teachers and real human feedback settings. Our approach not only selects more distinguished queries but also learns meaningful trajectory embeddings.

View on arXivView PDF

Code Implementations(1)

[ICML 2025] CLARIFY: Contrastive Preference Reinforcement Learning for Untangling Ambiguous Queries

11Python, Jupyter NotebookJan 31, 202511 months ago

Similar Papers

Cite this paper

@article{mu2026clarify,
  title  = {CLARIFY: Contrastive Preference Reinforcement Learning for Untangling Ambiguous Queries},
  author = {Ni Mu and Hao Hu and Xiao Hu and Yiqin Yang and Bo Xu and Qing-Shan Jia},
  year   = {2026},
  eprint = {2506.00388},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2506.00388},
  journal = {ICML 2025 2025}
}

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/2506.00388.svg)](https://codeofpaper.com/paper/2506.00388)

Discussion