Prediction of binary sequences using finite memory
Meir Feder, E. Federovski · 2002
We provide a non-asymptotic analysis of two common finite memory predictors for binary sequences: a predictor with a saturated counter and a predictor that uses only a finite window of past samples. The saturated counter predictor is superior.