REVIEW 2 cited by
Zero-Shot Reinforcement Learning from Low Quality Data
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
read the original abstract
Zero-shot reinforcement learning (RL) promises to provide agents that can perform any task in an environment after an offline, reward-free pre-training phase. Methods leveraging successor measures and successor features have shown strong performance in this setting, but require access to large heterogenous datasets for pre-training which cannot be expected for most real problems. Here, we explore how the performance of zero-shot RL methods degrades when trained on small homogeneous datasets, and propose fixes inspired by conservatism, a well-established feature of performant single-task offline RL algorithms. We evaluate our proposals across various datasets, domains and tasks, and show that conservative zero-shot RL algorithms outperform their non-conservative counterparts on low quality datasets, and perform no worse on high quality datasets. Somewhat surprisingly, our proposals also outperform baselines that get to see the task during training. Our code is available via https://enjeeneer.io/projects/zero-shot-rl/ .
Forward citations
Cited by 2 Pith papers
-
Zero-Shot Off-Policy Learning
Forward-backward successor representations can be converted into stationary density-ratio corrections, yielding a training-free latent adaptation method (ZOL) that improves zero-shot RL benchmarks.
-
Epistemically-guided forward-backward exploration
Choosing exploration policies by the ensemble disagreement of forward-backward value estimates improves zero-shot RL sample efficiency on DeepMind Control Suite tasks.
Discussion (0). Sign in to comment.