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]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