Improved Bayes Regret Bounds for Multi-Task Hierarchical Bayesian Bandit Algorithms Jiechao Guan 1 Hui Xiong 1,2, 1 AI Thrust, The Hong Kong University of Science and Technology (Guangzhou), China

Feb-16-2026, 08:13:58 GMT–Neural Information Processing Systems 

Hierarchical Bayesian bandit refers to the multi-task bandit problem in which bandit tasks are assumed to be drawn from the same distribution.