| A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning Contributor(s): Geramifard, Alborz (Author), Walsh, Thomas J. (Author), Tellex, Stefanie (Author) |
|
 |
ISBN: 1601987609 ISBN-13: 9781601987600 Publisher: Now Publishers OUR PRICE: $66.50 Product Type: Paperback - Other Formats Published: December 2013 |
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Computers | Machine Theory |
| Dewey: 006.31 |
| Series: Foundations and Trends(r) in Machine Learning |
| Physical Information: 0.19" H x 6.14" W x 9.21" (0.31 lbs) 92 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: A Markov Decision Process (MDP) is a natural framework for formulating sequential decision-making problems under uncertainty. In recent years, researchers have greatly advanced algorithms for learning and acting in MDPs. This book reviews such algorithms, beginning with well-known dynamic programming methods for solving MDPs such as policy iteration and value iteration, then describes approximate dynamic programming methods such as trajectory based value iteration, and finally moves to reinforcement learning methods such as Q-Learning, SARSA, and least-squares policy iteration. It describes algorithms in a unified framework, giving pseudocode together with memory and iteration complexity analysis for each. Empirical evaluations of these techniques, with four representations across four domains, provide insight into how these algorithms perform with various feature sets in terms of running time and performance. This tutorial provides practical guidance for researchers seeking to extend DP and RL techniques to larger domains through linear value function approximation. The practical algorithms and empirical successes outlined also form a guide for practitioners trying to weigh computational costs, accuracy requirements, and representational concerns. Decision making in large domains will always be challenging, but with the tools presented here this challenge is not insurmountable. |