mlsanityData to 14 Oct 2026

Detecting Nonproperness of Likelihood Equations

arXiv 2608.01976 ↗First posted 3 Aug 2026stat.ML cs.LG cs.SCcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 17 references that are in the map. First posted on arXiv 3 Aug 2026.

Builds on

0 of 17 references.

No references here yet.

Built on by

Not cited yet.