Pith. sign in

REVIEW 2 cited by

The Expertise Problem: Learning from Specialized Feedback

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.06519 v1 pith:UZM6WFZR submitted 2022-11-12 cs.LG

classification cs.LG
keywords expertiserlhffeedbackproblemteacherhumanteachersalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Reinforcement learning from human feedback (RLHF) is a powerful technique for training agents to perform difficult-to-specify tasks. However, human feedback can be noisy, particularly when human teachers lack relevant knowledge or experience. Levels of expertise vary across teachers, and a given teacher may have differing levels of expertise for different components of a task. RLHF algorithms that learn from multiple teachers therefore face an expertise problem: the reliability of a given piece of feedback depends both on the teacher that it comes from and how specialized that teacher is on relevant components of the task. Existing state-of-the-art RLHF algorithms assume that all evaluations come from the same distribution, obscuring this inter- and intra-human variance, and preventing them from accounting for or taking advantage of variations in expertise. We formalize this problem, implement it as an extension of an existing RLHF benchmark, evaluate the performance of a state-of-the-art RLHF algorithm, and explore techniques to improve query and teacher selection. Our key contribution is to demonstrate and characterize the expertise problem, and to provide an open-source implementation for testing future solutions.

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. When Can Proxies Improve the Sample Complexity of Preference Learning?

    cs.LG 2024-12 reject novelty 6.0 of 10

    Under four structural conditions linking proxy and true preference policies, the true policy is a low-dimensional adapter of the proxy policy, reducing the number of true preference samples needed.

  2. A Survey On Enhancing Reinforcement Learning in Complex Environments: Insights from Human and LLM Feedback

    cs.LG 2024-11 conditional novelty 2.0 of 10

    A survey of prior work on using human and LLM feedback to improve reinforcement learning, plus attention-based methods for large state spaces.

Pith tools