📝 Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
Published in IEEE Internation Symposium on Information Theory (ISIT), 2026, 2026
🎯 The principal aim of our work is to analyze such regret-tail behavior of optimal bandit algorithms in a relatively broader setting: policies that are optimized for generic families of reward distributions under significantly weaker structural assumptions
Recommended citation: https://arxiv.org/pdf/2604.14876
