pith. sign in

arxiv: 2102.10774 · v2 · pith:IMYLM7G2new · submitted 2021-02-22 · 💻 cs.LG · cs.AI

Provably Improved Context-Based Offline Meta-RL with Attention and Contrastive Learning

classification 💻 cs.LG cs.AI
keywords learningalgorithmstaskattentioncontext-basedcontrastivemeta-rloffline
0
0 comments X
read the original abstract

Meta-learning for offline reinforcement learning (OMRL) is an understudied problem with tremendous potential impact by enabling RL algorithms in many real-world applications. A popular solution to the problem is to infer task identity as augmented state using a context-based encoder, for which efficient learning of robust task representations remains an open challenge. In this work, we provably improve upon one of the SOTA OMRL algorithms, FOCAL, by incorporating intra-task attention mechanism and inter-task contrastive learning objectives, to robustify task representation learning against sparse reward and distribution shift. Theoretical analysis and experiments are presented to demonstrate the superior performance and robustness of our end-to-end and model-free framework compared to prior algorithms across multiple meta-RL benchmarks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.