Login / Signup
Worst-Case Regret Bounds for Exploration via Randomized Value Functions.
Daniel Russo
Published in:
NeurIPS (2019)
Keyphrases
</>
worst case
lower bound
regret bounds
upper bound
np hard
feature selection
decision trees
computational complexity
multi class