The Maximum Likelihood Degree of Linear Spaces of Symmetric Matrices

12/01/2020
by   Carlos Améndola, et al.
0

We study multivariate Gaussian models that are described by linear conditions on the concentration matrix. We compute the maximum likelihood (ML) degrees of these models. That is, we count the critical points of the likelihood function over a linear space of symmetric matrices. We obtain new formulae for the ML degree, one via Schubert calculus, and another using Segre classes from intersection theory. We settle the case of codimension one models, and characterize the degenerate case when the ML degree is zero.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/16/2020

Maximum likelihood degree and space of orbits of a C^* action

We study the maximum likelihood (ML) degree of linear concentration mode...
05/17/2019

Maximum Likelihood Estimation of Toric Fano Varieties

We study the maximum likelihood estimation problem for several classes o...
11/17/2020

Complete quadrics: Schubert calculus for Gaussian models and semidefinite programming

We establish connections between: the maximum likelihood degree (ML-degr...
11/30/2020

Linear Spaces of Symmetric Matrices with Non-Maximal Maximum Likelihood Degree

We study the maximum likelihood degree of linear concentration models in...
11/17/2020

Maximum Likelihood Estimation for Nets of Conics

We study the problem of maximum likelihood estimation for 3-dimensional ...
05/06/2019

Maximum likelihood (ML) estimators for scaled mutation parameters with a strand symmetric mutation model in equilibrium

With the multiallelic parent-independent mutation-drift model, the equil...
11/28/2020

Reciprocal maximum likelihood degrees of diagonal linear concentration models

We show that the reciprocal maximal likelihood degree (rmld) of a diagon...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.