Minimax pac bounds on the sample complexity of reinforcement learning with a generative model

Fulltext present in this item

Format: PDF

Description: preprint version

Title:	Minimax pac bounds on the sample complexity of reinforcement learning with a generative model
Author(s):	Azar, M.G. ; Munos, R.; Kappen, H.J.
Publication year:	2013
Source:	Machine Learning, vol. 91, iss. 3, (2013), pp. 325-349
ISSN:	0885-6125
DOI:	https://doi.org/10.1007/s10994-013-5368-1
Publication type:	Article / Letter to editor
Please use this identifier to cite or link to this item : http://hdl.handle.net/2066/111191
Display more details
Subject:	Biophysics DCN NN - Brain networks and neuronal communication
Organization:	Biophysics
Journal title:	Machine Learning
Volume:	vol. 91
Issue:	iss. 3
Page start:	p. 325
Page end:	p. 349

Faculty of Science [26415]
Open Access publications [49302]
Freely accessible full text publications
Electronic publications [76821]
Freely accessible full text publications plus those not yet available due to embargo
Academic publications [168484]
Academic output Radboud University