Pith. sign in

REVIEW

Matroid Stratification of ML Degrees of Independence Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.10010 v2 pith:WMV736WN submitted 2023-12-15 math.ST math.AGmath.COstat.TH

Matroid Stratification of ML Degrees of Independence Models

classification math.ST math.AGmath.COstat.TH
keywords modelsdegreeindependencedefineddegreesdeterminanthypersimplexmatroid
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study the maximum likelihood (ML) degree of discrete exponential independence models and models defined by the second hypersimplex. For models with two independent variables, we show that the ML degree is an invariant of a matroid associated to the model. We use this description to explore ML degrees via hyperplane arrangements. For independence models with more variables, we investigate the connection between the vanishing of factors of its principal $A$-determinant and its ML degree. Similarly, for models defined by the second hypersimplex, we determine its principal $A$-determinant and give computational evidence towards a conjectured lower bound of its ML degree.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.