A probabilistic algorithm for computing data-discriminants of likelihood equations

DOI10.1016/j.jsc.2016.11.017zbMath1373.62090arXiv1512.03901OpenAlexW2963451886MaRDI QIDQ2628325

Jose Israel Rodriguez, Xiaoxian Tang

Publication date: 1 June 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.03901

zbMATH Keywords

maximum likelihood estimationdiscriminantlikelihood equation

Mathematics Subject Classification ID

Point estimation (62F10) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Uses Software

• FGb
• Kronecker
• QEPCAD
• RAGlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variant quantifier elimination
• Geometry of maximum likelihood estimation in Gaussian graphical models
• Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
• A complete algorithm for automated discovering of a class of inequality-type theorems
• Lectures on algebraic statistics
• Nash triviality in families of Nash manifolds
• Testing sets for properness of polynomial mappings
• Straight-line programs in geometric elimination theory
• Computing parametric geometric resolutions
• Recent advances on determining the number of real roots of parametric polynomials
• Maximum likelihood degree of variance component models
• Solving parametric polynomial systems
• Solving the likelihood equations
• Maximum likelihood for dual varieties
• Data-Discriminants of Likelihood Equations
• Maximum Likelihood for Matrices with Rank Constraints
• The maximum likelihood degree of a very affine variety
• Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
• Maximum likelihood geometry in the presence of data zeros
• The Signed Euler Characteristic of Very Affine Varieties
• Likelihood Geometry
• Critical points and Gröbner bases
• Counting and Locating the Solutions of Polynomial Systems of Maximum Likelihood Equations, II: The Behrens-Fisher Problem
• The maximum likelihood degree
• FGb: A Library for Computing Gröbner Bases
• Triangular decomposition of semi-algebraic systems
• A Gröbner free alternative for polynomial system solving
• The Euclidean distance degree of an algebraic variety

This page was built for publication: A probabilistic algorithm for computing data-discriminants of likelihood equations