Scalable and Efficient Bayes-Adaptive Reinforcement Learning Based on Monte-Carlo Tree Search

DOI10.1613/jair.4117zbMath1361.68179OpenAlexW2149586740MaRDI QIDQ2871460

David Silver, Arthur Guez, Peter Dayan

Publication date: 8 January 2014

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4117

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Reward Maximization Through Discrete Active Inference ⋮ Totally model-free actor-critic recurrent neural-network reinforcement learning in non-Markovian domains ⋮ Unnamed Item ⋮ Learning and planning in partially observable environments without prior domain knowledge

This page was built for publication: Scalable and Efficient Bayes-Adaptive Reinforcement Learning Based on Monte-Carlo Tree Search