Browsing MIT by Subject "regret bounds"
Now showing items 1-1 of 1
-
Online Learning of Non-stationary Sequences
(2005-11-17)We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a class of universal learning algorithms involving ...