Detecting Nonproperness of Likelihood Equations
Preprint
- 12 August 2026
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
Given an algebraic statistical model, a challenging problem is classifying the data according to the number of positive critical points of the likelihood function. The positive critical points are the positive solutions to an algebraic system, say likelihood equations. So, identifying the number of positive critical points is a real root classification problem for the likelihood equations. A discriminant variety of a likelihood-equation system geometrically describes the data for which the number of real solutions becomes unusual. As an essential component of the discriminant variety, the nonproperness set collects the data such that the likelihood-equation system has a solution at infinity. So, the number of real solutions varies when the data passes the nonproperness set, and identifying the nonproperness set plays a crucial role in the real root classification. In this work, we develop a novel method for computing nonproperness sets of likelihood-equation systems. We prove the correctness of this method. We show experimentally that it is far more efficient than the known methods in the literature.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- The maximum likelihood degree of toric varietiesJournal of Symbolic Computation, 2019
- A probabilistic algorithm for computing data-discriminants of likelihood equationsJournal of Symbolic Computation, 2017
- Ideals, Varieties, and Algorithms2015
- Lectures on Algebraic Statistics2009
- Solving parametric polynomial systemsJournal of Symbolic Computation, 2007
- Solving the Likelihood EquationsFoundations of Computational Mathematics, 2005
- On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier eliminationJournal of Symbolic Computation, 1992
- On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier eliminationJournal of Symbolic Computation, 1992
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Partial Cylindrical Algebraic Decomposition for quantifier eliminationJournal of Symbolic Computation, 1991