can be obtained from, and is logically equivalent to, an intuitively reasonable information-theoretical invariance principle Some of the implications for the priors proposed by Hartigan [1], Jaynes [2], and Skilling [3], are also discussed.

an information-theoretic objective function for temporally local predictive coding. We then show that the linear case of SFA can be interpreted as a variant of predictive coding that maximizes the mutual information between the current output of the system and the input signal in the next time step

to information theory and, more specifically, the minimum description length (MDL) principle. We look at its theoretic foundations and practical impli-cations. The MDL approach provides elegant solutions for the problem of model class selection and enables us to objectively compare any set of mod-els, regardless

to the usual objective reasons for embarking upon a line of research, the present work was neither initiated by any extant theoretical issue nor inspired by any previously published findings. It was carried out with the sole purpose of arriving at a This research was supported by National Re-search Council

A nonlinear generalisation of Schrodinger’s equation is obtained using information-theoretic arguments. The nonlinearities are controlled by an intrinsic length scale and involve derivatives to all orders thus making the equation mildly nonlocal. The nonlinear equation is homogeneous, separable

New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect

Sensory neurons adapt to changes in the natural statistics of their environments through processes such as gain control and firing threshold adjustment. It has been argued that neurons early in sensory pathways adapt according to information-theoretic criteria, perhaps maximising their coding

1 Even “dialetheists ” almost invariably accept it, though they also accept its negation. But if you don’t accept it, I invite you to substitute another example that you do accept, perhaps For every sentence, if it is true then its double negation is true, and modify the following discussion

This paper summarizes basic concepts and principles that I have found to be useful in dealing with causal reasoning. The paper is written as a companion to a lecture under the same title, to be presented at IJCAI-99, and is intended to supplement the lecture with technical details and pointers

New tools are presented for reasoning about properties of recursively defined domains. We work within a general, category-theoretic framework for various notions of `relation' on domains and for actions of domain constructors on relations. Freyd's analysis of recursive types in terms of a