Bounding the maximum likelihood degree

From MaRDI portal
Publication:530615

DOI10.4310/MRL.2015.V22.N6.A4zbMATH Open1348.14066arXiv1411.3486OpenAlexW2962903895MaRDI QIDQ530615FDOQ530615


Authors: Nero Budur, Botong Wang Edit this on Wikidata


Publication date: 10 August 2016

Published in: Mathematical Research Letters (Search for Journal in Brave)

Abstract: Maximum likelihood estimation is a fundamental computational problem in statistics. In this note, we give a bound for the maximum likelihood degree of algebraic statistical models for discrete data. As usual, such models are identified with special very affine varieties. Using earlier work of Franecki and Kapranov, we prove that the maximum likelihood degree is always less or equal to the signed intersection-cohomology Euler characteristic. We construct counterexamples to a bound in terms of the usual Euler characteristic conjectured by Huh and Sturmfels.


Full work available at URL: https://arxiv.org/abs/1411.3486




Recommendations





Cited In (16)





This page was built for publication: Bounding the maximum likelihood degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q530615)