1 paper
X. Flora Meng, Tuhin Sarkar, Munther A. Dahleh
We study the problem of nonstochastic bandits with expert advice, extending the setting from finitely many experts to any countably infinite set: A learner aims to maximize the tot…