Pith. sign in

REVIEW 3 cited by

Learning to Understand Goal Specifications by Modelling Reward

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 1806.01946 v4 pith:G43E7K3U submitted 2018-06-05 cs.AI cs.LG

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

Recent work has shown that deep reinforcement-learning agents can learn to follow language-like instructions from infrequent environment rewards. However, this places on environment designers the onus of designing language-conditional reward functions which may not be easily or tractably implemented as the complexity of the environment and the language scales. To overcome this limitation, we present a framework within which instruction-conditional RL agents are trained using rewards obtained not from the environment, but from reward models which are jointly trained from expert examples. As reward models improve, they learn to accurately reward agents for completing tasks for environment configurations---and for instructions---not present amongst the expert data. This framework effectively separates the representation of what instructions require from how they can be executed. In a simple grid world, it enables an agent to learn a range of commands requiring interaction with blocks and understanding of spatial relations and underspecified abstract arrangements. We further show the method allows our agent to adapt to changes in the environment without requiring new expert examples.

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. S2T-RLHF: Hierarchical Credit Assignment for Stable Preference-Based RLHF

    cs.AI 2026-05 conditional novelty 6.0 of 10

    S2T-RLHF splits each response-level RLHF reward into sentence shares and then token shares, via bargaining and Dirichlet weighting, yielding steadier training with competitive preference alignment.

  2. Reinforcement Learning with Physics-Informed Symbolic Program Priors for Zero-Shot Wireless Indoor Navigation

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Physics priors written as symbolic programs constrain a PPO agent's action choices, yielding better zero-shot wireless indoor navigation and 26%+ training-time savings on Gibson maps.

  3. Strategy-Following Multi-Agent Deep Reinforcement Learning Considering Control Strategies Provided to Other Agents

    cs.MA 2026-07 conditional novelty 5.0 of 10

    Feeding each agent a summed map of the instructions given to the other agents makes uninstructed agents cover overlooked areas and improves object collection by roughly 8% over the baseline in the tested game.

Pith tools