Local Message Passing on Frustrated Systems

06/02/2023
by   Luca Schmid, et al.
0

Message passing on factor graphs is a powerful framework for probabilistic inference, which finds important applications in various scientific domains. The most wide-spread message passing scheme is the sum-product algorithm (SPA) which gives exact results on trees but often fails on graphs with many small cycles. We search for an alternative message passing algorithm that works particularly well on such cyclic graphs. Therefore, we challenge the extrinsic principle of the SPA, which loses its objective on graphs with cycles. We further replace the local SPA message update rule at the factor nodes of the underlying graph with a generic mapping, which is optimized in a data-driven fashion. These modifications lead to a considerable improvement in performance while preserving the simplicity of the SPA. We evaluate our method for two classes of cyclic graphs: the 2x2 fully connected Ising grid and factor graphs for symbol detection on linear communication channels with inter-symbol interference. To enable the method for large graphs as they occur in practical applications, we develop a novel loss function that is inspired by the Bethe approximation from statistical physics and allows for training in an unsupervised fashion.

READ FULL TEXT
research
10/05/2016

Lifted Message Passing for the Generalized Belief Propagation

We introduce the lifted Generalized Belief Propagation (GBP) message pas...
research
03/07/2022

Neural Enhancement of Factor Graph-based Symbol Detection

We study the application of the factor graph framework for symbol detect...
research
03/21/2019

On Approximate Nonlinear Gaussian Message Passing On Factor Graphs

Factor graphs have recently gained increasing attention as a unified fra...
research
01/31/2020

Data-Driven Factor Graphs for Deep Symbol Detection

Many important schemes in signal processing and communications, ranging ...
research
11/21/2022

Structural Optimization of Factor Graphs for Symbol Detection via Continuous Clustering and Machine Learning

We propose a novel method to optimize the structure of factor graphs for...
research
06/23/2020

Optimised allgatherv, reduce_scatter and allreduce communication in message-passing systems

Collective communications, namely the patterns allgatherv, reduce_scatte...
research
03/30/2022

Low-complexity Near-optimum Symbol Detection Based on Neural Enhancement of Factor Graphs

We consider the application of the factor graph framework for symbol det...

Please sign up or login with your details

Forgot password? Click here to reset