TY - JOUR
T1 - Efficient Reinforcement Learning in Block MDPs
T2 - 39th International Conference on Machine Learning, ICML 2022
AU - Zhang, Xuezhou
AU - Song, Yuda
AU - Uehara, Masatoshi
AU - Wang, Mengdi
AU - Agarwal, Alekh
AU - Sun, Wen
N1 - Funding Information:
Xuezhou Zhang and Mengdi Wang acknowledge support by NSF grants IIS-2107304, CMMI-1653435, AFOSR grant and ONR grant 1006977. Masatoshi Uehara is partly supported by MASASON Foundation.
Publisher Copyright:
Copyright © 2022 by the author(s)
PY - 2022
Y1 - 2022
N2 - We present BRIEE (Block-structured Representation learning with Interleaved Explore Exploit), an algorithm for efficient reinforcement learning in Markov Decision Processes with block structured dynamics (i.e., Block MDPs), where rich observations are generated from a set of unknown latent states. BRIEE interleaves latent states discovery, exploration, and exploitation together, and can provably learn a near-optimal policy with sample complexity scaling polynomially in the number of latent states, actions, and the time horizon, with no dependence on the size of the potentially infinite observation space. Empirically, we show that BRIEE is more sample efficient than the state-of-art Block MDP algorithm HOMER and other empirical RL baselines on challenging rich-observation combination lock problems which require deep exploration.
AB - We present BRIEE (Block-structured Representation learning with Interleaved Explore Exploit), an algorithm for efficient reinforcement learning in Markov Decision Processes with block structured dynamics (i.e., Block MDPs), where rich observations are generated from a set of unknown latent states. BRIEE interleaves latent states discovery, exploration, and exploitation together, and can provably learn a near-optimal policy with sample complexity scaling polynomially in the number of latent states, actions, and the time horizon, with no dependence on the size of the potentially infinite observation space. Empirically, we show that BRIEE is more sample efficient than the state-of-art Block MDP algorithm HOMER and other empirical RL baselines on challenging rich-observation combination lock problems which require deep exploration.
UR - http://www.scopus.com/inward/record.url?scp=85163060189&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85163060189&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85163060189
SN - 2640-3498
VL - 162
SP - 26517
EP - 26547
JO - Proceedings of Machine Learning Research
JF - Proceedings of Machine Learning Research
Y2 - 17 July 2022 through 23 July 2022
ER -