Learning planar Ising models

MaRDI QIDQ2953639zbMATH OpenFDO

Authors Jason K. Johnson, Diane Oyen, Michael Chertkov, Praneeth Netrapalli

Publication date 5 January 2017

Full work available at URL https://arxiv.org/abs/1502.00916, http://jmlr.csail.mit.edu/papers/v17/15-579.html

zbMATH Keywords

graphical modelsIsing models

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Estimation in multivariate analysis (62H12) Probabilistic graphical models (62H22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Efficiently learning Ising models on arbitrary graphs (extended abstract)
• Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
• Approximate inference on planar graphs using loop calculus and belief propagation
• Inference in Ising models
• The minimax learning rates of normal and Ising undirected graphical models

Cited in

(6)

• Efficiently learning Ising models on arbitrary graphs (extended abstract)
• High dimensional logistic regression under network dependence
• A generalization of spatial Monte Carlo integration
• The minimax learning rates of normal and Ising undirected graphical models
• Learning a tree-structured Ising model in order to make predictions
• Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising models

This page was built for publication: Learning planar Ising models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953639)