Exploiting symmetries for scaling loopy belief propagation and relational training

DOI10.1007/S10994-013-5385-0MaRDI QIDQ374162zbMATH OpenOpenAlexFDO

Authors Babak Ahmadi, Kristian Kersting, Martin Mladenov, Sriraam Natarajan

Publication date 22 October 2013

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-013-5385-0

zbMATH Keywords

statistical relational learninglifted inferencelifted online trainingmapreduce

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20)

Recommendations

• A Priori Approximation of Symmetries in Dynamic Probabilistic Relational Models
• Lifted generative learning of Markov logic networks
• Generalized counting for lifted variable elimination
• Hinge-loss Markov random fields and probabilistic soft logic
• Lifted graphical models: a survey

Cites work

• scientific article; zbMATH DE number 5296741 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 706329 (Why is no real title available?)
• scientific article; zbMATH DE number 1753155 (Why is no real title available?)
• scientific article; zbMATH DE number 1875392 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 3231758 (Why is no real title available?)
• scientific article; zbMATH DE number 3071015 (Why is no real title available?)
• 10.1162/jmlr.2003.3.4-5.679
• Algorithms for highly symmetric linear and integer programs
• Asymmetric graphs
• Gradient-based boosting for statistical relational learning: the relational dependency network case
• Greedy function approximation: A gradient boosting machine.
• Introduction to algorithms
• Learning first-order probabilistic models with combining rules
• Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
• Loopy belief propagation: convergence and effects of message errors
• Markov logic networks
• Piecewise training for structured prediction
• Probabilistic inductive logic programming. Theory and applications
• Recursive conditioning
• Stochastic relational processes: efficient inference and applications
• Training Products of Experts by Minimizing Contrastive Divergence

Cited in

(17)

• Approximate classification with web ontologies through evidential terminological trees and forests
• Distributed Parameter Learning for Probabilistic Ontologies
• A survey of directed entity-relation-based first-order probabilistic languages
• A Priori Approximation of Symmetries in Dynamic Probabilistic Relational Models
• Leveraging cluster backbones for improving MAP inference in statistical relational models
• Probabilistic event calculus for event recognition
• Collective inference for extraction MRFs coupled with symmetric clique potentials
• scientific article; zbMATH DE number 7561610 (Why is no real title available?)
• An exemplar-based clustering using efficient variational message passing
• Explainable and explorable decision support
• Improving probabilistic inference in graphical models with determinism and cycles
• \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
• An extended view on lifting Gaussian Bayesian networks
• Lifted graphical models: a survey
• Relational linear programming
• Lifted Dynamic Junction Tree Algorithm
• Lifting factor graphs with some unknown factors

Describes a project that uses

Uses Software

• MapReduce
• Tuffy

This page was built for publication: Exploiting symmetries for scaling loopy belief propagation and relational training

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