mlsanityData to 14 Oct 2026

Information Geometry of Message Passing

arXiv 2608.15922 ↗First posted 16 Aug 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 60 references that are in the map. First posted on arXiv 16 Aug 2026.

Builds on

19 of 60 references.

References · 19

  1. 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
  2. 2016Variational Inference: A Review for Statisticianscited by 1,472
  3. 2022Are Transformers Effective for Time Series Forecasting?cited by 1,424
  4. 2015Probabilistic Backpropagation for Scalable Learning of Bayesian Neural Networkscited by 295
  5. 2013Expectation Propagation for approximate Bayesian inferencecited by 174
  6. 2016Automatic Differentiation Variational Inferencecited by 159
  7. 2021The Bayesian Learning Rulecited by 99
  8. 2017Conjugate-Computation Variational Inference : Converting Variational Inference in Non-Conjugate Models to Inferences in Conjugate Modelscited by 65
  9. 2024Variational Learning is Effective for Large Deep Networkscited by 65
  10. 2018Fast yet Simple Natural-Gradient Descent for Variational Inference in Complex Modelscited by 38
  11. 2020Information Newton's flow: second-order optimization method in probability spacecited by 24
  12. 2018Variational Message Passing with Structured Inference Networkscited by 17
7 more
  1. 2021Reactive Message Passing for Scalable Bayesian Inferencecited by 16
  2. 2025Expected Free Energy-based Planning as Variational Inferencecited by 10
  3. 2016Fast Approximate Inference for Arbitrarily Large Semiparametric Regression Models via Message Passingcited by 4
  4. 2025Bayesian Predictive Codingcited by 2
  5. 2025Information Geometry of Variational Bayescited by 2
  6. 2026What Type of Inference is Active Inference?cited by 2
  7. 2026Composing Non-Conjugate Factor Graphs with Closed-Form Variational Inferencecited by 1

Built on by

Not cited yet.