Competing with Markov prediction strategies

Abstract

Assuming that the loss function is convex in the prediction, we construct a prediction strategy universal for the class of Markov prediction strategies, not necessarily continuous. Allowing randomization, we remove the requirement of convexity.

11 pages

Cited by in corpus (1)

• Metric entropy in competitive on-line prediction