Model-based Bayesian reinforcement learning in large structured domains

Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008

Volumn , Issue , 2008, Pages 476-483

  Ross, Stéphane ^a   Pineau, Joelle ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN FRAMEWORKS; MODEL PARAMETERS; ON-LINE PLANNING; OPTIMAL SEQUENCE;

ARTIFICIAL INTELLIGENCE; DYNAMICAL SYSTEMS; OPTIMIZATION; REINFORCEMENT;

REINFORCEMENT LEARNING;

EID: 77955213275     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Bellman, R. (1957). A markovian decision process. Journal of Mathematics and Mechanics, 6.
2. Boutilier, C., Dearden, R., & Goldszmidt, M. (2000). Stochastic dynamic programming with factored representations. Artif. Intel., 121(1-2), 49-107.
3. Dearden, R., Friedman, N., & Andre, D. (1999). Model based bayesian exploration. In UAI, pp. 150-159.
4. Duff, M. (2002). Optimal learning: Computational procedures for Bayes-adaptive Markov decision processes. Ph.D. thesis, University of Massassachusetts Amherst.
5. Eaton, D., & Murphy, K. (2007). Bayesian structure learning using dynamic programming and MCMC. In UAI.
6. Friedman, N., & Koller, D. (2003). Being Bayesian about Bayesian network structure: A Bayesian approach to structure discovery in Bayesian networks. Machine Learning, 50(1-2), 95-125.
7. Guestrin, C., Koller, D., Parr, R., & Venkataraman, S. (2003). Efficient solution algorithms for factored MDPs. Journal of Artificial Intelligence Research, 19, 399-468. (Pubitemid 41525926)
8. Heckerman, D., Geiger, D., & Chickering, D. M. (1995). Learning bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20(3), 197-243.
9. Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998). Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2), 99-134. (Pubitemid 128387390)
10. McAllester, D., & Singh, S. (1999). Approximate Planning for Factored POMDPs using Belief State Simplification. In UAI, pp. 409-416.
11. Poupart, P., Vlassis, N., Hoey, J., & Regan, K. (2006). An analytic solution to discrete Bayesian reinforcement learning. In ICML, pp. 697-704.
12. Sutton, R., & Barto, A. (1998). Reinforcement Learning: An Introduction. MIT Press.