Ilya: 1 revision imported

2018-07-04T16:28:37Z

1 revision imported

nemenman>Ilya at 22:37, 12 November 2006

2006-11-12T22:37:08Z

New page

{{Back to publ}}
W Bialek, I Nemenman, and N Tishby. Predictability, complexity, and learning. ''Neur. Comp.'', '''13''':2409-2463, 2001. [[media:bnt_01.pdf | PDF]], [http://arxiv.org/absphysics/0007070 arXiv].
;Abstract: We define predictive information <math>I_{pred}(T)</math> as the mutual information between the past and the future of a time series. Three qualitatively different behaviors are found in the limit of large observation times T: <math>I_{pred}(T)</math> can remain finite, grow logarithmically, or grow as a fractional power law. If the time series allows us to learn a model with a finite number of parameters, then <math>I_{pred}(T)</math> grows logarithmically with a coefficient that counts the dimensionality of the model space. In contrast, power-law growth is associated, for example, with the learning of infinite parameter (or nonparametric) models such as continuous functions with smoothness constraints. There are connections between the predictive information and measures of complexity that have been defined both in learning theory and the analysis of physical systems through statistical mechanics and dynamical systems theory. Furthermore, in the same way that entropy provides the unique measure of available information consistent with some simple and plausible conditions, we argue that the divergent part of <math>I_{pred}(T)</math> provides the unique measure for the complexity of dynamics underlying a time series. Finally, we discuss how these ideas may be useful in problems in physics, statistics, and biology.
;Comments: Extended version of [[Bialek et al., 2001a]].

← Older revision	Revision as of 16:28, 4 July 2018
(No difference)

Bialek et al., 2001b - Revision history

Ilya: 1 revision imported

nemenman>Ilya at 22:37, 12 November 2006