no code implementations • 27 Oct 2022 • Felix Schur, Parnian Kassraie, Jonas Rothfuss, Andreas Krause
Our algorithm can be paired with any kernelized or linear bandit algorithm and guarantees oracle optimal performance, meaning that as more tasks are solved, the regret of LIBO on each task converges to the regret of the bandit algorithm with oracle knowledge of the true kernel.
