Multi-task Reinforcement Learning in Partially Observable Stochastic Environments

被引:0
作者
Li, Hui [1 ]
Liao, Xuejun [1 ]
Carin, Lawrence [1 ]
机构
[1] Duke Univ, Dept Elect & Comp Engn, Durham, NC 27708 USA
关键词
reinforcement learning; partially observable Markov decision processes; multi-task learning; Dirichlet processes; regionalized policy representation; HIDDEN MARKOV-MODELS; INFINITE-HORIZON; DISTRIBUTIONS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of multi-task reinforcement learning (MTRL) in multiple partially observable stochastic environments. We introduce the regionalized policy representation (RPR) to characterize the agent's behavior in each environment. The RPR is a parametric model of the conditional distribution over current actions given the history of past actions and observations; the agent's choice of actions is directly based on this conditional distribution, without an intervening model to characterize the environment itself. We propose off-policy batch algorithms to learn the parameters of the RPRs, using episodic data collected when following a behavior policy, and show their linkage to policy iteration. We employ the Dirichlet process as a nonparametric prior over the RPRs across multiple environments. The intrinsic clustering property of the Dirichlet process imposes sharing of episodes among similar environments, which effectively reduces the number of episodes required for learning a good policy in each environment, when data sharing is appropriate. The number of distinct RPRs and the associated clusters (the sharing patterns) are automatically discovered by exploiting the episodic data as well as the nonparametric nature of the Dirichlet process. We demonstrate the effectiveness of the proposed RPR as well as the RPR-based MTRL framework on various problems, including grid-world navigation and multi-aspect target classification. The experimental results show that the RPR is a competitive reinforcement learning algorithm in partially observable domains, and the MTRL consistently achieves better performance than single task reinforcement learning.
引用
收藏
页码:1131 / 1186
页数:56
相关论文
共 61 条
[1]  
Aberdeen D., 2002, P 19 INT C MACH LEAR, P3
[2]  
[Anonymous], 1957, Dynamic Programming
[3]  
[Anonymous], P 19 C UNC ART INT
[4]   MIXTURES OF DIRICHLET PROCESSES WITH APPLICATIONS TO BAYESIAN NONPARAMETRIC PROBLEMS [J].
ANTONIAK, CE .
ANNALS OF STATISTICS, 1974, 2 (06) :1152-1174
[5]   Task clustering and gating for Bayesian multitask learning [J].
Bakker, B ;
Heskes, T .
JOURNAL OF MACHINE LEARNING RESEARCH, 2004, 4 (01) :83-99
[6]  
BAKKER B, 2004, THESIS LEIDEN U
[7]   Infinite-horizon policy-gradient estimation [J].
Baxter, J ;
Bartlett, PL .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2001, 15 :319-350
[8]  
Beal M. J, 2003, Variational algorithms for approximate Bayesian inference
[9]   FERGUSON DISTRIBUTIONS VIA POLYA URN SCHEMES [J].
BLACKWELL, D ;
MACQUEEN, JB .
ANNALS OF STATISTICS, 1973, 1 (02) :353-355
[10]  
Blackwell D., 1965, Annals of Mathematical Statistics, V36, P226