Learning Tetris Using the Noisy Cross-Entropy Method

DOI10.1162/neco.2006.18.12.2936zbMath1113.68454OpenAlexW2123859855WikidataQ51930656 ScholiaQ51930656MaRDI QIDQ3421374

András C. Lőrincz, István Szita

Publication date: 12 February 2007

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco.2006.18.12.2936

zbMATH Keywords

reinforcement learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

Approximate policy iteration: a survey and some new methods ⋮ Adaptive importance sampling for control and inference ⋮ Multifidelity Preconditioning of the Cross-Entropy Method for Rare Event Simulation and Failure Probability Estimation ⋮ How fast can we play Tetris greedily with rectangular pieces? ⋮ Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search ⋮ Complexity and uncertainty analysis of financial stock markets based on entropy of scale exponential spectrum ⋮ Unnamed Item

Cites Work

• A tutorial on the cross-entropy method
• Basis function adaptation in temporal difference reinforcement learning

This page was built for publication: Learning Tetris Using the Noisy Cross-Entropy Method