'Group discussion leader' presentation slideshows

General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning

General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. Duke University Machine Learning Group Discussion Leader: Kai Ni June 17, 2005. Outline. Reinforcement Learning Explicit Explore or Exploit (E 3 ) algorithm Implicit Explore or Exploit (R-Max) algorithm Conclusions.

358 views • 19 slides