Sign inGet started
Paper · arXiv

Algebraic Signatures for Structural Learning in Probability Tensors

Algebraic statistics characterizes statistical models through polynomial constraints, but it has mainly been used for analytically specified model classes. This paper studies the inverse problem: identifying probabilistic structure from vanishing binomials observed in empirical probability tensors. We treat the vanishing binomials of a toric model as its algebraic signature, and turn the ideal-variety correspondence of algebraic statistics into an operational procedure for structural learning that identifies a model by signature matching without parameter estimation. By restricting attention to a computationally tractable class of configuration matrices, which we call {\it the Kronecker-s...

AuthorsAkihiro Maeda, Shohei Hidaka, Satoshi Aoki
Primary categorystat.ML
Published21 July 2026
Last updated at source21 July 2026
stat.MLcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/9b929a4e-7ec7-42ff-aba8-0c4dcf473aff" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.