Pith. sign in

REVIEW 1 cited by

Assisted Robust Reward Design

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 2111.09884 v1 pith:VZO3XHF3 submitted 2021-11-18 cs.RO cs.AIcs.LG

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

Real-world robotic tasks require complex reward functions. When we define the problem the robot needs to solve, we pretend that a designer specifies this complex reward exactly, and it is set in stone from then on. In practice, however, reward design is an iterative process: the designer chooses a reward, eventually encounters an "edge-case" environment where the reward incentivizes the wrong behavior, revises the reward, and repeats. What would it mean to rethink robotics problems to formally account for this iterative nature of reward design? We propose that the robot not take the specified reward for granted, but rather have uncertainty about it, and account for the future design iterations as future evidence. We contribute an Assisted Reward Design method that speeds up the design process by anticipating and influencing this future evidence: rather than letting the designer eventually encounter failure cases and revise the reward then, the method actively exposes the designer to such environments during the development phase. We test this method in a simplified autonomous driving task and find that it more quickly improves the car's behavior in held-out environments by proposing environments that are "edge cases" for the current reward.

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. Multi-Modal, Multi-Environment Machine Teaching for Robust Reward Learning

    cs.LG 2026-07 conditional novelty 6.0 of 10

    A hierarchical teaching algorithm selects complementary environments and feedback modalities to learn reward functions that generalize across unseen MDPs, proving that single-environment teaching leaves structural rew...

Pith tools