Pith. sign in

REVIEW 1 cited by

Uncertainty-Penalized Direct Preference Optimization

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 2410.20187 v1 pith:SCZ3F52O submitted 2024-10-26 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords preferencelossambiguousdirecthumanlearningoptimizationpenalization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Aligning Large Language Models (LLMs) to human preferences in content, style, and presentation is challenging, in part because preferences are varied, context-dependent, and sometimes inherently ambiguous. While successful, Reinforcement Learning from Human Feedback (RLHF) and Direct Preference Optimization (DPO) are prone to the issue of proxy reward overoptimization. Analysis of the DPO loss reveals a critical need for regularization for mislabeled or ambiguous preference pairs to avoid reward hacking. In this work, we develop a pessimistic framework for DPO by introducing preference uncertainty penalization schemes, inspired by offline reinforcement learning. The penalization serves as a correction to the loss which attenuates the loss gradient for uncertain samples. Evaluation of the methods is performed with GPT2 Medium on the Anthropic-HH dataset using a model ensemble to obtain uncertainty estimates, and shows improved overall performance compared to vanilla DPO, as well as better completions on prompts from high-uncertainty chosen/rejected responses.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Improving LLMs via Validator-to-Generator Alignment

    cs.CL 2026-07 conditional novelty 7.0 of 10

    Frequency-corrected rank alignment of an LLM generator to its own validator improves generator AUROC and G-V Pearson correlation by up to 27 points while preserving validator quality.

Pith tools