"Minimax PAC bounds on the sample complexity of reinforcement learning with ..."

Mohammad Gheshlaghi Azar, Rémi Munos, Hilbert J. Kappen (2013)

> Home

Details and statistics

DOI: 10.1007/S10994-013-5368-1

access: open

type: Journal Article

metadata version: 2020-03-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ml/AzarMK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ml/AzarMK13
Mohammad Gheshlaghi Azar, Rémi Munos, Hilbert J. Kappen:
Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model. Mach. Learn. 91(3): 325-349 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.