Provable Benefits of Multi-task RL under Non-Markovian Decision Making Processes
Ruiquan Huang, Yuan Cheng, Jing Yang, Vincent Tan, Yingbin Liang
Abstract
In multi-task reinforcement learning (RL) under Markov decision processes (MDPs), the presence of shared latent structures among multiple MDPs has been shown to yield significant benefits to the sample efficiency compared to single-task RL. In this paper, we investigate whether such a benefit can extend to more general sequential decision making problems, such as partially observable MDPs (POMDPs) and more general predictive state representations (PSRs). The main challenge here is that the large and complex model space makes it hard to identify what types of common latent structure of multi-task PSRs can reduce the model complexity and improve sample efficiency. To this end, we posit a joint model class for tasks and use the notion of η-bracketing number to quantify its complexity; this number also serves as a general metric to capture the similarity of tasks and thus determines the benefit of multitask over single-task RL. We first study upstream multi-task learning over PSRs, in which all tasks share the same observation and action spaces. We propose a provably efficient algorithm UMT-PSR for finding near-optimal policies for all PSRs, and demonstrate that the advantage of multi-task learning manifests if the joint model class of PSRs has a smaller η-bracketing number compared to that of individual single-task learning. We also provide several example multitask PSRs with small η-bracketing numbers, which reap the benefits of multi-task learning. We further investigate downstream learning, in which the agent needs to learn a new target task that shares some commonalities with the upstream tasks via a similarity constraint. By exploiting the learned PSRs from the upstream, we develop a sample-efficient algorithm that provably finds a near-optimal policy. Upon specialization to the examples used to elucidate the η-bracketing numbers, our downstream results further highlight the benefit compared to directly learning the target PSR without upstream information. Ours is the first theoretical study that quantifies the benefits of multi-task RL with PSRs over its single-task counterpart.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on15
- CURL: Contrastive Unsupervised Representations for Reinforcement LearningMichael Laskin, Aravind Srinivas, Pieter AbbeelICML 2020 · 1,261 citations
- Learning Near Optimal Policies with Low Inherent Bellman ErrorAndrea Zanette, Alessandro Lazaric, Mykel J. Kochenderfer, Emma BrunskillICML 2020 · 238 citations
- Sharing Knowledge in Multi-Task Deep Reinforcement LearningCarlo D'Eramo, Davide Tateo, Andrea Bonarini, Marcello Restelli et al.ICLR 2020 · 148 citations
- Provable Representation Learning for Imitation Learning via Bi-level OptimizationSanjeev Arora, Simon S. Du, Sham M. Kakade, Yuping Luo et al.ICML 2020 · 65 citations
- Near-Optimal Representation Learning for Linear Bandits and Linear RLJiachen Hu, Xiaoyu Chen, Chi Jin, Lihong Li et al.ICML 2021 · 60 citations
Related papers
- Provable Benefit of Multitask Representation Learning in Reinforcement LearningYuan Cheng, Songtao Feng, Jing Yang, Hong Zhang et al.NeurIPS 2022 · 33 citations
- Learning Robust State Abstractions for Hidden-Parameter Block MDPsAmy Zhang, Shagun Sodhani, Khimya Khetarpal, Joelle PineauICLR 2021 · 5 citations
- Offline Multitask Representation Learning for Reinforcement LearningHaque Ishfaq, Thanh Nguyen-Tang, Songtao Feng, Raman Arora et al.NeurIPS 2024 · 15 citations
- PAC Reinforcement Learning for Predictive State RepresentationsWenhao Zhan, Masatoshi Uehara, Wen Sun, Jason D. LeeICLR 2023 · 1 citation
- Partially Observable RL with B-Stability: Unified Structural Condition and Sharp Sample-Efficient AlgorithmsFan Chen, Yu Bai, Song MeiICLR 2023 · 2 citations
