Lecture Notes in Computer Science, 2007, Volume 4539/2007, 439-453, DOI: 10.1007/978-3-540-72927-3_32

Competing with Stationary Prediction Strategies

Vladimir Vovk

View Related Documents

Abstract

This paper introduces the class of stationary prediction strategies and constructs a prediction algorithm that asymptotically performs as well as the best continuous stationary strategy. We make mild compactness assumptions but no stochastic assumptions about the environment. In particular, no assumption of stationarity is made about the environment, and the stationarity of the considered strategies only means that they do not depend explicitly on time;
it is natural to consider only stationary strategies for many non-stationary environments.

Fulltext Preview

Image of the first page of the fulltext document