Ensembles of neural networks for robust reinforcement learning

Proceedings - 9th International Conference on Machine Learning and Applications, ICMLA 2010

Volumn , Issue , 2010, Pages 401-406

  Hans, Alexander ^a   Udluft, Steffen ^b  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK APPLICATIONS; FUNCTION APPROXIMATORS; LEARNING PROCESS; LOCAL MINIMUMS; MAJORITY VOTING; NEAR-OPTIMAL POLICIES; NETWORK TOPOLOGY; OPTIMAL CONTROL PROBLEM; OVERFITTING; SINGLE NETWORKS; TRAINING PROCESS;

BENCHMARKING; ELECTRIC NETWORK TOPOLOGY; ITERATIVE METHODS; LEARNING ALGORITHMS; OPTIMIZATION; REINFORCEMENT LEARNING;

NEURAL NETWORKS;

EID: 79952394156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLA.2010.66     Document Type: Conference Paper

References (19)

1. R. Sutton and A. Barto, Reinforcement Learning: An Introduction. MIT Press, 1998.
2. G. J. Gordon, "Stable function approximation in dynamic programming," in Proc. of the Int. Conf. on Machine Learning, 1995.
3. D. Ernst, P. Geurts, and L. Wehenkel, "Tree-based batch mode reinforcement learning," Journal of Machine Learning Research, vol. 6, pp. 503-556, 2005.
4. M. G. Lagoudakis and R. Parr, "Least-squares policy iteration," Journal of Machine Learning Research, pp. 1107-1149, 2003.
5. M. Riedmiller, "Neural fitted Q-iteration - first experiences with a data efficient neural reinforcement learning method," in Proc. of the 16th European Conf. on Machine Learning, 2005, pp. 317-328.
6. T. Dietterich, "Ensemble methods in machine learning," Multiple classifier systems, pp. 1-15, 2000.
7. M. Wiering and H. van Hasselt, "Ensemble algorithms in reinforcement learning." IEEE transactions on systems, man, and cybernetics, vol. 38, no. 4, 2008.
8. L. Breiman, "Random forests," Machine learning, vol. 45, no. 1, pp. 5-32, 2001.
9. D. Schneegass, S. Udluft, and T. Martinetz, "Neural rewards regression for near-optimal policy identification in Markovian and partial observable environments," in Proc. of the European Symposium on Artificial Neural Networks, 2007.
10. G. J. Gordon, "Reinforcement learning with function approximation converges to a region," Advances in neural information processing systems, pp. 1040-1046, 2001.
11. T. Gabel and M. Riedmiller, "Reducing policy degradation in neuro-dynamic programming," Proc. of the European Symposium on Artificial Neural Networks, 2006.
12. S. Thrun and A. Schwartz, "Issues in using function approximation for reinforcement learning," in Proc. of the 1993 Connectionist Models Summer School, Hillsdale, NJ, 1993.
13. C. Gaskett, "Q-learning for robot control," Ph.D. dissertation, The Australian National University, 2002.
14. L. Breiman, "Bagging predictors," Machine learning, vol. 24, no. 2, pp. 123-140, 1996.
15. Y. Freund, R. Schapire, and N. Abe, "A short introduction to boosting," Journal of the Japanese Society for Artificial Intelligence, vol. 14, pp. 771-780, 1999.
16. H.-G. Zimmermann, R. Grothmann, A. M. Schaefer, and C. Tietz, "Modeling large dynamical systems with dynamical consistent neural networks," in New Directions in Statistical Signal Processing: From Systems to Brain, S. Haykin, J. Principe, T. Sejnowski, and J. McWhirter, Eds. MIT Press, 2006, pp. 203-242.
17. A. M. Schaefer, S. Udluft, and H.-G. Zimmermann, "A recurrent control neural network for data efficient reinforcement learning," in Proc. of the IEEE Int. Symposium on Approximate Dynamic Programming and Reinforcement Learning, Honolulu, HI, 2007.
18. H. van Hasselt, personal communication, 2010.
19. R. Neuneier and H.-G. Zimmermann, "How to train neural networks," in Neural Networks: Tricks of the Trade, G. B. Orr and K.-R. Müller, Eds., 1996, pp. 373-423.