Pith. sign in

REVIEW 3 cited by

Provable Benefits of Policy Learning from Human Preferences in Contextual Bandit Problems

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 2307.12975 v2 pith:WKGHPHPZ submitted 2023-07-24 cs.LG math.STstat.MLstat.TH

classification cs.LGmath.STstat.MLstat.TH
keywords humanrewardfeedbackfunctiontheoreticalapproachescontextualempirical
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

For a real-world decision-making problem, the reward function often needs to be engineered or learned. A popular approach is to utilize human feedback to learn a reward function for training. The most straightforward way to do so is to ask humans to provide ratings for state-action pairs on an absolute scale and take these ratings as reward samples directly. Another popular way is to ask humans to rank a small set of state-action pairs by preference and learn a reward function from these preference data. Recently, preference-based methods have demonstrated substantial success in empirical applications such as InstructGPT. In this work, we develop a theoretical comparison between these human feedback approaches in offline contextual bandits and show how human bias and uncertainty in feedback modelings can affect the theoretical guarantees of these approaches. Through this, our results seek to provide a theoretical explanation for the empirical successes of preference-based methods from a modeling perspective.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Fusing Reward and Dueling Feedback in Stochastic Bandits

    cs.LG 2025-04 conditional novelty 7.0 of 10

    In stochastic multi-armed bandits with both reward and dueling feedback, the authors prove a regret lower bound and give an algorithm whose regret matches it up to a constant under a common dueling assumption.

  2. ThinkRetrieve: Retrieval-Augmented Reasoning Traces for Test-Time Scaling

    cs.AI 2026-08 conditional novelty 6.0 of 10

    Per-step retrieval of solved exemplars injected into the reasoning trace improves test-time scaling accuracy, with up to 13.4 absolute points gained on AIME 2025.

  3. Beyond Post-Hoc Temperature Scaling: Bilevel Optimization for LLM Calibration

    cs.LG 2026-08 conditional novelty 6.0 of 10

    CALM uses bilevel optimization to tune per-vocabulary temperature-like logit adjustments during LLM fine-tuning, and reports improved out-of-domain calibration for aligned language models.

Pith tools