暂无分享,去创建一个
Lihong Li | Michael L. Littman | David Wingate | Ali Nouri | John Asmuth | M. Littman | J. Asmuth | Lihong Li | A. Nouri | D. Wingate
[1] W. R. Thompson. ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES , 1933 .
[2] École d'été de probabilités de Saint-Flour,et al. École d'été de probabilités de Saint-Flour XIII - 1983 , 1985 .
[3] D. Aldous. Exchangeability and related topics , 1985 .
[4] Sebastian Thrun,et al. The role of exploration in learning control , 1992 .
[5] Donald A. Sofge,et al. Handbook of Intelligent Control: Neural, Fuzzy, and Adaptive Approaches , 1992 .
[6] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[7] Malcolm J. A. Strens,et al. A Bayesian Framework for Reinforcement Learning , 2000, ICML.
[8] Ronen I. Brafman,et al. R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning , 2001, J. Mach. Learn. Res..
[9] Sham M. Kakade,et al. On the sample complexity of reinforcement learning. , 2003 .
[10] Michael Kearns,et al. Near-Optimal Reinforcement Learning in Polynomial Time , 2002, Machine Learning.
[11] Thomas L. Griffiths,et al. Infinite latent feature models and the Indian buffet process , 2005, NIPS.
[12] Tao Wang,et al. Bayesian sparse sampling for on-line reward optimization , 2005, ICML.
[13] Tong Zhang. From ɛ-entropy to KL-entropy: Analysis of minimum information complexity density estimation , 2006, math/0702653.
[14] Jesse Hoey,et al. An analytic solution to discrete Bayesian reinforcement learning , 2006, ICML.
[15] Lihong Li,et al. Incremental Model-based Learners With Formal Learning-Time Guarantees , 2006, UAI.
[16] Alan Fern,et al. Multi-task reinforcement learning: a hierarchical Bayesian approach , 2007, ICML '07.
[17] Michael L. Littman,et al. Efficient Reinforcement Learning with Relocatable Action Models , 2007, AAAI.
[18] K. Fernow. New York , 1896, American Potato Journal.
[19] Joshua B. Tenenbaum,et al. Church: a language for generative models , 2008, UAI.