The maximum likelihood degree of sparse polynomial systems

05/16/2021
by   Julia Lindberg, et al.
0

We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood degree counts the number of critical points of the likelihood function restricted to the model. We prove the maximum likelihood degree of a sparse polynomial system is determined by its Newton polytopes and equals the mixed volume of a related Lagrange system of equations. As a corollary, we find that the algebraic degree of several optimization problems is equal to a similar mixed volume.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/26/2022

Gaussian likelihood geometry of projective varieties

We explore the maximum likelihood degree of a homogeneous polynomial F o...
research
10/13/2017

Compact Formulae in Sparse Elimination

It has by now become a standard approach to use the theory of sparse (or...
research
05/17/2019

Maximum Likelihood Estimation of Toric Fano Varieties

We study the maximum likelihood estimation problem for several classes o...
research
12/12/2015

A Probabilistic Algorithm for Computing Data-Discriminants of Likelihood Equations

An algebraic approach to the maximum likelihood estimation problem is to...
research
06/06/2022

Sparse Bayesian Learning for Complex-Valued Rational Approximations

Surrogate models are used to alleviate the computational burden in engin...
research
10/30/2019

Constrained Polynomial Likelihood

Starting from a distribution z, we develop a non-negative polynomial min...
research
01/03/2023

Fitting mixed logit random regret minimization models using maximum simulated likelihood

This article describes the mixrandregret command, which extends the rand...

Please sign up or login with your details

Forgot password? Click here to reset