Causally Aligned Curriculum Learning
Mingxuan Li, Junzhe Zhang, Elias Bareinboim
TL;DR
This work tackles misalignment in curriculum reinforcement learning caused by unobserved confounders by casting curriculum design in a structural causal modeling framework. It derives a graphical condition for causally aligned source tasks and introduces efficient procedures (FindMaxEdit and FindCausalCurriculum) to generate curricula that preserve invariant optimal decision rules and avoid harmful transfers. The approach is validated on pixel-based, confounded tasks (Colored Sokoban, Button Maze, Continuous Button Maze), showing that causally augmented curricula converge reliably and outperform non-causal counterparts. The contributions enable robust transfer from simplified source tasks to complex targets in settings where hidden confounders otherwise undermine learning efficiency and policy quality.
Abstract
A pervasive challenge in Reinforcement Learning (RL) is the "curse of dimensionality" which is the exponential growth in the state-action space when optimizing a high-dimensional target task. The framework of curriculum learning trains the agent in a curriculum composed of a sequence of related and more manageable source tasks. The expectation is that when some optimal decision rules are shared across source tasks and the target task, the agent could more quickly pick up the necessary skills to behave optimally in the environment, thus accelerating the learning process. However, this critical assumption of invariant optimal decision rules does not necessarily hold in many practical applications, specifically when the underlying environment contains unobserved confounders. This paper studies the problem of curriculum RL through causal lenses. We derive a sufficient graphical condition characterizing causally aligned source tasks, i.e., the invariance of optimal decision rules holds. We further develop an efficient algorithm to generate a causally aligned curriculum, provided with qualitative causal knowledge of the target task. Finally, we validate our proposed methodology through experiments in discrete and continuous confounded tasks with pixel observations.
