✦ LIBER ✦

Near-Optimal Reinforcement Learning in Polynomial Time

✍ Scribed by Michael Kearns; Satinder Singh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A near-optimal polynomial time algorithm

✍ Ronen I. Brafman; Moshe Tennenholtz 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Near-optimal reinforcement learning fram

✍ Pandana, C.; Liu, K.J.R. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 578 KB

Reinforcement Learning in Continuous Tim

✍ Doya, Kenji 📂 Article 📅 2000 🏛 MIT Press 🌐 English ⚖ 460 KB

Learning Monotone Decision Trees in Poly

✍ O'Donnell, Ryan; Servedio, Rocco A. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 241 KB

Optimal control in microgrid using multi

✍ Li, Fu-Dong; Wu, Min; He, Yong; Chen, Xin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 444 KB

Optimal Bidding Strategies in Electricit

✍ WU, Q. H.; GUO, J. 📂 Article 📅 2004 🏛 Taylor and Francis Group 🌐 English ⚖ 705 KB