Optimal Exploration is no harder than Thompson Sampling.

Zhaoqi Li Kevin G. Jamieson Lalit Jain

Published in: CoRR (2023)

Keyphrases

monte carlo
databases
training data
bayesian networks
optimal solution
np hard
dynamic programming
worst case
np complete
sample size
finding optimal
asymptotically optimal
optimal design
sampling strategies
real time
sampling strategy
globally optimal
random sampling
closed form
computational complexity
data sets