论文信息 - Discussion: Latent variable graphical model selection via convex optimization - 字舞流文

Discussion: Latent variable graphical model selection via convex optimization

Discussion of "Latent variable graphical model selection via convex optimization" by Venkat Chandrasekaran, Pablo A. Parrilo and Alan S. Willsky [arXiv:1008.1290].

Martin J. Wainwright

[1] N. Meinshausen,et al. High-dimensional graphs and variable selection with the Lasso , 2006, math/0608017.

[2] T. Speed,et al. Gaussian Markov Distributions over Finite Graphs , 1986 .

[3] Peng Zhao,et al. On Model Selection Consistency of Lasso , 2006, J. Mach. Learn. Res..

[4] Martin J. Wainwright,et al. Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions , 2009, IEEE Transactions on Information Theory.

[5] N. Meinshausen. A note on the Lasso for Gaussian graphical model selection , 2008 .

[6] Pablo A. Parrilo,et al. Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..

[7] Adam J. Rothman,et al. Sparse permutation invariant covariance estimation , 2008, 0801.4837.

[8] Martin J. Wainwright,et al. Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting , 2007, IEEE Transactions on Information Theory.

[9] Bin Yu,et al. High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence , 2008, 0811.3628.

[10] Harrison H. Zhou,et al. MINIMAX ESTIMATION OF LARGE COVARIANCE MATRICES UNDER ℓ1-NORM , 2012 .

[11] Martin J. Wainwright,et al. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions , 2011, ICML.