Skip to Main content Skip to Navigation
Conference papers

Sparse Multi-task Reinforcement Learning

Daniele Calandriello 1, 2 Alessandro Lazaric 1, 2 Marcello Restelli 3
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Abstract : In multi-task reinforcement learning (MTRL), the objective is to simultaneously learn multiple tasks and exploit their similarity to improve the performance w.r.t.\ single-task learning. In this paper we investigate the case when all the tasks can be accurately represented in a linear approximation space using the same small subset of the original (large) set of features. This is equivalent to assuming that the weight vectors of the task value functions are \textit{jointly sparse}, i.e., the set of their non-zero components is small and it is shared across tasks. Building on existing results in multi-task regression, we develop two multi-task extensions of the fitted $Q$-iteration algorithm. While the first algorithm assumes that the tasks are jointly sparse in the given representation, the second one learns a transformation of the features in the attempt of finding a more sparse representation. For both algorithms we provide a sample complexity analysis and numerical simulations.
Document type :
Conference papers
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Alessandro Lazaric Connect in order to contact the contributor
Submitted on : Saturday, January 31, 2015 - 3:30:37 PM
Last modification on : Saturday, December 18, 2021 - 3:05:20 AM
Long-term archiving on: : Wednesday, May 27, 2015 - 3:10:36 PM


Files produced by the author(s)


  • HAL Id : hal-01073513, version 1


Daniele Calandriello, Alessandro Lazaric, Marcello Restelli. Sparse Multi-task Reinforcement Learning. NIPS - Advances in Neural Information Processing Systems 26, Dec 2014, Montreal, Canada. ⟨hal-01073513⟩



Les métriques sont temporairement indisponibles