Competing with stationary prediction strategies
Machine Learning
2007-05-23 v1
Abstract
In this paper we introduce the class of stationary prediction strategies and construct 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; we argue that it is natural to consider only stationary strategies even for highly non-stationary environments.
Keywords
Cite
@article{arxiv.cs/0607067,
title = {Competing with stationary prediction strategies},
author = {Vladimir Vovk},
journal= {arXiv preprint arXiv:cs/0607067},
year = {2007}
}
Comments
20 pages