Maximum likelihood thresholds of Gaussian graphical models and graphical lasso
Abstract: Associated to each graph G is a Gaussian graphical model. Such models are often used in high-dimensional settings, i.e. where there are relatively few data points compared to the number of variables. The maximum likelihood threshold of a graph is the minimum number of data points required to fit the corresponding graphical model using maximum likelihood estimation. Graphical lasso is a method for selecting and fitting a graphical model. In this project, we ask: when graphical lasso is used to select and fit a graphical model on n data points, how likely is it that n is greater than or equal to the maximum likelihood threshold of the corresponding graph? Our results are a series of computational experiments.
- Maximum likelihood thresholds via graph rigidity. arXiv preprint arXiv:2108.02185, 2021.
- Computing maximum likelihood thresholds using graph rigidity. arXiv preprint arXiv:2210.11081, 2022.
- Maximum likelihood threshold and generic completion rank of graphs. Discrete & Computational Geometry, 61(2):303–324, 2019.
- Søren L. Buhl. On the existence of maximum likelihood estimators for graphical Gaussian models. Scandinavian Journal of Statistics, pages 263–270, 1993.
- Statistical inference. Cengage Learning, 2021.
- Quantifier elimination and cylindrical algebraic decomposition. Springer Science & Business Media, 2012.
- Arthur P Dempster. Covariance selection. Biometrics, pages 157–175, 1972.
- Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3):432–441, 2008.
- The maximum likelihood threshold of a graph. Bernoulli, 24(1), 2018.
- On the inconsistency of ℓ1superscriptℓ1\ell^{1}roman_ℓ start_POSTSUPERSCRIPT 1 end_POSTSUPERSCRIPT-penalised sparse precision matrix estimation. BMC bioinformatics, 17(16):99–107, 2016.
- Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12:2825–2830, 2011.
- High-dimensional covariance estimation by minimizing ℓ1superscriptℓ1\ell^{1}roman_ℓ start_POSTSUPERSCRIPT 1 end_POSTSUPERSCRIPT-penalized log-determinant divergence. Electronic Journal of Statistics, 5:935–980, 2011.
- Caroline Uhler. Geometry of maximum likelihood estimation in Gaussian graphical models. University of California, Berkeley, 2011.
- Hao Wang. Bayesian graphical lasso models and efficient posterior computation. Bayesian Analysis, 7(4), 2012.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.