On some algorithms for estimation in Gaussian graphical models

S Højsgaard and S Lauritzen

Biometrika, 2024, vol. 111, issue 4, 1201-1219

Abstract: In Gaussian graphical models, the likelihood equations must typically be solved iteratively. This paper investigates two algorithms: a version of iterative proportional scaling, which avoids inversion of large matrices, and an algorithm based on convex duality and operating on the covariance matrix by neighbourhood coordinate descent, which corresponds to the graphical lasso with zero penalty. For large, sparse graphs, the iterative proportional scaling algorithm appears feasible and has simple convergence properties. The algorithm based on neighbourhood coordinate descent is extremely fast and less dependent on sparsity, but needs a positive-definite starting value to converge. We provide an algorithm for finding such a starting value for graphs with low colouring number. As a consequence, we also obtain a simplified proof of existence of the maximum likelihood estimator in such cases.

Keywords: Convex duality; Covariance selection; Graph degeneracy; Maximum likelihood estimation (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1093/biomet/asae028 (application/pdf)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:oup:biomet:v:111:y:2024:i:4:p:1201-1219.

Ordering information: This journal article can be ordered from
https://academic.oup.com/journals

Access Statistics for this article

Biometrika is currently edited by Paul Fearnhead

More articles in Biometrika from Biometrika Trust Oxford University Press, Great Clarendon Street, Oxford OX2 6DP, UK.
Bibliographic data for series maintained by Oxford University Press ().