Conditional Mutual Information for Disentangled Representations in Reinforcement Learning

Mhairi Dunion, Trevor McInroe, Kevin Sebastian Luck, Josiah P. Hanna, Stefano V. Albrecht
5/23/2023
cs.LG

No official code found. Best implementation: uoe-agents/CMID (13 stars, MIT, last commit 2024-04-25).

Abstract

Reinforcement Learning (RL) environments can produce training data with spurious correlations between features due to the amount of training data or its limited feature coverage. This can lead to RL agents encoding these misleading correlations in their latent representation, preventing the agent from generalising if the correlation changes within the environment or when deployed in the real world. Disentangled representations can improve robustness, but existing disentanglement techniques that minimise mutual information between features require independent features, thus they cannot disentangle correlated features. We propose an auxiliary task for RL algorithms that learns a disentangled representation of high-dimensional observations with correlated features by minimising the conditional mutual information between features in the representation. We demonstrate experimentally, using continuous control tasks, that our approach improves generalisation under correlation shifts, as well as improving the training performance of RL algorithms in the presence of correlated features.

View on arXivView PDF

Code Implementations(1)

uoe-agents/CMIDCommunity100%
MIT
135Shell, PythonMay 23, 20232 years agoMIT

Similar Papers

Cite this paper

@article{dunion2023conditional,
  title  = {Conditional Mutual Information for Disentangled Representations in Reinforcement Learning},
  author = {Mhairi Dunion and Trevor McInroe and Kevin Sebastian Luck and Josiah P. Hanna and Stefano V. Albrecht},
  year   = {2023},
  eprint = {2305.14133},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.14133v2},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.14133.svg)](https://codeofpaper.com/paper/2305.14133)

Discussion