arXiv · 1210.0198
Maximum Likelihood for Matrices with Rank Constraints
Abstract
Maximum likelihood estimation is a fundamental optimization problem in statistics. We study this problem on manifolds of matrices with bounded rank. These represent mixtures of distributions of two independent discrete random variables. We determine the maximum likelihood degree for a range of determinantal varieties, and we apply numerical algebraic geometry to compute all critical points of their likelihood functions. This led to the discovery of maximum likelihood duality between matrices of complementary ranks, a result proved subsequently by Draisma and Rodriguez.
Explore related subjects
Keep this discovery
Jonathan Hauenstein, Jose Rodriguez, Bernd Sturmfels. 2012-09-30. Maximum Likelihood for Matrices with Rank Constraints. https://arxiv.org/abs/1210.0198
Cite the original work for its findings. Save a collection to share your selection of sources.