Information Geometry and Minimum Description Length Networks

[edit]

Ke Sun, Jun Wang, Alexandros Kalousis, Stephan Marchand-Maillet ;
Proceedings of the 32nd International Conference on Machine Learning, PMLR 37:49-58, 2015.

Abstract

We study parametric unsupervised mixture learning. We measure the loss of intrinsic information from the observations to complex mixture models, and then to simple mixture models. We present a geometric picture, where all these representations are regarded as free points in the space of probability distributions. Based on minimum description length, we derive a simple geometric principle to learn all these models together. We present a new learning machine with theories, algorithms, and simulations.

Related Material