Skip to content
Journal article

High-dimensional covariance estimation based on Gaussian graphical models

Zhou S, Rutimann P, Xu M, Buhlmann P ...see all

The Journal of Machine Learning Research, vol. 999888 (2010) p. 50 Published by JMLR. org

  • 1


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.
  • N/A


    ScienceDirect users who have downloaded this article.
Sign in to save reference


Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using $\ell_1$-penalization methods. We propose and study the following method. We combine a multiple regression approach with ideas of thresholding and refitting: first we infer a sparse undirected graphical model structure via thresholding of each among many $\ell_1$-norm penalized regression functions; we then estimate the covariance matrix and its inverse using the maximum likelihood estimator. We show that under suitable conditions, this approach yields consistent estimation in terms of graphical structure and fast convergence rates with respect to the operator and Frobenius norm for the covariance matrix and its inverse. We also derive an explicit bound for the Kullback Leibler divergence.

Author-supplied keywords

  • covariance estimation
  • graphical model selection
  • lasso
  • nodewise regression

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Shuheng Zhou

  • Philipp Rutimann

  • Min Xu

  • Peter Buhlmann

Cite this document

Choose a citation style from the tabs below