Learning Multiple Belief Propagation Fixed Points for Real Time Inference
Cyril Furtlehner, Jean-Marc Lasgouttes, Anne Auger

TL;DR
This paper introduces a method using multiple belief propagation fixed points to perform real-time inference in complex probabilistic models, effectively encoding diverse data patterns without solving NP-hard problems.
Contribution
It presents a novel approach that associates multiple BP fixed points with mixture components, improving inference efficiency and accuracy in non-convex settings.
Findings
Associates each mixture component with a BP fixed point.
Demonstrates exact connection to Hopfield model in mean field limit.
Enhanced learning via multi-parameter extension and CMAES optimization.
Abstract
In the context of inference with expectation constraints, we propose an approach based on the "loopy belief propagation" algorithm LBP, as a surrogate to an exact Markov Random Field MRF modelling. A prior information composed of correlations among a large set of N variables, is encoded into a graphical model; this encoding is optimized with respect to an approximate decoding procedure LBP, which is used to infer hidden variables from an observed subset. We focus on the situation where the underlying data have many different statistical components, representing a variety of independent patterns. Considering a single parameter family of models we show how LBP may be used to encode and decode efficiently such information, without solving the NP hard inverse problem yielding the optimal MRF. Contrary to usual practice, we work in the non-convex Bethe free energy minimization framework, and…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
