A probabilistic algorithm for computing data-discriminants of likelihood equations
From MaRDI portal
Abstract: An algebraic approach to the maximum likelihood estimation problem is to solve a very structured parameterized polynomial system called likelihood equations that have finitely many complex (real or non-real) solutions. The only solutions that are statistically meaningful are the real solutions with positive coordinates. In order to classify the parameters (data) according to the number of real/positive solutions, we study how to efficiently compute the discriminants, say data-discriminants (DD), of the likelihood equations. We develop a probabilistic algorithm with three different strategies for computing DDs. Our implemented probabilistic algorithm based on Maple and FGb is more efficient than our previous version presented in ISSAC2015, and is also more efficient than the standard elimination for larger benchmarks. By applying RAGlib to a DD we compute, we give the real root classification of 3 by 3 symmetric matrix model.
Recommendations
Cites work
- scientific article; zbMATH DE number 1157655 (Why is no real title available?)
- scientific article; zbMATH DE number 2151204 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A complete algorithm for automated discovering of a class of inequality-type theorems
- Computing parametric geometric resolutions
- Counting and Locating the Solutions of Polynomial Systems of Maximum Likelihood Equations, II: The Behrens-Fisher Problem
- Critical points and Gröbner bases: the unmixed case
- Data-discriminants of likelihood equations
- FGb: A Library for Computing Gröbner Bases
- Geometry of maximum likelihood estimation in Gaussian graphical models
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Lectures on algebraic statistics
- Likelihood geometry
- Maximum likelihood degree of variance component models
- Maximum likelihood for dual varieties
- Maximum likelihood for matrices with rank constraints
- Maximum likelihood geometry in the presence of data zeros
- Nash triviality in families of Nash manifolds
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- Recent advances on determining the number of real roots of parametric polynomials
- Solving parametric polynomial systems
- Solving the likelihood equations
- Straight-line programs in geometric elimination theory
- Testing sets for properness of polynomial mappings
- The Euclidean distance degree of an algebraic variety
- The Signed Euler Characteristic of Very Affine Varieties
- The maximum likelihood degree
- The maximum likelihood degree of a very affine variety
- Triangular decomposition of semi-algebraic systems
- Variant quantifier elimination
Cited in
(5)
This page was built for publication: A probabilistic algorithm for computing data-discriminants of likelihood equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628325)
