An impossibility result for process discrimination - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2009

An impossibility result for process discrimination

Daniil Ryabko
  • Fonction : Auteur
  • PersonId : 848126

Résumé

Two series of binary observations $x_1,x_1,\dots$ and $y_1,y_2,\dots$ are presented: at each time $n\in\N$ we are given $x_n$ and $y_n$. It is assumed that the sequences are generated independently of each other by two B-processes. We are interested in the question of whether the sequences represent a typical realization of two different processes or of the same one. We demonstrate that this is impossible to decide, in the sense that every discrimination procedure is bound to err with non-negligible frequency when presented with sequences from some B-processes. This contrasts earlier positive results on B-processes, in particular those showing that there are consistent $\bar d$-distance estimates for this class of processes.
Fichier principal
Vignette du fichier
discr.pdf (146.78 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00319076 , version 1 (05-09-2008)
inria-00319076 , version 2 (11-01-2009)
inria-00319076 , version 3 (11-01-2009)
inria-00319076 , version 4 (08-05-2009)
inria-00319076 , version 5 (09-05-2009)
inria-00319076 , version 6 (09-05-2009)
inria-00319076 , version 7 (10-07-2009)

Identifiants

  • HAL Id : inria-00319076 , version 7
  • ARXIV : 0809.1053

Citer

Daniil Ryabko. An impossibility result for process discrimination. International Symposium on Information Theory, IEEE, 2009, Seoul, South Korea. pp.1734-1738. ⟨inria-00319076v7⟩
167 Consultations
197 Téléchargements

Altmetric

Partager

More