arrow
Return

FIXED POINTS EM ALGORITHM AND NONNEGATIVE RANK BOUNDARIES

delete2015-02-01
delete28
delete
OA
AI
K
Kaie Kubjas *
E
Elina Robeva
B
Bernd Sturmfels
DOI:10.1214/14-AOS1282delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Mixtures of r independent distributions for two discrete random variables can be represented by matrices of nonnegative rank r. 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 3. Both of these sets correspond to algebraic varieties with many irreducible components.
Keywords:
Maximum likelihood
EM algorithm
mixture model
nonnegative rank
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Annals of Statistics cover
Annals of Statistics
IF:
3.7
Papers:
2.8K
Citations:
2.9W

Organization

A
Aalto University
Scholars:
1.6W
Papers: 1.5W
Citations: 2.1W
University of California System cover
University of California System
Scholars:
37.5W
Papers: 33.7W
Citations: 6.6K