We show that algebraic varieties with maximum likelihood degree one are exactly the images of reduced A-discriminantal varieties under monomial maps with finite fibers. The maximum likelihood estimator corresponding to such a variety is Kapranov’s Horn uniformization. This extends Kapranov’s characterization of A-discriminantal hypersurfaces to varieties of arbitrary codimension
Suppose that f: C(n), 0 --> C(p), 0 is finitely A-determined with n greater-than-or-equal-to p. We d...
AbstractIn this paper we prove, using a refinement of Terracini's Lemma, a sharp lower bound for the...
In a recent paper, Hauenstein, Sturmfels, and the second author discovered a conjectural bijection b...
© 2015, International Press of Boston, Inc. All rights reserved. Maximum likelihood estimation is a ...
We study the critical points of monomial functions over an algebraic subset of the probability simpl...
Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers o...
Numerical algebraic geometry provides numerical descriptions of solution sets of polynomial systems...
We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed to...
We study the maximum likelihood estimation problem for several classes of toric Fano models. We star...
Agostini D, Brysiewicz T, Fevola C, et al. Likelihood degenerations. Advances in Mathematics. 2023;4...
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...
In this short note, we introduce our recent results on the explicit description of the degrees of A-...
Computing all critical points of a monomial on a very affine variety is a fundamental task in algebr...
We study the critical points of the likelihood function over the Fermat hypersurface. This problem i...
Suppose that f: C(n), 0 --> C(p), 0 is finitely A-determined with n greater-than-or-equal-to p. We d...
AbstractIn this paper we prove, using a refinement of Terracini's Lemma, a sharp lower bound for the...
In a recent paper, Hauenstein, Sturmfels, and the second author discovered a conjectural bijection b...
© 2015, International Press of Boston, Inc. All rights reserved. Maximum likelihood estimation is a ...
We study the critical points of monomial functions over an algebraic subset of the probability simpl...
Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers o...
Numerical algebraic geometry provides numerical descriptions of solution sets of polynomial systems...
We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed to...
We study the maximum likelihood estimation problem for several classes of toric Fano models. We star...
Agostini D, Brysiewicz T, Fevola C, et al. Likelihood degenerations. Advances in Mathematics. 2023;4...
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...
In this short note, we introduce our recent results on the explicit description of the degrees of A-...
Computing all critical points of a monomial on a very affine variety is a fundamental task in algebr...
We study the critical points of the likelihood function over the Fermat hypersurface. This problem i...
Suppose that f: C(n), 0 --> C(p), 0 is finitely A-determined with n greater-than-or-equal-to p. We d...
AbstractIn this paper we prove, using a refinement of Terracini's Lemma, a sharp lower bound for the...
In a recent paper, Hauenstein, Sturmfels, and the second author discovered a conjectural bijection b...