LGAIROJun 7, 2024

Skill-aware Mutual Information Optimisation for Generalisation in Reinforcement Learning

arXiv:2406.04815v33 citations
AI Analysis

This work addresses generalization challenges in meta-reinforcement learning for agents operating in diverse environments, representing an incremental improvement over existing contrastive learning methods.

The paper tackles the problem of meta-reinforcement learning agents struggling to generalize across tasks with varying environmental features by introducing Skill-aware Mutual Information (SaMI) and Skill-aware Noise Contrastive Estimation (SaNCE), resulting in substantially improved zero-shot generalization to unseen tasks and greater robustness to reduced sample sizes.

Meta-Reinforcement Learning (Meta-RL) agents can struggle to operate across tasks with varying environmental features that require different optimal skills (i.e., different modes of behaviour). Using context encoders based on contrastive learning to enhance the generalisability of Meta-RL agents is now widely studied but faces challenges such as the requirement for a large sample size, also referred to as the $\log$-$K$ curse. To improve RL generalisation to different tasks, we first introduce Skill-aware Mutual Information (SaMI), an optimisation objective that aids in distinguishing context embeddings according to skills, thereby equipping RL agents with the ability to identify and execute different skills across tasks. We then propose Skill-aware Noise Contrastive Estimation (SaNCE), a $K$-sample estimator used to optimise the SaMI objective. We provide a framework for equipping an RL agent with SaNCE in practice and conduct experimental validation on modified MuJoCo and Panda-gym benchmarks. We empirically find that RL agents that learn by maximising SaMI achieve substantially improved zero-shot generalisation to unseen tasks. Additionally, the context encoder trained with SaNCE demonstrates greater robustness to a reduction in the number of available samples, thus possessing the potential to overcome the $\log$-$K$ curse.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes