Message-Passing Algorithms and Homology
Olivier Peltre

TL;DR
This thesis introduces a novel algebraic and topological framework for probabilistic graphical models, generalizing belief propagation through homological structures and diffusion equations, leading to new insights on stationary states and bifurcations.
Contribution
It develops a homological perspective on message-passing algorithms, extending the understanding of stationary states and bifurcations beyond traditional graph structures.
Findings
Homological structures relate energy and potentials in graphical models.
Stationary states correspond to homology classes with non-linear constraints.
Bifurcations linked to spectral singularities of diffusion operators.
Abstract
This PhD thesis lays out algebraic and topological structures relevant for the study of probabilistic graphical models. Marginal estimation algorithms are introduced as diffusion equations of the form . They generalise the traditional belief propagation (BP) algorithm, and provide an alternative for contrastive divergence (CD) or Markov chain Monte Carlo (MCMC) algorithms, typically involved in estimating a free energy functional and its gradient w.r.t. model parameters. We propose a new homological picture where parameters are a collections of local interaction potentials , for running over the factor nodes of a given region graph. The boundary operator mapping heat fluxes to a subspace is the discrete analog of a divergence. The total energy $H = \sum_\alpha…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · DNA and Biological Computing · Cellular Automata and Applications
