"A Lower Bound for the Sample Complexity of Inverse Reinforcement Learning."

Abi Komanduru, Jean Honorio (2021)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/icml/KomanduruH21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/KomanduruH21
Abi Komanduru, Jean Honorio:
A Lower Bound for the Sample Complexity of Inverse Reinforcement Learning. ICML 2021: 5676-5685

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.