The Maximum Likelihood Degree
| dc.creator | Catanese, Fabrizio | |
| dc.creator | Hosten, Serkan | |
| dc.creator | Khetan, Amit | |
| dc.creator | Sturmfels, Bernd | |
| dc.date | 2004-06-25 | |
| dc.date.accessioned | 2026-07-07T08:06:25Z | |
| dc.date.available | 2026-07-07T08:06:25Z | |
| dc.description | 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. | |
| dc.description | 32 pages, latex | |
| dc.identifier | https://arxiv.org/abs/math/0406533 | |
| dc.identifier | http://arxiv.org/abs/math/0406533 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130597 | |
| dc.subject | Algebraic Geometry | |
| dc.subject | Statistics Theory | |
| dc.title | The Maximum Likelihood Degree | |
| dc.type | text |