Pith. sign in

REVIEW 2 cited by

Reward Gaming in Conditional Text Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.08714 v3 pith:QCHQ2TBC submitted 2022-11-16 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords generationrewardtextconditionalgamingmodelbeencommunity
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

To align conditional text generation model outputs with desired behaviors, there has been an increasing focus on training the model using reinforcement learning (RL) with reward functions learned from human annotations. Under this framework, we identify three common cases where high rewards are incorrectly assigned to undesirable patterns: noise-induced spurious correlation, naturally occurring spurious correlation, and covariate shift. We show that even though learned metrics achieve high performance on the distribution of the data used to train the reward function, the undesirable patterns may be amplified during RL training of the text generation model. While there has been discussion about reward gaming in the RL or safety community, in this discussion piece, we would like to highlight reward gaming in the natural language generation (NLG) community using concrete conditional text generation examples and discuss potential fixes and areas for future work.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. InfAlign: Inference-aware language model alignment

    cs.LG 2024-12 conditional novelty 6.0 of 10

    Reward calibration plus a procedure-specific reward transformation lets RLHF optimize inference-time (best-of-N / worst-of-N) win rates better than standard RLHF, IPO, BoND, and BoNBoN.

  2. Speech Recognition With LLMs Adapted to Disordered Speech Using Reinforcement Learning

    eess.AS 2024-12 conditional novelty 6.0 of 10

    Reinforcement learning with word-error and meaning-preservation rewards adapts an LLM-based speech recognizer to disordered speech better than supervised fine-tuning in this study.

Pith tools