Exploiting symmetries for scaling loopy belief propagation and relational training

DOI10.1007/s10994-013-5385-0zbMath1273.68293OpenAlexW1965417459MaRDI QIDQ374162

Martin Mladenov, Sriraam Natarajan, Kristian Kersting, Babak Ahmadi

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)

Related Items

Improving probabilistic inference in graphical models with determinism and cycles, \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs, An exemplar-based clustering using efficient variational message passing, Probabilistic Event Calculus for Event Recognition, Explainable and explorable decision support, Approximate classification with web ontologies through evidential terminological trees and forests, Leveraging cluster backbones for improving MAP inference in statistical relational models, Relational linear programming, A Survey of Directed Entity-Relation--Based First-Order Probabilistic Languages, Unnamed Item, Distributed Parameter Learning for Probabilistic Ontologies, Lifted graphical models: a survey, Lifted Dynamic Junction Tree Algorithm

Uses Software

• MapReduce
• Tuffy

Cites Work

• Greedy function approximation: A gradient boosting machine.
• Stochastic relational processes: efficient inference and applications
• Gradient-based boosting for statistical relational learning: the relational dependency network case
• Learning first-order probabilistic models with combining rules
• Algorithms for highly symmetric linear and integer programs
• Piecewise training for structured prediction
• Probabilistic inductive logic programming. Theory and applications
• Markov logic networks
• Training Products of Experts by Minimizing Contrastive Divergence
• 10.1162/jmlr.2003.3.4-5.679
• Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
• Asymmetric graphs
• Recursive conditioning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item