Meta-reinforcement Learning Based On Self-supervised Task Representation Learning

Abstract

Meta-reinforcement learning enables artificial agents to learn from related training tasks and adapt to new tasks efficiently with minimal interaction data. However, most existing research is still limited to narrow task distributions that are parametric and stationary, and does not consider out-of-distribution tasks during the evaluation, thus, restricting its application. In this paper, we propose MoSS, a context-based Meta-reinforcement learning algorithm based on Self-Supervised task representation learning to address this challenge. We extend meta-RL to broad non-parametric task distributions which have never been explored before, and also achieve state-of-the-art results in non-stationary and out-of-distribution tasks. Specifically, MoSS consists of a task inference module and a policy module. We utilize the Gaussian mixture model for task representation to imitate the parametric and non-parametric task variations. Additionally, our online adaptation strategy enables the agent to

Stats

• citations10
• S2 citations—
• github stars0
• HF likes0
• heat score7.81
• arxiv keywang2023meta

Related papers

• Offline Meta-reinforcement Learning With Online Self-supervision (2021)0.00
• Model-based Adversarial Meta-reinforcement Learning (2020)0.00
• Context Meta-reinforcement Learning Via Neuromodulation (2021)6.34
• A Tutorial On Meta-reinforcement Learning (2023)10.85
• Meta Reinforcement Learning With Autonomous Inference Of Subtask Dependencies (2020)0.00
• Entropy Regularized Task Representation Learning For Offline Meta-reinforcement Learning (2024)0.00
• Distributionally Adaptive Meta Reinforcement Learning (2022)2.26
• Decoupling Meta-reinforcement Learning With Gaussian Task Contexts And Skills (2023)2.26