Learning tetris using the noisy cross-entropy method

Neural Computation

Volumn 18, Issue 12, 2006, Pages 2936-2941

  Szita, István ^a   Lorincz, András ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER SIMULATION; ENTROPY; HUMAN; LEARNING; REINFORCEMENT; STATISTICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; ENTROPY; HUMANS; LEARNING; MODELS, STATISTICAL; REINFORCEMENT (PSYCHOLOGY);

EID: 33845344721     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/neco.2006.18.12.2936     Document Type: Article

References (11)

1. Bertsekas, D. P., & Tsitsiklis, J. N. (1996). Neuro-Dynamic Programming. Nashua, NH: Athena Scientific.
2. Bohm, N., Kokai, G., & Mandl, S. (2004). Evolving a heuristic function for the game of Tetris. In T. Scheffer (Ed.), Proc. Lernen, Wissensentdeckung und Adaptivität LWA-2004 (pp. 118-122). Berlin.
3. de Boer, P., Kroese, D., Mannor, S., & Rubinstein, R. (2004). A tutorial on the cross-entropy method. Annals of Operations Research, 134(1), 19-67.
4. Demaine, E. D., Hohenberger, S., & Liben-Nowell, D. (2003). Tetris is hard, even to approximate. In Proc. 9th International Computing and Combinatorics Conference (COCOON 2003) (pp. 351-363). Berlin: Springer.
5. Fahey, C. P. (2003). Tetris AI. Available online at http://www. colinfahey.com
6. Parias, V. F., & van Roy, B. (2006). Tetris: A study of randomized constraint sampling. In G. Calafiore & F. Dabbene (Eds.), Probabilistic and randomized methods for design under uncertainty. Berlin: Springer-Verlag.
7. Kakade, S. (2001). A natural policy gradient. In T. G. Dietterich, S. Backer, & Z. Ghahramani (Eds.), Advances in neural information 'processing systems, 14 (pp. 1531-1538). Cambridge, MA: MIT Press.
8. Lagoudakis, M. G., Parr, R., & Littman, M. L. (2002). Least-squares methods in reinforcement learning for control. In SEIN '02: Proceedings of the Second Hellenic Conference on AI (pp. 249-260). Berlin: Springer-Verlag.
9. Mannor, S., Rubinstein, R. Y., & Gat, Y. (2003). The cross-entropy method for fast policy search. In Proc. International Conf. on Machine Learning (ICML 2003), (pp. 512-519). Menlo Park, CA: AAAI Press.
10. Menache, I., Marmor, S., & Shimkin, N. (2005). Basis function adaption in temporal difference reinforcement learning. Annals of Operations Research, 134(1), 215-238.
11. Ramon, J., & Driessens, K. (2004). On the numeric stability of gaussian processes regression for relational reinforcement learning. In ICML-2004 Workshop on Relational Reinforcement Learning (pp. 10-14). N.p.: Omni press.