2019
Dying Experts: Efficient Algorithms with Optimal Regret Bounds
NeurIPS 2019poster
We study a variant of decision-theoretic online learning in which the set of experts that are available to Learner can shrink over time. This is a restricted version of the well-studied sleeping experts problem, itself a generalization of the fundamental game of prediction with expert advice. Simila…