all AI news
Provable Reward-Agnostic Preference-Based Reinforcement Learning
April 18, 2024, 4:43 a.m. | Wenhao Zhan, Masatoshi Uehara, Wen Sun, Jason D. Lee
stat.ML updates on arXiv.org arxiv.org
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
More from arxiv.org / stat.ML updates on arXiv.org
Entropic covariance models
2 days, 19 hours ago |
arxiv.org
Uncertainty quantification in metric spaces
2 days, 19 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Data Engineer
@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania
Artificial Intelligence – Bioinformatic Expert
@ University of Texas Medical Branch | Galveston, TX
Lead Developer (AI)
@ Cere Network | San Francisco, US
Research Engineer
@ Allora Labs | Remote
Ecosystem Manager
@ Allora Labs | Remote
Founding AI Engineer, Agents
@ Occam AI | New York