Learning sparse Gaussian Markov networks using a greedy coordinate ascent approach

Authors:
Katya Scheinberg;Irina Rish
Affiliations:
IEOR Department, Columbia University, New York, NY;IBM T.J. Watson Research Center, Yorktown Heights, NY
Venue:
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Year:
2010

Citing 4
Cited 3

Learning to Decode Cognitive States from Brain Images

Machine Learning
Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data

The Journal of Machine Learning Research
Sparse Gaussian graphical models with unknown block structure

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Smooth Optimization Approach for Sparse Covariance Selection

SIAM Journal on Optimization

Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm

SIAM Journal on Optimization
Learning a common substructure of multiple graphical Gaussian models

Neural Networks
Group sparse inverse covariance selection with a dual augmented lagrangian method

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Gaussian Markov Network, and empirically investigate the structure-recovery properties of the algorithm. Our approach is based on a coordinate ascent method which naturally preserves the sparsity of the network structure. We show that SINCO is often comparable to, and, in various cases, outperforms commonly used approaches such as glasso [7] and COVSEL [1], in terms of both structure-reconstruction error (particularly, false positive error) and computational time. Moreover, our method has the advantage of being easily parallelizable. Finally, we show that SINCO's greedy nature allows reproduction of the regularization path behavior by applying the method to one (sufficiently small) instance of the regularization parameter λ only; thus, SINCO can obtain a desired number of network links directly, without having to tune the λ parameter. We evaluate our method empirically on various simulated networks and real-life data from biological and neuroimaging applications.