Sciweavers

79
Voted
ML
2002
ACM
121views Machine Learning» more  ML 2002»
14 years 9 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh