Pith. sign in

REVIEW 2 cited by

You Can't Count on Luck: Why Decision Transformers and RvS Fail in Stochastic Environments

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 2205.15967 v2 pith:QQTIXRBW submitted 2022-05-31 cs.LG cs.AI

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

Recently, methods such as Decision Transformer that reduce reinforcement learning to a prediction task and solve it via supervised learning (RvS) have become popular due to their simplicity, robustness to hyperparameters, and strong overall performance on offline RL tasks. However, simply conditioning a probabilistic model on a desired return and taking the predicted action can fail dramatically in stochastic environments since trajectories that result in a return may have only achieved that return due to luck. In this work, we describe the limitations of RvS approaches in stochastic environments and propose a solution. Rather than simply conditioning on the return of a single trajectory as is standard practice, our proposed method, ESPER, learns to cluster trajectories and conditions on average cluster returns, which are independent from environment stochasticity. Doing so allows ESPER to achieve strong alignment between target return and expected performance in real environments. We demonstrate this in several challenging stochastic offline-RL tasks including the challenging puzzle game 2048, and Connect Four playing against a stochastic opponent. In all tested domains, ESPER achieves significantly better alignment between the target return and achieved return than simply conditioning on returns. ESPER also achieves higher maximum performance than even the value-based baselines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. AMAGO-2: Breaking the Multi-Task Barrier in Meta-Reinforcement Learning with Transformers

    cs.LG 2024-11 conditional novelty 6.0 of 10

    Using two-hot classification for value prediction and binary-filtered imitation for policy updates makes multi-task meta-RL training scale-invariant to reward magnitudes, improving performance across five benchmarks w...

  2. Multi-Objective Reinforcement Learning for Automated Resilient Cyber Defence

    cs.CR 2024-11 conditional novelty 5.0 of 10

    In a two-objective CybORG defence game, MOPPO produced policies that trade off network defence against user access, while Pareto Conditioned Networks did not respond reliably to preference prompts.

Pith tools