pith. sign in

arxiv: math/0406533 · v1 · submitted 2004-06-25 · 🧮 math.AG · math.ST· stat.TH

The Maximum Likelihood Degree

classification 🧮 math.AG math.STstat.TH
keywords degreelikelihoodmaximumpolynomialsproblemalgebraicarrangementbounded
0
0 comments X
read the original abstract

Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers of polynomials. We study the algebraic degree of the critical equations of this optimization problem. This degree is related to the number of bounded regions in the corresponding arrangement of hypersurfaces, and to the Euler characteristic of the complexified complement. Under suitable hypotheses, the maximum likelihood degree equals the top Chern class of a sheaf of logarithmic differential forms. Exact formulae in terms of degrees and Newton polytopes are given for polynomials with generic coefficients.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.