Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits.

Tianyuan Jin Jing Tang Pan Xu Keke Huang Xiaokui Xiao Quanquan Gu

Published in: ICML (2021)

Keyphrases

dynamic programming
optimal solution
worst case
learning algorithm
computational complexity
objective function
search space
np hard
multi objective
special case
probabilistic model
multi class
nearest neighbor
lower bound
expectation maximization
optimal strategy
multi armed bandits