This page belongs to Andi Loeliger's home page.


Model-Based Signal Processing with Factor Graphs

Factor graphs allow a unified approach to a wide variety of structured models and related algorithms. Much of my research, and of my PhD students' at ETH, was about further developing the factor graph approach to signal processing.

The original factor graphs were bipartite with variable nodes and factor nodes: However, Forney's work (including "Codes on graphs: normal realizations", 2002, and "Codes on graphs: duality and MacWilliams identities", 2011) made it clear (to me) that variables should be represented by edges rather than nodes, which is the convention I have been using ever since. In fact, I have long been considering the earlier (bipartite) version of factor graphs as a deplorable blunder.

The primary early references on the factor graph approach to signal processing are Much has been happening since; for example: The list above is very far from complete, but may give an idea of the topics. See also the PhD theses of Lukas Bolliger (2012), Christoph Reller (2012), Lukas Bruderer (2015), Nour Zalmai (2017), Carina Stritt (2017), Federico Wadehn (2019), Boxiao Ma (2021), Raphael Keusch (2022), and Elizabeth Ren (2023).

In recent years, there has been an emphasis on reducing nontrivial model-based inference to iterated linear-Gaussian estimation, e.g.: See also the Lecture Notes of my course Model-Based Estimation and Signal Analysis (held at ETH until 2025).

However, many recent ideas and results have not yet been properly written up. I am planning to write a longer tutorial text on factor graphs for signal processing that will cover also these recent ideas.


Last modified: March 28, 2026