Reinforcement learning with a Gaussian mixture model

Proceedings of the International Joint Conference on Neural Networks

Volumn , Issue , 2010, Pages

  Agostini, Alejandro ^a   Celaya, Enric ^a  

^a INSTITUT DE ROBÒTICA I INFORMÀTICA INDUSTRIAL CSIC UPC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; GAUSSIAN DISTRIBUTION; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE METHODS; PROBABILITY DENSITY FUNCTION;

FITTED VALUE ITERATION; FUNCTIONS APPROXIMATIONS; GAUSSIAN MIXTURE MODEL; GAUSSIAN PROCESSES; ITERATIVE PROCESS; NUMBER OF SAMPLES; REINFORCEMENT LEARNING WITH FUNCTION APPROXIMATIONS; REINFORCEMENT LEARNINGS; VALUE FUNCTIONS; VALUE ITERATION ALGORITHM;

REINFORCEMENT LEARNING;

EID: 79959391832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2010.5596306     Document Type: Conference Paper

References (25)

1. C. Stone, "Optimal global rates of convergence for nonparametric regression," The Annals of Statistics, vol. 10, no. 4, pp. 1040-1053, 1982.
2. C. Rasmussen and M. Kuss, "Gaussian processes in reinforcement learning," Advances in Neural Information Processing Systems, vol. 16, pp. 751-759, 2004.
3. M. Diesenroth, C. Rasmussen, and J. Peters, "Gaussian process dynamic programming," Neurocomputing, vol. 72, no. 7-9, pp. 1508-1524, 2009.
4. Y. Engel, S. Mannor, and R. Meir, "Reinforcement learning with Gaussian processes," in ICML '05: Proceedings of the 22nd international conference on Machine learning. New York, NY, USA: ACM, 2005, pp. 201-208.
5. -, "Bayes meets Bellman: The Gaussian process approach to temporal difference learning," in Proc. of the 20th International Conference on Machine Learning, 2003, pp. 154-161.
6. G. J. Gordon, "Stable function approximation in dynamic programming," in ICML, 1995, pp. 261-268.
7. D. Ernst, P. Geurts, and L. Wehenkel, "Tree-based batch mode reinforcement learning," J. Mach. Learn. Res., vol. 6, pp. 503-556, 2005.
8. D. Ormoneit and S. Sen, "Kernel-based reinforcement learning," Machine Learning, vol. 49, no. 2-3, pp. 161-178, 2002.
9. M. Riedmiller, "Neural Reinforcement Learning to Swing-up and Balance a Real Pole," in Proceedings of the 2005 IEEE International Conference on Systems, Man and Cybernetics, vol. 4, 2005, pp. 3191-3196.
10. -, "Neural fitted Q iteration-first experiences with a data efficient neural reinforcement learning method," Lecture notes in computer science, vol. 3720, pp. 317-328, 2005.
11. R. Sutton and A. Barto, Reinforcement Learning: An Introduction, B. Book, Ed. Cambridge, MA: MIT Press, 1998.
12. C. Watkins and P. Dayan, "Q-learning," Machine Learning, vol. 8, no. 3-4, pp. 279-292, 1992. [Online]. Available: http://jmvidal.cse.sc.edu/ library/watkins92a.pdf
13. R. Bellman and S. Dreyfus, Applied Dynamic Programming. Princeton, New Jersy: Princeton University Press, 1962.
14. C. M. Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics). Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2006.
15. M. Figueiredo, "On Gaussian radial basis function approximations: Interpretation, extensions, and learning strategies," Pattern Recognition, International Conference on, vol. 2, pp. 618-621, 2000.
16. A. Dempster, N. Laird, D. Rubin, et al., "Maximum likelihood from incomplete data via the EM algorithm," Journal of the Royal Statistical Society. Series B (Methodological), vol. 39, no. 1, pp. 1-38, 1977.
17. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern classification. New-York, USA: John Wiley and Sons, Inc, 2001.
18. M. Song and H. Wang, "Highly efficient incremental estimation of Gaussian mixture models for online data stream clustering," in Proceedings of SPIE: Intelligent Computing: Theory and Applications III, Orlando, FL, USA, 2005, pp. 174-183.
19. O. Arandjelovic and R. Cipolla, "Incremental learning of temporally-coherent Gaussian mixture models," in Technical Papers - Society of Manufacturing Engineers (SME), 2005.
20. M.-A. Sato and S. Ishii, "On-line em algorithm for the normalized Gaussian network," Neural Comput., vol. 12, no. 2, pp. 407-432, 2000.
21. S. J. Nowlan, "Soft competitive adaptation: neural network learning algorithms based on fitting statistical mixtures," Ph.D. dissertation, Pittsburgh, PA, USA, 1991.
22. R. Neal and G. Hinton, "A view of the em algorithm that justifies incremental, sparse, and other variants," in Proceedings of the NATO Advanced Study Institute on Learning in graphical models. Norwell, MA, USA: Kluwer Academic Publishers, 1998, pp. 355-368.
23. S. Thrun, "The role of exploration in learning control," in Handbook for Intelligent Control: Neural, Fuzzy and Adaptive Approaches, D.White and D. Sofge, Eds. Florence, Kentucky 41022: Van Nostrand Reinhold, 1992.
24. K. Doya, "Reinforcement learning in continuous time and space," Neural Comput., vol. 12, no. 1, pp. 219-245, 2000.
25. M.-a. Sato and S. Ishii, "Reinforcement learning based on on-line em algorithm," in Proceedings of the 1998 conference on Advances in neural information processing systems (NIPS'99). Cambridge, MA, USA: MIT Press, 1999, pp. 1052-1058.