Learning and exploitation do not conflict under minimax optimality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1224, Issue , 1997, Pages 242-249

  Szepesvári, Csaba ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

Author keywords

Dynamic games; Reinforcement learning; Self optimizing systems

Indexed keywords

COST FUNCTIONS; DYNAMIC PROGRAMMING; MACHINE LEARNING;

ACTION SELECTION; ASYMPTOTICALLY OPTIMAL; DETERMINISTIC GAMES; DYNAMIC GAME; OPTIMAL STRATEGIES; OPTIMALITY CRITERIA; REAL-TIME DYNAMIC PROGRAMMING; SELF-OPTIMIZING SYSTEMS;

REINFORCEMENT LEARNING;

EID: 84947910334     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62858-4_89     Document Type: Conference Paper

References (14)

1. A. G. Barto, S. J. Bradtke, and S. P. Singh. Learning to act using real-time dynamic programming. Artificial Intelligence, 72:91-138, 1995. Technical Report 91-57, Computer Science Department, University of Massachusetts, Vol. 59., 1991.
2. Justin A. Boyan. Modular Neural Networks for Learning Context-Dependent Game Strategies. Master's thesis, Department of Engineering and Computer Laboratory, University of Cambridge, Cambridge, UK, August 1992.
3. E. B. Dynkin and A. A. Yushkevich. Controlled Markov Processes. Springer-Verlag, Berlin, 1979.
4. M. Heger. Risk-sensitive decision making. PhD thesis, Zentrum für Kognitionwissenschaften, Universits Bremen, FB3 Informatik, Postfach 330 440, 28334 Bremen, Germany, 1996.
5. R. E. Korf. Real-time heuristic search. Artificial Intelligence, 42:189-211, 1990.
6. M. L. Littman and Cs. Szepesvs A Generalized Reinforcement Learning Model: convergence and applications. In Int. Conf. on Machine Learning, 1996. http://iserv.iki.kfki.hu/asl-publs.html.
7. Nicol N. Schraudolph, Peter Dayan, and Terrence J. Sejnowski. Using the TD() algorithm to learn an evaluation function for the game of Go. In Advances in Neural Information Processing Systems 6, Morgan Kaufmann, San Mateo, CA, 1994.
8. L. S. Shapley. Stochastic games. Proceedings of the National Academy of Sciences of the United States of America, 39:1095-1100, 1953.
9. C. Stein. A two-sample test for a linear hypothesis whose power is independent of variance. Ann. Math. Statist., 16, 1945.
10. Cs. Szepesvári. Certainty equivalence policies are self-optimizing under minimax optimality. Technical Report 96-101, Research Group on Artificial Intelligence, JATE-MTA, Szeged 6720, Aradi vrt tere 1., HUNGARY, August 1996. URL: http://www.inf.u-szeged.hu/~rgai.
11. Cs. Szepesvs Some basic facts concerning minimax sequential decision problems. Technical Report 96-100, Research Group on Artificial Intelligence, JATE-MTA, Szeged 6720, Aradi vrt tere 1, HUNGARY, August 1996. URL: http://www.inf.uszeged.hu/-rgai.
12. Cs. Szepesvdri and M. Littman. Generalized Markov Decision Processes: Dynamic programming and reinforcement learning algorithms. Operations Research, 1996. in preparation.
13. Gerald Tesauro. Temporal difference learning and TD-Gammon. Communications of the ACM, 58-67, March 1995.
14. Sebastian Thrun. Learning to play the game of chess. In Neural Information Processing Systems '7, 1995.