84
44
v1v2v3 (latest)

Fixed points of the EM algorithm and nonnegative rank boundaries

Abstract

Mixtures of rr independent distributions for two discrete random variables can be represented by matrices of nonnegative rank rr. Likelihood inference for the model of such joint distributions leads to problems in real algebraic geometry that are addressed here for the first time. We characterize the set of fixed points of the Expectation-Maximization algorithm, and we study the boundary of the space of matrices with nonnegative rank at most 33. Both of these sets correspond to algebraic varieties with many irreducible components.

View on arXiv
Comments on this paper

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.