arXiv · cond-mat/0305254
Learning Curves for Mutual Information Maximization
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 and Hinton, Nature, 355, 92, 161). For a generic data model, I show that in the large sample limit the structure in the data is recognized by mutual information maximization. For a more restricted model, where the networks are similar to perceptrons, I calculate the learning curves for zero-temperature Gibbs learning. These show that convergence can be rather slow, and a way of regularizing the procedure is considered.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Robert Urbanczik. 2003-05-12. Learning Curves for Mutual Information Maximization. https://doi.org/10.1103/physreve.68.016106
Cite the original work for its findings. Save a collection to share your selection of sources.