Belief propagation for permutations, rankings, and partial orders

10/01/2021
by   George T. Cantwell, et al.
0

Many datasets give partial information about an ordering or ranking by indicating which team won a game, which item a user prefers, or who infected whom. We define a continuous spin system whose Gibbs distribution is the posterior distribution on permutations, given a probabilistic model of these interactions. Using the cavity method we derive a belief propagation algorithm that computes the marginal distribution of each node's position. In addition, the Bethe free energy lets us approximate the number of linear extensions of a partial order and perform model selection.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2014

Non-characterizability of belief revision: an application of finite model theory

A formal framework is given for the characterizability of a class of bel...
research
02/27/2013

Localized Partial Evaluation of Belief Networks

Most algorithms for propagating evidence through belief networks have be...
research
01/10/2013

Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagation

We present a novel inference algorithm for arbitrary, binary, undirected...
research
02/16/2021

Belief Propagation List Ordered Statistics Decoding of Polar Codes

It is shown how to combine ordered statistics decoding (OSD) with CRC-ai...
research
07/26/2021

Belief Propagation as Diffusion

We introduce novel belief propagation algorithms to estimate the margina...
research
02/27/2013

Laplace's Method Approximations for Probabilistic Inference in Belief Networks with Continuous Variables

Laplace's method, a family of asymptotic methods used to approximate int...
research
03/14/2000

SATEN: An Object-Oriented Web-Based Revision and Extraction Engine

SATEN is an object-oriented web-based extraction and belief revision eng...

Please sign up or login with your details

Forgot password? Click here to reset