Statistical mechanics of mutual information maximization

Urbanczik, R. (2000). Statistical mechanics of mutual information maximization. Europhysics Letters, 49 (5), pp. 685-691.

Abstract

An unsupervised learning procedure based on maximizing the mutual information between the outputs of two networks receiving different but statistically dependent inputs is analyzed (Becker S. and Hinton G., Nature, 355 (1992) 161). By exploiting a formal analogy to supervised learning in parity machines, the theory of zero-temperature Gibbs learning for the unsupervised procedure is presented for the case that the networks are perceptrons and for the case of fully connected committees.

Publication DOI: https://doi.org/10.1209/epl/i2000-00205-7
Divisions: Aston University (General)
Additional Information: Copyright of EDP Sciences
Uncontrolled Keywords: unsupervised learning procedure,networks,supervised learning
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
http://iopscien ... ect=.iopscience (Publisher URL)
Published Date: 2000-03
Authors: Urbanczik, R.

Download

[img]

Version: Published Version


Export / Share Citation


Statistics

Additional statistics for this record