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