Login / Signup
A Lower Bound for the Sample Complexity of Inverse Reinforcement Learning.
Abi Komanduru
Jean Honorio
Published in:
ICML (2021)
Keyphrases
</>
inverse reinforcement learning
lower bound
upper bound
bayesian nonparametric
partially observable environments
preference elicitation
objective function
optimal solution
worst case
reward function
np hard
gaussian process
temporal difference