资源分类
》 资源 》论文》Information Geometry and Minimum Description Length Networks

Information Geometry and Minimum Description Length Networks

2020-03-05 | |  46 |   52 |   0

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.

上一篇：The Kendall and Mallows Kernels for Permutations

下一篇：Low-Rank Matrix Recovery from Row-and-Column Affine Measurements

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...