Exploiting symmetries for scaling loopy belief propagation and relational training

DOI10.1007/S10994-013-5385-0zbMATH Open1273.68293OpenAlexW1965417459MaRDI QIDQ374162FDOQ374162

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

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

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)

Cites Work

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

Cited In (17)

• Collective inference for extraction MRFs coupled with symmetric clique potentials
• An extended view on lifting Gaussian Bayesian networks
• Title not available (Why is that?)
• Lifting factor graphs with some unknown factors
• Lifted Dynamic Junction Tree Algorithm
• Improving probabilistic inference in graphical models with determinism and cycles
• Explainable and explorable decision support
• \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
• An exemplar-based clustering using efficient variational message passing
• A Survey of Directed Entity-Relation--Based First-Order Probabilistic Languages
• A Priori Approximation of Symmetries in Dynamic Probabilistic Relational Models
• Probabilistic Event Calculus for Event Recognition
• Distributed Parameter Learning for Probabilistic Ontologies
• Approximate classification with web ontologies through evidential terminological trees and forests
• Relational linear programming
• Lifted graphical models: a survey
• Leveraging cluster backbones for improving MAP inference in statistical relational models

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)