Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
117 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Maximum likelihood thresholds of Gaussian graphical models and graphical lasso (2312.03145v1)

Published 5 Dec 2023 in math.ST, stat.ML, and stat.TH

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. Maximum likelihood thresholds via graph rigidity. arXiv preprint arXiv:2108.02185, 2021.
  2. Computing maximum likelihood thresholds using graph rigidity. arXiv preprint arXiv:2210.11081, 2022.
  3. Maximum likelihood threshold and generic completion rank of graphs. Discrete & Computational Geometry, 61(2):303–324, 2019.
  4. Søren L. Buhl. On the existence of maximum likelihood estimators for graphical Gaussian models. Scandinavian Journal of Statistics, pages 263–270, 1993.
  5. Statistical inference. Cengage Learning, 2021.
  6. Quantifier elimination and cylindrical algebraic decomposition. Springer Science & Business Media, 2012.
  7. Arthur P Dempster. Covariance selection. Biometrics, pages 157–175, 1972.
  8. Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3):432–441, 2008.
  9. The maximum likelihood threshold of a graph. Bernoulli, 24(1), 2018.
  10. 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.
  11. Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12:2825–2830, 2011.
  12. 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.
  13. Caroline Uhler. Geometry of maximum likelihood estimation in Gaussian graphical models. University of California, Berkeley, 2011.
  14. Hao Wang. Bayesian graphical lasso models and efficient posterior computation. Bayesian Analysis, 7(4), 2012.

Summary

We haven't generated a summary for this paper yet.