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
Abstract. Consider the polynomial optimization problem whose objective and constraints are all descr...
We show that algebraic varieties with maximum likelihood degree one are exactly the images of reduce...
35 pagesWe establish connections between: the maximum likelihood degree (ML-degree) for linear conce...
© 2015, International Press of Boston, Inc. All rights reserved. Maximum likelihood estimation is a ...
Lascoux polynomials have been recently introduced to prove polynomiality of the maximum-likelihood d...
We study the critical points of the likelihood function over the Fermat hypersurface. This problem i...
Numerical algebraic geometry provides numerical descriptions of solution sets of polynomial systems...
Maximum likelihood estimation is a fundamental optimization problem in statistics. We study this pro...
Maximum likelihood estimation is a fundamental optimization problem in statistics. We study this pro...
We study multivariate Gaussian models that are described by linear conditions on the concentration m...
Abstract—Pattern maximum likelihood (PML) is a technique for estimating the probability multiset of ...
40 pages, 6 figuresInternational audienceFor general data, the number of complex solutions to the li...
We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed to...
We study the critical points of monomial functions over an algebraic subset of the probability simpl...
Agostini D, Brysiewicz T, Fevola C, et al. Likelihood degenerations. Advances in Mathematics. 2023;4...
Abstract. Consider the polynomial optimization problem whose objective and constraints are all descr...
We show that algebraic varieties with maximum likelihood degree one are exactly the images of reduce...
35 pagesWe establish connections between: the maximum likelihood degree (ML-degree) for linear conce...
© 2015, International Press of Boston, Inc. All rights reserved. Maximum likelihood estimation is a ...
Lascoux polynomials have been recently introduced to prove polynomiality of the maximum-likelihood d...
We study the critical points of the likelihood function over the Fermat hypersurface. This problem i...
Numerical algebraic geometry provides numerical descriptions of solution sets of polynomial systems...
Maximum likelihood estimation is a fundamental optimization problem in statistics. We study this pro...
Maximum likelihood estimation is a fundamental optimization problem in statistics. We study this pro...
We study multivariate Gaussian models that are described by linear conditions on the concentration m...
Abstract—Pattern maximum likelihood (PML) is a technique for estimating the probability multiset of ...
40 pages, 6 figuresInternational audienceFor general data, the number of complex solutions to the li...
We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed to...
We study the critical points of monomial functions over an algebraic subset of the probability simpl...
Agostini D, Brysiewicz T, Fevola C, et al. Likelihood degenerations. Advances in Mathematics. 2023;4...
Abstract. Consider the polynomial optimization problem whose objective and constraints are all descr...
We show that algebraic varieties with maximum likelihood degree one are exactly the images of reduce...
35 pagesWe establish connections between: the maximum likelihood degree (ML-degree) for linear conce...