Login / Signup
Polynomial-time Algorithms for Combinatorial Pure Exploration with Full-bandit Feedback.
Yuko Kuroki
Liyuan Xu
Atsushi Miyauchi
Junya Honda
Masashi Sugiyama
Published in:
CoRR (2019)
Keyphrases
</>
computational complexity
worst case
learning algorithm
orders of magnitude
theoretical analysis
neural network
computer vision
graph theory
recently developed
least squares
computationally efficient
randomized algorithm
benchmark datasets
upper bound
computational cost
special case
lower bound
information retrieval