Message-Passing Algorithms

Pushing the Boundaries of Probabilistic Inference through Message Contraction Optimization

A key aspect of intelligent systems is their capacity to reason under uncertainty. This task involves calculating probabilities of relevant variables while considering any …

avatar
Martin Roa Villescas

Scaling Probabilistic Inference through Message Contraction Optimization

Within the realm of probabilistic graphical models, message-passing algorithms offer a powerful framework for efficient inference. When dealing with discrete variables, these …

avatar
Martin Roa Villescas
JunctionTrees.jl - Efficient Bayesian Inference in Discrete Graphical Models featured image

JunctionTrees.jl - Efficient Bayesian Inference in Discrete Graphical Models

JunctionTrees.jl implements the junction tree algorithm, an efficient method to perform Bayesian inference in discrete probabilistic graphical models. It exploits Julia's …

avatar
Martin Roa Villescas