Structural Pursuit Over Multiple Undirected Graphs
Authors:
- 2 October 2014
- journal article
- research article
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 109 (508) , 1683-1696
Abstract
Gaussian graphical models are useful to analyze and visualize conditional dependence relationships between interacting units. Motivated from network analysis under different experimental conditions, such as gene networks for disparate cancer subtypes, we model structural changes over multiple networks with possible heterogeneities. In particular, we estimate multiple precision matrices describing dependencies among interacting units through maximum penalized likelihood. Of particular interest are homogeneous groups of similar entries across and zero-entries of these matrices, referred to as clustering and sparseness structures, respectively. A nonconvex method is proposed to seek a sparse representation for each matrix and identify clusters of the entries across the matrices. Computationally, we develop an efficient method on the basis of difference convex programming, the augmented Lagrangian method and the blockwise coordinate descent method, which is scalable to hundreds of graphs of thousands nodes through a simple necessary and sufficient partition rule, which divides nodes into smaller disjoint subproblems excluding zero-coefficients nodes for arbitrary graphs with convex relaxation. Theoretically, a finite-sample error bound is derived for the proposed method to reconstruct the clustering and sparseness structures. This leads to consistent reconstruction of these two structures simultaneously, permitting the number of unknown parameters to be exponential in the sample size, and yielding the optimal performance of the oracle estimator as if the true structures were given a priori. Simulation studies suggest that the method enjoys the benefit of pursuing these two disparate kinds of structures, and compares favorably against its convex counterpart in the accuracy of structure pursuit and parameter estimation.Keywords
This publication has 22 references indexed in Scilit:
- Likelihood-Based Selection and Sharp Parameter EstimationJournal of the American Statistical Association, 2012
- Joint estimation of multiple graphical modelsBiometrika, 2011
- New Insights and Faster Computations for the Graphical LassoJournal of Computational and Graphical Statistics, 2011
- Inferring dynamic gene networks under varying conditions for transcriptomic network comparisonBioinformatics, 2010
- Integrated Genomic Analysis Identifies Clinically Relevant Subtypes of Glioblastoma Characterized by Abnormalities in PDGFRA, IDH1, EGFR, and NF1Cancer Cell, 2010
- Sparse permutation invariant covariance estimationElectronic Journal of Statistics, 2008
- Sparse inverse covariance estimation with the graphical lassoBiostatistics, 2007
- Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networksBiostatistics, 2005
- Sparsity and Smoothness Via the Fused LassoJournal of the Royal Statistical Society Series B: Statistical Methodology, 2004
- Probability Inequalities for Likelihood Ratios and Convergence Rates of Sieve MLESThe Annals of Statistics, 1995