Optimal Nonlinear Prediction of Random Fields on Networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2003

Optimal Nonlinear Prediction of Random Fields on Networks

Résumé

It is increasingly common to encounter time-varying random fields on networks (metabolic networks, sensor arrays, distributed computing, etc.).This paper considers the problem of optimal, nonlinear prediction of these fields, showing from an information-theoretic perspective that it is formally identical to the problem of finding minimal local sufficient statistics.I derive general properties of these statistics, show that they can be composed into global predictors, and explore their recursive estimation properties.For the special case of discrete-valued fields, I describe a convergent algorithm to identify the local predictors from empirical data, with minimal prior information about the field, and no distributional assumptions.
Fichier principal
Vignette du fichier
dmAB0102.pdf (199.64 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01183318 , version 1 (12-08-2015)

Identifiants

Citer

Cosma Rohilla Shalizi. Optimal Nonlinear Prediction of Random Fields on Networks. Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.11-30, ⟨10.46298/dmtcs.2310⟩. ⟨hal-01183318⟩

Collections

TDS-MACS
49 Consultations
830 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More