Skip to Main content Skip to Navigation
New interface
Conference papers

Characterizing predictable classes of processes

Daniil Ryabko 1, 2 
2 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Abstract : The problem is sequence prediction in the following setting. A sequence $x_1,\dots,x_n,\dots$ of discrete-valued observations is generated according to some unknown probabilistic law (measure) $\mu$. After observing each outcome, it is required to give the conditional probabilities of the next observation. The measure $\mu$ belongs to an arbitrary class $\C$ of stochastic processes. We are interested in predictors $\rho$ whose conditional probabilities converge to the ``true'' $\mu$-conditional probabilities if any $\mu\in\C$ is chosen to generate the data. We show that if such a predictor exists, then a predictor can also be obtained as a convex combination of a countably many elements of $\C$. In other words, it can be obtained as a Bayesian predictor whose prior is concentrated on a countable set. This result is established for two very different measures of performance of prediction, one of which is very strong, namely, total variation, and the other is very weak, namely, prediction in expected average Kullback-Leibler divergence.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Daniil Ryabko Connect in order to contact the contributor
Submitted on : Tuesday, May 26, 2009 - 10:10:50 PM
Last modification on : Thursday, January 20, 2022 - 4:17:20 PM
Long-term archiving on: : Thursday, June 10, 2010 - 7:59:21 PM


Files produced by the author(s)


  • HAL Id : inria-00388523, version 1
  • ARXIV : 0905.4341



Daniil Ryabko. Characterizing predictable classes of processes. UAI, 2009, Montreal, Canada. pp.471-478. ⟨inria-00388523⟩



Record views


Files downloads