SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2410.17389 · 2024

Navigating Noisy Feedback: Enhancing Reinforcement Learning with Error-Prone Language Models

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 4 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
sy-shi/RLAIF_ScoreDiff canonical 3 of 4
FunctionStatusWhere it lives
custom_loss Ran sy-shi/RLAIF_ScoreDiff/train_rm.py
pointer only (licence: NONE) · get_code("fc93bc090f3a63c7")
lr_lambda_selector Ran sy-shi/RLAIF_ScoreDiff/train_rm.py
pointer only (licence: NONE) · get_code("aaeecfe1ef8324e7")
manhattan_distance Ran sy-shi/RLAIF_ScoreDiff/generate_ranking_data.py
pointer only (licence: NONE) · get_code("f0e515a163e67f9f")
train Not yet run sy-shi/RLAIF_ScoreDiff/train_rm.py
pointer only (licence: NONE) · get_code("dd0ba84e7526171f")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

The correct specification of reward models is a well-known challenge in reinforcement learning. Hand-crafted reward functions often lead to inefficient or suboptimal policies and may not be aligned with user values. Reinforcement learning from human feedback is a successful technique that can mitigate such issues, however, the collection of human feedback can be laborious. Recent works have solicited feedback from pre-trained large language models rather than humans to reduce or eliminate human effort, however, these approaches yield poor performance in the presence of hallucination and other errors. This paper studies the advantages and limitations of reinforcement learning from large language model feedback and proposes a simple yet effective method for soliciting and applying feedback as a potential-based shaping function. We theoretically show that inconsistent rankings, which approximate ranking errors, lead to uninformative rewards with our approach. Our method empirically improves convergence speed and policy returns over commonly used baselines even with significant ranking errors, and eliminates the need for complex post-processing of reward functions.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2410.17389")
get_code_for_paper("2410.17389")
have("2410.17389")

Connect an agent — have() is free.