Abstract
This paper proposes a new architecture to build a hybrid value function estimation based on a combination of temporal-different (TD) and on-line variant of Random Forest (RF). We call this implementation Random-TD. The approach iteratively improves its value function by exploiting only relevant parts of action space. We evaluate the potential of the proposed procedure in terms of a reduction in the Bellman error. The results demonstrate that our approach can significantly improve the performance of TD methods and speed up learning process.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sutton, R., & Barto, A.: “Reinforcement Learning: An introduction,” Cambring, MA: MIT Press, 1998.
Leo Breiman.: “Random Forests,” Machine Learning, 45(1):5.32, 2001.
Hassab Elgawi Osman.: “Online Random Forests based on CorrFS and CorrBE,” In Proc.IEEE workshop on online classification, CVPR, 2008.
Guvenir, H. A., & Uysal, I.: Bilkent University function approximation repository, 2000. Available online at http://funapp.cs.bilkent.edu.tr/DataSets/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London Limited
About this paper
Cite this paper
Osman, H.E. (2009). Architecture of Knowledge-based Function Approximator. In: Bramer, M., Petridis, M., Coenen, F. (eds) Research and Development in Intelligent Systems XXV. SGAI 2008. Springer, London. https://doi.org/10.1007/978-1-84882-171-2_27
Download citation
DOI: https://doi.org/10.1007/978-1-84882-171-2_27
Publisher Name: Springer, London
Print ISBN: 978-1-84882-170-5
Online ISBN: 978-1-84882-171-2
eBook Packages: Computer ScienceComputer Science (R0)