Optimal Exploration is no harder than Thompson Sampling

Zhaoqi Li, Kevin Jamieson, Lalit Jain

Given a set of arms $\mathcal{Z}\subset {\mathbb{R}}^d$ and an unknown parameter vector ${\theta }_{\ast }\in {\mathbb{R}}^d$, the pure exploration linear bandit problem aims to return $\arg\max_{…