cs.LGAug 16, 2026

Information Geometry of Message Passing

Authors: Mykola Lukashchuk, Kyrylo Yemets, Alex Ledbetter, İsmail Şenöz

Organizations: Eindhoven University of Technology · Lviv Polytechnic National University · Lazy Dynamics, Utrecht, the Netherlands

Abstract

We show that the natural-gradient stationary condition of variational inference has an edge-local form on a Forney-style factor graph. We start from the Bethe free energy and constrain a selected edge marginal to an exponential family. At a stationary point, the natural parameter of that edge equals the sum of two projected messages, one from each incident factor. Each projected message is the natural-gradient projection of the exact belief-propagation log-message at the current receiving marginal, or equivalently, the gradient of its expectation in the so-called mean coordinates. We call the resulting scheme natural-gradient message passing (NGMP). The rule is local; each edge may carry its own exponential family, and the message a factor sends depends on the marginal that receives it. Compared with variational message passing, NGMP keeps the part of the exact message that the receiving family can represent instead of averaging the factor under the neighboring beliefs. The two coincide when the uncertainty on the edges entering a non-conjugate factor vanishes, and NGMP is more accurate when that uncertainty persists, for example, along a partially observed latent chain or when parameters are filtered through successive data batches. Experiments on Poisson smoothing, heteroskedastic regression, and hourly ETTh forecasting confirm this and show that the gain appears mainly in uncertainty calibration.

Figures & tables

Appendix figures & tables13 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Composing Non-Conjugate Factor Graphs with Closed-Form Variational Inference

    May 28, 2026Mykola Lukashchuk, Kyrylo Yemets, Wouter M. Kouw +4Factor Graph OptimizationMixture-of-Experts Inference

  2. Efficient Message Passing for Partial Differential Equation Priors

    Sep 26, 2026Anna Kazachkova, Leonhard Hennicke, Rainer Schlosser +1PDE SolvingPhysics-Informed ML

  3. Direct Message Approximation (DMA): A Consistency-Based Framework for Tractable Approximate Inference on Factor Graphs

    Sep 24, 2026Ralf Herbrich, Rainer Schlosser, Jan Lemcke +11Efficient InferenceUncertainty Quantification