Sharing Knowledge in Multi-Task Deep Reinforcement Learning

Carlo D'Eramo, Davide Tateo, Andrea Bonarini, Marcello Restelli, Jan Peters
1/17/2024
cs.LG

No official code found. Best implementation: carloderamo/shared (30 stars, last commit 2021-12-02).

Abstract

We study the benefit of sharing representations among tasks to enable the effective use of deep neural networks in Multi-Task Reinforcement Learning. We leverage the assumption that learning from different tasks, sharing common properties, is helpful to generalize the knowledge of them resulting in a more effective feature extraction compared to learning a single task. Intuitively, the resulting set of features offers performance benefits when used by Reinforcement Learning algorithms. We prove this by providing theoretical guarantees that highlight the conditions for which is convenient to share representations among tasks, extending the well-known finite-time bounds of Approximate Value-Iteration to the multi-task setting. In addition, we complement our analysis by proposing multi-task extensions of three Reinforcement Learning algorithms that we empirically evaluate on widely used Reinforcement Learning benchmarks showing significant improvements over the single-task counterparts in terms of sample efficiency and performance.

View on arXivView PDF

Code Implementations(1)

carloderamo/sharedCommunity100%
303PythonJul 9, 20184 years ago

Similar Papers

Cite this paper

@article{deramo2024sharing,
  title  = {Sharing Knowledge in Multi-Task Deep Reinforcement Learning},
  author = {Carlo D'Eramo and Davide Tateo and Andrea Bonarini and Marcello Restelli and Jan Peters},
  year   = {2024},
  eprint = {2401.09561},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.09561v1}
}

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/2401.09561.svg)](https://codeofpaper.com/paper/2401.09561)

Discussion