Pith. sign in

REVIEW 1 cited by

Semi-supervised reward learning for offline reinforcement learning

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 2012.06899 v1 pith:X6ZITYDX submitted 2020-12-12 cs.LG cs.AIcs.RO

classification cs.LGcs.AIcs.RO
keywords rewardlearningannotationsagentsinvestigateofflinepoliciesreinforcement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In offline reinforcement learning (RL) agents are trained using a logged dataset. It appears to be the most natural route to attack real-life applications because in domains such as healthcare and robotics interactions with the environment are either expensive or unethical. Training agents usually requires reward functions, but unfortunately, rewards are seldom available in practice and their engineering is challenging and laborious. To overcome this, we investigate reward learning under the constraint of minimizing human reward annotations. We consider two types of supervision: timestep annotations and demonstrations. We propose semi-supervised learning algorithms that learn from limited annotations and incorporate unlabelled data. In our experiments with a simulated robotic arm, we greatly improve upon behavioural cloning and closely approach the performance achieved with ground truth rewards. We further investigate the relationship between the quality of the reward model and the final policies. We notice, for example, that the reward models do not need to be perfect to result in useful policies.

Discussion (0). Sign in 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. TROFI: Trajectory-Ranked Offline Inverse Reinforcement Learning

    cs.LG 2025-06 conditional novelty 5.0 of 10

    TROFI learns a reward model from ranked trajectories, labels an offline dataset with it, and trains a TD3+BC policy, matching ground-truth-reward performance on many D4RL tasks without a hand-coded reward or expert de...

Pith tools