title: Structural pursuit over multiple undirected graphs.
abstract: Gaussian graphical models are useful to analyze and visualize conditional dependence relationships between interacting units. Motivated from network analysis under di erent 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 non-convex method is proposed to seek a sparse representation for each matrix and identify clusters of the entries across the matrices. Computationally, we develop an e cient method on the basis of di erence convex programming, the augmented Lagrangian method and the block-wise 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-coe cients 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 givena 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.
authors: School of Statistics, University of Minnesota, Minneapolis, MN 55455.
authors: Yunzhang
authors: Y
authors: Zhu
authors: School of Statistics, University of Minnesota, Minneapolis, MN 55455.
authors: Xiaotong
authors: X
authors: Shen
authors: Division of Biostatistics, University of Minnesota, Minneapolis, MN 55455.
authors: Wei
authors: W
authors: Pan
keywords: Simultaneous pursuit of sparseness and clustering; multiple networks; non-convex; prediction; signaling network inference
references: Biostatistics. 2006 Apr;7(2):302-17
references: 16326758
references: J Am Stat Assoc. 2012 Jan 1;107(497):223-232
references: 22736876
references: Science. 2005 Apr 22;308(5721):523-9
references: 15845847
references: Ann Appl Stat. 2009 Jun 1;3(2):521-541
references: 21643444
references: J Am Stat Assoc. 2013 Jan 1;108(502):713-725
references: 24098061
references: Biostatistics. 2008 Jul;9(3):432-41
references: 18079126
references: J Mach Learn Res. 2012 Mar 1;13:781-794
references: 25392704
references: Biometrika. 2011 Mar;98(1):1-15
references: 23049124
references: Cancer Cell. 2010 Jan 19;17(1):98-110
references: 20129251
references: J Am Stat Assoc. 2012 Jan 1;107(497):152-167
references: 24574574
references: Bioinformatics. 2010 Apr 15;26(8):1064-72
references: 20197286