Tuning parameter selection for penalized likelihood estimation of inverse covariance matrix

09/04/2009
by   Xin Gao, et al.
0

In a Gaussian graphical model, the conditional independence between two variables are characterized by the corresponding zero entries in the inverse covariance matrix. Maximum likelihood method using the smoothly clipped absolute deviation (SCAD) penalty (Fan and Li, 2001) and the adaptive LASSO penalty (Zou, 2006) have been proposed in literature. In this article, we establish the result that using Bayesian information criterion (BIC) to select the tuning parameter in penalized likelihood estimation with both types of penalties can lead to consistent graphical model selection. We compare the empirical performance of BIC with cross validation method and demonstrate the advantageous performance of BIC criterion for tuning parameter selection through simulation studies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2010

Split Bregman Method for Sparse Inverse Covariance Estimation with Matrix Iteration Acceleration

We consider the problem of estimating the inverse covariance matrix by m...
research
02/08/2013

Efficiency for Regularization Parameter Selection in Penalized Likelihood Estimation of Misspecified Models

It has been shown that AIC-type criteria are asymptotically efficient se...
research
04/25/2016

Learning Local Dependence In Ordered Data

In many applications, data come with a natural ordering. This ordering c...
research
05/30/2022

Automatic Search Interval for Smoothing Parameter in Penalized Splines

The selection of smoothing parameter is central to estimation of penaliz...
research
05/22/2019

Distributionally Robust Formulation and Model Selection for the Graphical Lasso

Building on a recent framework for distributionally robust optimization ...
research
06/05/2023

StabJGL: a stability approach to sparsity and similarity selection in multiple network reconstruction

In recent years, network models have gained prominence for their ability...
research
04/03/2012

Convergence Properties of Kronecker Graphical Lasso Algorithms

This paper studies iteration convergence of Kronecker graphical lasso (K...

Please sign up or login with your details

Forgot password? Click here to reset