π€ AI Summary
This work addresses the abrupt changes in the number of real critical points of likelihood equations in algebraic statistical models, which are governed by the modelβs non-properness locusβa set characterizing data configurations for which the system admits solutions at infinity. The paper introduces, for the first time, an efficient method to compute this non-properness locus by integrating tools from algebraic geometry, real root classification, and discriminant variety theory. The authors rigorously establish the correctness of their approach and develop a corresponding detection algorithm. Experimental results demonstrate that the proposed method significantly outperforms existing techniques in computational efficiency, offering a practical and scalable solution for data classification tasks based on the number of real solutions.
π 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.