Efficient learning of discrete graphical models*

DOI10.1088/1742-5468/AC3AEAMaRDI QIDQ5032038zbMATH OpenOpenAlexFDO

Authors M. Vuffray, Sidhant Misra, Andrey Y. Lokhov

Publication date 16 February 2022

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1902.00600

zbMATH Keywords

learning theorymachine learningnetwork reconstruction

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Recommendations

• Learning factor graphs in polynomial time and sample complexity
• Learning loopy graphical models with latent variables: efficient methods and guarantees
• Efficiently learning Ising models on arbitrary graphs (extended abstract)
• Learning technique of probabilistic graphical models: a review
• scientific article; zbMATH DE number 6253918

Cites work

• Approximating discrete probability distributions with dependence trees
• Efficiently learning Ising models on arbitrary graphs (extended abstract)
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Reconstruction of Markov random fields from samples: some observations and algorithms
• The ordered subsets mirror descent optimization method with applications to tomography

Cited in

(3)

• Efficient local updates for undirected graphical models
• The one-inclusion graph algorithm is near-optimal for the prediction model of learning
• Efficient Learning of Discrete Graphical Models

This page was built for publication: Efficient learning of discrete graphical models*

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