All reports by Author Boris Ryabko:

__
TR02-011
| 14th October 2001
__

Boris Ryabko#### The nonprobabilistic approach to learning the best prediction.

Boris Ryabko

The problem of predicting a sequence $x_1, x_2,.... $ where each $x_i$ belongs

to a finite alphabet $A$ is considered. Each letter $x_{t+1}$ is predicted

using information on the word $x_1, x_2, ...., x_t $ only. We use the game

theoretical interpretation which can be traced to Laplace where there ...
more >>>