Trans-dimensional MCMC for Bayesian policy learning

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Hoffman, Matt ^a   Doucet, Arnaud ^a   De Freitas, Nando ^a   Jasra, Ajay ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; INFERENCE ENGINES; MARKOV PROCESSES; MAXIMUM PRINCIPLE; STOCHASTIC CONTROL SYSTEMS; STOCHASTIC MODELS;

BAYESIAN; CONTROL PROBLEMS; MARKOV CHAIN MONTE CARLO; MARKOV CHAIN MONTE-CARLO; PARAMETERS ESTIMATION; PLANNING AND CONTROL; PLANNING PROBLEM; POLICY LEARNING; STOCHASTIC CONTROL; STOCHASTIC PLANNING;

STOCHASTIC SYSTEMS;

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

References (21)

1. C. Andrieu, N. de Freitas, A. Doucet, and M. I. Jordan. An introduction to MCMC for machine learning. Machine Learning, 50:5-43, 2003.
2. H. Attias. Planning by probabilistic inference. In Uncertainty in Artificial Intelligence, 2003.
3. J. Baxter and P. L. Bartlett. Infinite-horizon policy-gradient estimation. Journal of Artificial Intelligence Research, 15:319-350, 2001.
4. D. P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 1995.
5. P. Dayan and G. E. Hinton. Using EMfor reinforcement learning. Neural Computation, 9:271-278, 1997.
6. A. Doucet and V. B. Tadic. On solving integral equations using Markov chain Monte Carlo methods. Technical Report CUED-F-INFENG 444, Cambridge University Engineering Department, 2004.
7. P. J. Green. Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika, 82:711-732, 1995.
8. P. J. Green. Trans-dimensional Markov chain Monte Carlo. In Highly Structured Stochastic Systems, 2003.
9. M. Klaas, M. Briers, N. de Freitas, A. Doucet, and S. Maskell. Fast particle smoothing: If i had a million particles. In International Conference on Machine Learning, 2006.
10. G. Lawrence, N. Cowan, and S. Russell. Efficient gradient estimation for motor control learning. In Uncertainty in Artificial Intelligence, pages 354-36, 2003.
11. P. Müller. Simulation based optimal design. Bayesian Statistics, 6, 1999.
12. P. Müller, B. Sansó, and M. De Iorio. Optimal Bayesian design by inhomogeneous Markov chain simulation. J. American Stat. Assoc., 99:788-798, 2004. (Pubitemid 39332860)
13. A. Ng, A. Coates,M. Diel, V. Ganapathi, J. Schulte, B. Tse, E. Berger, and E. Liang. Inverted autonomous helicopter flight via reinforcement learning. In International Symposium on Experimental Robotics, 2004.
14. A. Y. Ng and M. I. Jordan. PEGASUS: A policy search method for large MDPs and POMDPs. In Uncertainty in Artificial Intelligence, 2000.
15. J. Peters and S. Schaal. Policy gradient methods for robotics. In IEEE International Conference on Intelligent Robotics Systems, 2006.
16. M. Porta, N. Vlassis, M. T. J. Spaan, and P. Poupart. Point-based value iteration for continuous POMDPs. Journal of Machine Learning Research, 7:2329-2367, 2006. (Pubitemid 44708007)
17. S. Richardson and P. J. Green. On Bayesian analysis of mixtures with an unknown number of components. Journal of the Royal Statistical Society B, 59(4):731-792, 1997. (Pubitemid 127686979)
18. S. Thrun. Monte Carlo POMDPs. In S. Solla, T. Leen, and K.-R. Müller, editors, Neural Information Processing Systems, pages 1064-1070. MIT Press, 2000.
19. M. Toussaint, S. Harmeling, and A. Storkey. Probabilistic inference for solving (PO)MDPs. Technical Report EDI-INF-RR-0934, University of Edinburgh, School of Informatics, 2006.
20. M. Toussaint and A. Storkey. Probabilistic inference for solving discrete and continuous state Markov decision processes. In International Conference on Machine Learning, 2006.
21. D. Verma and R. P. N. Rao. Planning and acting in uncertain environments using probabilistic inference. In IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2006.