The Maximum Likelihood Degree of Sparse Polynomial Systems

DOI10.1137/21M1422550arXiv2105.07449OpenAlexW4361285528MaRDI QIDQ6043375FDOQ6043375

Authors: Julia Lindberg, Nathan Nicholson, Jose Israel Rodriguez, Zinan Wang 

Publication date: 5 May 2023

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2105.07449

zbMATH Keywords

polynomial optimizationmixed volumemaximum likelihood degree

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Algebraic statistics (62R01) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Solving polynomial systems; resultants (13P15) Computational aspects of higher-dimensional varieties (14Q15)

Cites Work

• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Algorithm 795
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• Estimating linear covariance models with numerical nonlinear algebra
• Polyedres de Newton et nombres de Milnor
• Using Algebraic Geometry
• Title not available (Why is that?)
• Numerically solving polynomial systems with Bertini
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semidefinite Optimization and Convex Algebraic Geometry
• The algebraic degree of semidefinite programming
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Algebraic degree of polynomial optimization
• The maximum likelihood degree of mixtures of independence models
• Solving the likelihood equations
• The maximum likelihood degree of a very affine variety
• The maximum likelihood degree
• Title not available (Why is that?)
• The Euclidean distance degree
• Euclidean distance degree of the multiview variety
• A general formula for the algebraic degree in semidefinite programming
• The maximum likelihood degree of toric varieties
• Solving decomposable sparse systems
• Euclidean distance degree and mixed volume
• Maximum likelihood degree of variance component models
• Criteria for strict monotonicity of the mixed volume of convex polytopes
• Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
• Maximum likelihood estimation for matrix normal models via quiver representations
• Maximum likelihood degree, complete quadrics, and \(\mathbb{C}^*\)-action
• Moment maps, strict linear precision, and maximum likelihood degree one

Cited In (3)

• Implementing real polyhedral homotopy
• High probability analysis of the condition number of sparse polynomial systems
• Critical points of discrete periodic operators

This page was built for publication: The Maximum Likelihood Degree of Sparse Polynomial Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043375)