Login / Signup
When Simple Exploration is Sample Efficient: Identifying Sufficient Conditions for Random Exploration to Yield PAC RL Algorithms.
Yao Liu
Emma Brunskill
Published in:
CoRR (2018)
Keyphrases
</>
sufficient conditions
efficiently computable
exponential stability
learning algorithm
lower bound
pairwise
reinforcement learning
artificial neural networks
fixed point
action selection
asymptotic stability