Mixture decompositions of exponential families using a decomposition of their sample spaces
Guido F. Montúfar (2013)
Kybernetika
Similarity:
We study the problem of finding the smallest such that every element of an exponential family can be written as a mixture of elements of another exponential family. We propose an approach based on coverings and packings of the face lattice of the corresponding convex support polytopes and results from coding theory. We show that is the smallest number for which any distribution of -ary variables can be written as mixture of independent -ary variables. Furthermore,...