메뉴 건너뛰기




Volumn , Issue , 2006, Pages 485-493

Incremental model-based learners with formal learning-time guarantees

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SPACES; COMPUTATIONAL COSTS; COMPUTATIONAL DEMANDS; EXPERIMENTAL EVALUATION; FINITE STATE; INTERNAL MODELS; INTERVAL ESTIMATION; LARGE-SCALE PROBLEM; MARKOV DECISION PROCESSES; MODEL-BASED ALGORITHMS; PROBABLY APPROXIMATELY CORRECT; THEORETICAL FRAMEWORK;

EID: 34548745051     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (40)

References (11)
  • 1
    • 0029210635 scopus 로고
    • Learning to act using real-time dynamic programming
    • Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence, 72, 81-138.
    • (1995) Artificial Intelligence , vol.72 , pp. 81-138
    • Barto, A.G.1    Bradtke, S.J.2    Singh, S.P.3
  • 3
    • 0041965975 scopus 로고    scopus 로고
    • R-MAX - A general polynomial time algorithm for near-optimal reinforcement learning
    • Brafman, R. I., & Tennenholtz, M. (2002). R-MAX - a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research, 3, 213-231.
    • (2002) Journal of Machine Learning Research , vol.3 , pp. 213-231
    • Brafman, R.I.1    Tennenholtz, M.2
  • 7
    • 23244466805 scopus 로고    scopus 로고
    • Doctoral dissertation, Gatsby Computational Neuroscience Unit, University College London
    • Kakade, S. M. (2003). On the sample complexity of reinforcement learning. Doctoral dissertation, Gatsby Computational Neuroscience Unit, University College London.
    • (2003) On the Sample Complexity of Reinforcement Learning
    • Kakade, S.M.1
  • 8
    • 0036832954 scopus 로고    scopus 로고
    • Near-optimal reinforcement learning in polynomial time
    • Kearns, M. J., & Singh, S. P. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49, 209-232.
    • (2002) Machine Learning , vol.49 , pp. 209-232
    • Kearns, M.J.1    Singh, S.P.2
  • 11
    • 0021518106 scopus 로고
    • A theory of the learnable
    • Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
    • (1984) Communications of the ACM , vol.27 , pp. 1134-1142
    • Valiant, L.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.