April 18, 2024, 4:43 a.m. | Wenhao Zhan, Masatoshi Uehara, Wen Sun, Jason D. Lee

stat.ML updates on arXiv.org arxiv.org

arXiv:2305.18505v3 Announce Type: replace-cross
Abstract: Preference-based Reinforcement Learning (PbRL) is a paradigm in which an RL agent learns to optimize a task using pair-wise preference-based feedback over trajectories, rather than explicit reward signals. While PbRL has demonstrated practical success in fine-tuning language models, existing theoretical work focuses on regret minimization and fails to capture most of the practical frameworks. In this study, we fill in such a gap between theoretical PbRL and practical algorithms by proposing a theoretical reward-agnostic PbRL …

abstract agent arxiv cs.ai cs.lg feedback fine-tuning language language models math.st paradigm practical reinforcement reinforcement learning stat.ml stat.th success type wise work

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Senior Principal, Product Strategy Operations, Cloud Data Analytics

@ Google | Sunnyvale, CA, USA; Austin, TX, USA

Data Scientist - HR BU

@ ServiceNow | Hyderabad, India