English

Task Aware Dreamer for Task Generalization in Reinforcement Learning

Machine Learning 2026-01-26 v5

Abstract

A long-standing goal of reinforcement learning is to acquire agents that can learn on training tasks and generalize well on unseen tasks that may share a similar dynamic but with different reward functions. The ability to generalize across tasks is important as it determines an agent's adaptability to real-world scenarios where reward mechanisms might vary. In this work, we first show that training a general world model can utilize similar structures in these tasks and help train more generalizable agents. Extending world models into the task generalization setting, we introduce a novel method named Task Aware Dreamer (TAD), which integrates reward-informed features to identify consistent latent characteristics across tasks. Within TAD, we compute the variational lower bound of sample data log-likelihood, which introduces a new term designed to differentiate tasks using their states, as the optimization objective of our reward-informed world models. To demonstrate the advantages of the reward-informed policy in TAD, we introduce a new metric called Task Distribution Relevance (TDR) which quantitatively measures the relevance of different tasks. For tasks exhibiting a high TDR, i.e., the tasks differ significantly, we illustrate that Markovian policies struggle to distinguish them, thus it is necessary to utilize reward-informed policies in TAD. Extensive experiments in both image-based and state-based tasks show that TAD can significantly improve the performance of handling different tasks simultaneously, especially for those with high TDR, and display a strong generalization ability to unseen tasks.

Keywords

Cite

@article{arxiv.2303.05092,
  title  = {Task Aware Dreamer for Task Generalization in Reinforcement Learning},
  author = {Chengyang Ying and Xinning Zhou and Zhongkai Hao and Hang Su and Songming Liu and Dong Yan and Jun Zhu},
  journal= {arXiv preprint arXiv:2303.05092},
  year   = {2026}
}
R2 v1 2026-06-28T09:08:48.682Z