Greedy Learning of Markov Network Structure

Greedy Learning of Markov Network Structure

8 February 2012

Praneeth Netrapalli

Siddhartha Banerjee

Sujay Sanghavi

Sanjay Shakkottai

ArXiv (abs)PDF HTML

Papers citing "Greedy Learning of Markov Network Structure"

8 / 8 papers shown

Title
Maximum Likelihood Bounded Tree-Width Markov Networks Nathan Srebro TPM 114 128 0 10 Jan 2013
$High-dimensional Ising model selection using ${\ell_1}$-regularized logistic regression$ High-dimensional Ising model selection using ${\ell_1}$ -regularized logistic regression Pradeep Ravikumar Martin J. Wainwright John D. Lafferty 274 957 0 02 Oct 2010
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates Vincent Y. F. Tan Anima Anandkumar A. Willsky 119 49 0 05 May 2010
Which graphical models are difficult to learn? Andrea Montanari J. A. Pereira 93 90 0 30 Oct 2009
Information-theoretic limits of selecting binary graphical models in high dimensions N. Santhanam Martin J. Wainwright 143 204 0 16 May 2009
Operator norm consistent estimation of large-dimensional sparse covariance matrices N. Karoui 207 397 0 21 Jan 2009
$High-dimensional covariance estimation by minimizing $\ell_1$-penalized log-determinant divergence$ High-dimensional covariance estimation by minimizing $\ell_1$ -penalized log-determinant divergence Pradeep Ravikumar Martin J. Wainwright Garvesh Raskutti Bin Yu 247 872 0 21 Nov 2008
$High-Dimensional Graphical Model Selection Using $\ell_1$-Regularized Logistic Regression$ High-Dimensional Graphical Model Selection Using $\ell_1$ -Regularized Logistic Regression Pradeep Ravikumar Martin J. Wainwright John D. Lafferty 305 177 0 26 Apr 2008