A Tensor Low-Rank Approximation for Value Functions in Multi-Task Reinforcement Learning
In pursuit of reinforcement learning systems that could train in physical environments, we investigate multi-task approaches as a means to alleviate the need for massive data acquisition. In a tabular scenario where the Q-functions are collected across tasks, we model our learning problem as optimizing a higher order tensor structure. Recognizing that close-related tasks may require similar actions, our proposed method imposes a low-rank condition on this aggregated Q-tensor. The rationale behind this approach to multi-task learning is that the low-rank structure enforces the notion of similarity, without the need to explicitly prescribe which tasks are similar, but inferring this information from a reduced amount of data simultaneously with the stochastic optimization of the Q-tensor. The efficiency of our low-rank tensor approach to multi-task learning is demonstrated in two numerical experiments, first in a benchmark environment formed by a collection of inverted pendulums, and then into a practical scenario involving multiple wireless communication devices.
Authors
- Santiago Paternain (ORCID: https://orcid.org/0000-0001-6310-6345)
- Juan Andrés Bazerque (ORCID: https://orcid.org/0000-0001-9950-1208)
- Antonio G. Marqués (ORCID: https://orcid.org/0000-0002-4642-7718)
- Sergio Rozada (ORCID: https://orcid.org/0000-0003-1042-7502)
Institutions
- Rensselaer Polytechnic Institute (US)
- University of Pittsburgh (US)
- Universidad Rey Juan Carlos (ES)
Publication Details
- Published
- 2024-10-27
- DOI
- https://doi.org/10.1109/ieeeconf60004.2024.10942931
- Citations
- 1
- Primary Topic
- Reinforcement Learning in Robotics
- Type
- article
- Field-Weighted Citation Impact
- 0.35