Generalization in Reinforcement Learning: Safely Approximating the Value Function

NIPS 1994: Proceedings of the 7th International Conference on Neural Information Processing Systems

Volumn , Issue , 1994, Pages 369-376

  Boyan, Justin A ^a   Moore, Andrew W ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

REINFORCEMENT LEARNING; TABLE LOOKUP;

CURSE OF DIMENSIONALITY; FUNCTION APPROXIMATORS; FUNCTIONS APPROXIMATIONS; GENERALISATION; REINFORCEMENT LEARNINGS; VALUE FUNCTIONS;

DYNAMIC PROGRAMMING;

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

References (16)

1. A. Barto, R. Sutton, and C. Watkins. Learning and sequential decision making. Technical Report COINS 89-95, Univ. of Massachusetts, 1989
2. R. Bellman, R. Kalaba, and B. Kotkin. Polynomial approximation-a new computational technique in dynamic programming; Allocation processes. Mathematics of Computation, 17, 1963.
3. J. A. Boyan. Modular neural networks for learning context-dependent game strategies. Master's thesis, Cambridge University, 1992.
4. S, J. Bradtke. Reinforcement learning applied to linear quadratic regulation. In S. J, Hanson, J. Cowan, and C. L. Giles, editors, NIPS-5. Morgan Kaufmann, 1993.
5. W, S. Cleveland and S. J. Delvin. Locally weighted regression'. An approach to regression analysis by local fitting. JASA, 83 (403):596-610, September 1988.
6. L.-J. Lin. Reinforcement Learning for Robots Using Neural Networks. PhD thesis, Carnegie Mellon University, 1993.
7. S. Mahadevan and J. Connell. Automatic programming of behavior-baaed robots using reinforcement learning. Technical report, IBM T. J. Watson Research Center, NY 10598, 1990.
8. P. Sabes. Approximating Q-vahies with basis function representations. In Proceedings of the Fourth Connectionist Models Summer School, 1993.
9. N. Schraudolph, P. Dayan, and T. Sejnowski. Using TD (A) to learn an evaluation function for the game of Go. In J. D. Cowan, G. Tesauro, and J. Alspector, editors, NÍPS-6. Morgan Kaufmann, 1994.
10. S. P. Singh and R. Yee. An upper bound on the toss from approximate optimal-value functions. Machine Learning, 1994. Technical Note (to appear).
11. R. Sutton. Learning to predict by the methods of temporal differences. Machine Learning, 3, 1988.
12. G. Tesauro. Practical issues in temporal difference learning. Machine Learning, 8 (3/4), May 1992.
13. S. Thrun and A. Schwartz. Issues in using function approximation for reinforcement learning. In Proceedings of the Fourth Connectionist Models Summer School, 1993.
14. C. Watkins. Learning from Delayed Rewards. PhD thesis, Cambridge University, 1989.
15. R. Williams. Tight performance bounds on greedy policies based on imperfect value functions. Technical Report NU-CCS-93-13, Northeastern University, 1993.
16. R. Yee. Abstraction in control learning. Technical Report COINS 92-16, Univ. of Massachusetts, 1992.