Pith. sign in

REVIEW 1 cited by

Learning Relative Return Policies With Upside-Down 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 2202.12742 v2 pith:BYHOZFD6 submitted 2022-02-23 cs.LG cs.AI

classification cs.LGcs.AI
keywords learningreinforcementupside-downcommandspoliciesreturnworkapproximation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Lately, there has been a resurgence of interest in using supervised learning to solve reinforcement learning problems. Recent work in this area has largely focused on learning command-conditioned policies. We investigate the potential of one such method -- upside-down reinforcement learning -- to work with commands that specify a desired relationship between some scalar value and the observed return. We show that upside-down reinforcement learning can learn to carry out such commands online in a tabular bandit setting and in CartPole with non-linear function approximation. By doing so, we demonstrate the power of this family of methods and open the way for their practical use under more complicated command structures.

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. Upside-Down Reinforcement Learning for More Interpretable Optimal Control

    cs.LG 2024-11 conditional novelty 4.0 of 10

    Random forests and extra trees match a neural network as UDRL behavior functions on CartPole, Acrobot, and Lunar Lander, and provide feature importance explanations.

Pith tools