Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model. Azar, M., Munos, R., & Kappen, H. J. Machine Learning, 91(3):325–349, 2013. ![Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi bibtex @article{azar13,
title = {Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model},
author = {Azar, Mohammad and Munos, R{\'e}mi and Kappen, Hilbert J.},
year = 2013,
journal = {Machine Learning},
volume = 91,
number = 3,
pages = {325--349},
doi = {10.1007/s10994-013-5368-1},
isbn = {1573-0565},
url = {https://doi.org/10.1007/s10994-013-5368-1},
da = {2013/06/01},
date-added = {2022-06-17 09:53:28 -0400},
date-modified = {2022-06-17 09:53:28 -0400},
id = {Gheshlaghi Azar2013},
ty = {JOUR},
bdsk-url-1 = {https://doi.org/10.1007/s10994-013-5368-1}
}
Downloads: 0
{"_id":"GHqhDagJFHrbvdFnY","bibbaseid":"azar-munos-kappen-minimaxpacboundsonthesamplecomplexityofreinforcementlearningwithagenerativemodel-2013","author_short":["Azar, M.","Munos, R.","Kappen, H. J."],"bibdata":{"bibtype":"article","type":"article","title":"Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model","author":[{"propositions":[],"lastnames":["Azar"],"firstnames":["Mohammad"],"suffixes":[]},{"propositions":[],"lastnames":["Munos"],"firstnames":["Rémi"],"suffixes":[]},{"propositions":[],"lastnames":["Kappen"],"firstnames":["Hilbert","J."],"suffixes":[]}],"year":"2013","journal":"Machine Learning","volume":"91","number":"3","pages":"325–349","doi":"10.1007/s10994-013-5368-1","isbn":"1573-0565","url":"https://doi.org/10.1007/s10994-013-5368-1","da":"2013/06/01","date-added":"2022-06-17 09:53:28 -0400","date-modified":"2022-06-17 09:53:28 -0400","id":"azar13","ty":"JOUR","bdsk-url-1":"https://doi.org/10.1007/s10994-013-5368-1","bibtex":"@article{azar13,\n\ttitle = {Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model},\n\tauthor = {Azar, Mohammad and Munos, R{\\'e}mi and Kappen, Hilbert J.},\n\tyear = 2013,\n\tjournal = {Machine Learning},\n\tvolume = 91,\n\tnumber = 3,\n\tpages = {325--349},\n\tdoi = {10.1007/s10994-013-5368-1},\n\tisbn = {1573-0565},\n\turl = {https://doi.org/10.1007/s10994-013-5368-1},\n\tda = {2013/06/01},\n\tdate-added = {2022-06-17 09:53:28 -0400},\n\tdate-modified = {2022-06-17 09:53:28 -0400},\n\tid = {Gheshlaghi Azar2013},\n\tty = {JOUR},\n\tbdsk-url-1 = {https://doi.org/10.1007/s10994-013-5368-1}\n}\n","author_short":["Azar, M.","Munos, R.","Kappen, H. J."],"key":"azar13","bibbaseid":"azar-munos-kappen-minimaxpacboundsonthesamplecomplexityofreinforcementlearningwithagenerativemodel-2013","role":"author","urls":{"Paper":"https://doi.org/10.1007/s10994-013-5368-1"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/P2iq7e2YajXXHGR4t","dataSources":["Ky5NuvZDMqrjzL2Xe"],"keywords":[],"search_terms":["minimax","pac","bounds","sample","complexity","reinforcement","learning","generative","model","azar","munos","kappen"],"title":"Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model","year":2013}