Efficient Learning of Discrete Graphical Models

Approximating discrete probability distributions with dependence trees

C. Chow and C. Liu · 1968

Earlier work this paper cites.

The ordered subsets mirror descent optimization method with applications to tomography

A. Ben-Tal, T. Margalit, and A. Nemirovski · 2001

Earlier work this paper cites.

Mirror descent and nonlinear projected subgradient methods for convex optimization

Amir Beck and Marc Teboulle · 2003

Earlier work this paper cites.

A bayesian networks approach for predicting protein-protein interactions from genomic data

Ronald Jansen, Haiyuan Yu, Dov Greenbaum, Yuval Kluger, Nevan J. Krogan, Sambath Chung, Andrew Emili, Michael Snyder, Jack F. Greenblatt, and Mark Gerstein · 2003

Earlier work this paper cites.

Which graphical models are difficult to learn?

Andrea Montanari and Jose A. Pereira · 2009

Earlier work this paper cites.

High-dimensional Ising model selection using ℓ \ell 1-regularized logistic regression

Pradeep Ravikumar, Martin J. Wainwright, and John D. Lafferty · 2010

Earlier work this paper cites.

Information-theoretic limits of selecting binary graphical models in high dimensions

N. P. Santhanam and M. J. Wainwright · 2012

Earlier work this paper cites.

Reconstruction of Markov random fields from samples: Some observations and algorithms

Guy Bresler, Elchanan Mossel, and Allan Sly · 2013

Cited alongside, same era.

Markov random field modeling, inference & learning in computer vision & image understanding: A survey

Chaohui Wang, Nikos Komodakis, and Nikos Paragios · 2013

Cited alongside, same era.

Efficiently learning Ising models on arbitrary graphs

Guy Bresler · 2015

Cited alongside, same era.

Information–theoretic implications of quantum causal structures

Rafael Chaves, Christian Majenz, and David Gross · 2015

Cited alongside, same era.

A survey of data mining and machine learning methods for cyber security intrusion detection

Anna L Buczak and Erhan Guven · 2016

Cited alongside, same era.

From complex questionnaire and interviewing data to intelligent bayesian network models for medical decision support

Information theoretic properties of markov random fields, and their algorithmic applications

Linus Hamilton, Frederic Koehler, and Ankur Moitra · 2017

Later among the works it cites.

Learning graphical models using multiplicative weights

A. Klivans and R. Meka · 2017

Later among the works it cites.

Optimal structure and parameter learning of Ising models

Andrey Y Lokhov, Marc Vuffray, Sidhant Misra, and Michael Chertkov · 2018

Later among the works it cites.

Sparse logistic regression learns all discrete pairwise graphical models

Shanshan Wu, Sujay Sanghavi, and Alexandros G Dimakis · 2019

Closest in time.

Learning of discrete graphical models with neural networks

Abhijith Jayakumar, Andrey Lokhov, Sidhant Misra, and Marc Vuffray · 2020

Closest in time.

Information theoretic optimal learning of gaussian graphical models

Sidhant Misra, Marc Vuffray, and Andrey Y Lokhov · 2020