Parameter-Free Heavy-Tailed Bandits
This work resolves the assumption-free adaptation problem for heavy-tailed bandits and characterize the price in the regret of not knowing the tail parameters and introduces a scheduled-exploration algorithm that requires no knowledge of $u$ and matches the resulting adaptation frontier up to logarithmic factors.