Many statistical models are naturally treated as directed Bayesian networks — for example in causal inference I might naturally think about generating processes for my work as a graphical model.
Factor graphs decompose the model differently than the balls-and-arrows DAGs.
Specifically, the factor graph structures the graph with regard to how we would *implement* method-passing inference, rather than how we would statistically *interpret* the model.
The result is harder to interpret intuitively but easier to apply practically.
Also, it is more general than a DAG; factor graphs can also be applied to undirected graphical models.

There are at least two different factor graph formalisms, and I will try to explain both. The first, “classic” factor graphs, are the ones that I first encountered in the literature, and the ones that I think are most commonly used. The second, “Forney-style” factor graphs, are even less intuitive and even more practical AFAICT.

## Classic factor graphs

A long history of multiple invention, probably. A recognisable modern form appears in (Frey et al. 1997; Frey 2003; Kschischang, Frey, and Loeliger 2001). This classic version is explained lots of places, but for various reasons I needed the FFG version first, so my explanation of that is longer.

The representation that we need to “make all the inference steps easy” ends up being a *bipartite graph* with two types of nodes: variables and factors.
Given a factorization of a function \(g\left(X_1, X_2, \ldots, X_n\right)\),
\[
g\left(X_1, X_2, \ldots, X_n\right)=\prod_{j=1}^m f_j\left(S_j\right)
\]
where \(S_j \subseteq\left\{X_1, X_2, \ldots, X_n\right\}\), the corresponding factor graph \(G=(X, F, E)\) consists of variable vertices \(X=\left\{X_1, X_2, \ldots, X_n\right\}\), factor vertices \(F=\left\{f_1, f_2, \ldots, f_m\right\}\), and edges \(E\).
The edges depend on the factorization as follows: there is an undirected edge between factor vertex \(f_j\) and variable vertex \(X_k\) if \(X_k \in S_j\).

Quibble: We often assume the function to be factored is a probability density function; more generally we wish to factorise *measures*.

Once the factor graph is written out, computations on the graph are essentially the same for every node. By contrast, in a classic I-graph DAG there are several different rules to remember for leaf nodes and branches, for colliders and forks etc.

I may return to classic factor graphs.

For now, a pretty good introduction is included in Ortiz, Evans and Davison’s tutorial on Gaussian belief propagation, or Minka’s Minka (2005).

## Forney-style factor graphs (FFGs)

A tweaked formalism. Citations tell me this was introduce in a recondite article (Forney 2001) which I did not remotely understand because it was way too far into coding theory for me. It is explained and exploited much better for someone of my background in subsequent articles and used in several computational toolkits (Korl 2005; Cox, van de Laar, and de Vries 2019; H.-A. Loeliger et al. 2007; H.-A. Loeliger 2004; van de Laar et al. 2018; Akbayrak, Bocharov, and de Vries 2021).

Relative to classic factor graphs, H.-A. Loeliger (2004) advocates for FFGs for the following advantages

- suited for hierarchical modeling (“boxes within boxes”)
- compatible with standard block diagrams
- simplest formulation of the summary-product message update rule
- natural setting for Forney’s results on Fourier transforms and duality.

Mao and Kschischang (2005) argues:

Forney graphs possess a strikingly elegant duality property: by a local dualization operation, a Forney graph for a linear code may be transformed into another graph, called the dual Forney graph, which represents the dual code.

The explanation in Cox, van de Laar, and de Vries (2019) gives the flavour of how Forney-style graphs work:

A Forney-style factor graph (FFG) offers a graphical representation of a factorized probabilistic model. In an FFG, edges represent variables and nodes specify relations between variables. As a simple example, consider a generative model (joint probability distribution) over variables \(x_{1}, \ldots, x_{5}\) that factors as \[ f\left(x_{1}, \ldots, x_{5}\right)=f_{a}\left(x_{1}\right) f_{b}\left(x_{1}, x_{2}\right) f_{c}\left(x_{2}, x_{3}, x_{4}\right) f_{d}\left(x_{4}, x_{5}\right), \] where \(f_{\bullet}(\cdot)\) denotes a probability density function. This factorized model can be represented graphically as an FFG, as shown in Fig. 1. Note that although an FFG is principally an undirected graph, in the case of generative models we specify a direction for the edges to indicate the “generative direction”. The edge direction simply anchors the direction of messages flowing on the graph (we speak of forward and backward messages that flow with or against the edge direction, respectively). In other words, the edge directionality is purely a notational issue and has no computational consequences.…

The FFG representation of a probabilistic model helps to automate probabilistic inference tasks. As an example, consider we observe \(x_{5}=\hat{x}_{5}\) and are interested in calculating the marginal posterior probability distribution of \(x_{2}\) given this observation.

In the FFG context, observing the realization of a variable leads to the introduction of an extra factor in the model which “clamps” the variable to its observed value. In our example where \(x_{5}\) is observed at value \(\hat{x}_{5}\), we extend the generative model to \(f\left(x_{1}, \ldots, x_{5}\right) \cdot \delta\left(x_{5}-\hat{x}_{5}\right).\) Following the notation introduced in Reller (2013), we denote such “clamping” factors in the FFG by solid black nodes. The FFG of the extended model is illustrated in Fig. 2…

Another place clamping arises is that, since a variable can only appear in two factors, if we want a variable to appear in more than two, we add *extra* factors in, each of which constrains the variables touching it to be equal to one another.
This seems weird; but it kinda-sorta corresponds to be what we would *do* in a classic factor graph anyway, in the sense that we would add an extra message passing step in for each extra factor, so in a sense this weird contrivance could be simply described as writing out our plan in full.

Computing the marginal posterior distribution of \(x_{2}\) under the observation \(x_{5}=\hat{x}_{5}\) involves integrating the extended model over all variables except \(x_{2},\) and renormalizing: \[ f\left(x_{2} \mid x_{5}=\hat{x}_{5}\right) \propto \int \ldots \int f\left(x_{1}, \ldots, x_{5}\right) \cdot \delta\left(x_{5}-\hat{x}_{5}\right) \mathrm{d} x_{1} \mathrm{~d} x_{3} \mathrm{~d} x_{4} \mathrm{~d} x_{5} \] \[ =\overbrace{\int \underbrace{f_{a}\left(x_{1}\right)}_{1} f_{b}\left(x_{1}, x_{2}\right) \mathrm{d} x_{1}}^{2} \overbrace{\iint f_{c}\left(x_{2}, x_{3}, x_{4}\right) \underbrace{\left(\int f_{d}\left(x_{4}, x_{5}\right) \cdot \delta\left(x_{5}-\hat{x}_{5}\right) \mathrm{d} x_{5}\right)}_{3} \mathrm{~d} x_{3} \mathrm{~d} x_{4}}^{(4)} . \] The nested integrals result from substituting the [original] factorization and rearranging the integrals according to the distributive law. Rearranging large integrals of this type as a product of nested sub-integrals can be automated by exploiting the FFG representation of the corresponding model. The sub-integrals indicated by circled numbers correspond to integrals over parts of the model (indicated by dashed boxes in Fig. 2), and their solutions can be interpreted as messages flowing on the FFG. Therefore, this procedure is known as message passing (or summary propagation). The messages are ordered (“scheduled”) in such a way that there are only backward dependencies, i.e., each message can be calculated from preceding messages in the schedule. Crucially, these schedules can be generated automatically, for example by performing a depth-first search on the FFG.

What *local* means in the context of graphical models was not intuitive to me at first.
Local means that: in this high dimensional integral, only some *dimensions* are involved in each sub-step; the graph tells us which integrals can be moved outside the calculation by showing how it factorises.
This is nothing to do with locality over the *domain* of the functions.
This needs a graphical illustration.

## Generic messages

Question: These introductory texts discuss *sum-product* message passing, which is essentially about solving integrals.
It might seem like I want to pass some other kind of update, e.g. maximum likelihood?
Does this factor graph still help us?
Yes, we can calculate max-product messages then.
What else can we calculate locally?
Yes, but I am not sure how wide is the class of things for which this holds true.
We generally want the right algebras to hold true.

## Fourier transforms in

What does it benefit us to take a Fourier transform on a graph? What does that even mean? (Kschischang, Frey, and Loeliger 2001; Forney 2001; Mao and Kschischang 2005)

## In Bayesian brain models

See de Vries and Friston (2017) and van de Laar et al. (2018) for a connection to predictive coding.

## Causal inference in

How does do-calculus work in factor graphs?

## Tooling

### GTSAM & OpenSAM

The goals for these two projects are:

GTSAM: Advance the state-of-the-art research on factor graphs for large-scale optimization and sensor fusion for robotics and computer vision problems. GTSAM is popular among both academia and industry researchers, with algorithms that are more adaptive and easier to expand.OpenSAM: Provide an industry-standard, factor graph sensor fusion reference implementation optimized for embedded systems. OpenSAM is provides a reference for product development in industry and pays careful attention to embedded optimization, security, and certification.GTSAM and OpenSAM are compatible with each other for easy migration. Successful exploration in GTSAM will lead to new features in OpenSAM.

## References

*Journal of Machine Learning Research*7 (December): 1743–88.

*Entropy*23 (7): 815.

*2018 26th European Signal Processing Conference (EUSIPCO)*, 2583–87. Rome: IEEE.

*International Journal of Approximate Reasoning*104 (January): 185–204.

*2007 IEEE International Symposium on Information Theory*, 2546–50. Nice: IEEE.

*Foundations and Trends® in Robotics*6 (1-2): 1–139.

*IEEE Transactions on Information Theory*47 (2): 520–48.

*Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence*, 257–64. UAI’03. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.

*Proceedings of the Annual Allerton Conference on Communication Control and Computing*, 35:666–80. Citeseer.

*Bulletin of the London Mathematical Society*5 (1): 81–84.

*The Journal of Machine Learning Research*, 18:3744–80.

*IEEE Transactions on Information Theory*47 (2): 498–519.

*Conference on Complex Systems*, 3.

*IEEE Signal Processing Magazine*21 (1): 28–41.

*Proceedings of the IEEE*95 (6): 1295–1322.

*IEEE Transactions on Information Theory*51 (5): 1635–49.

*Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence*, 374–81. UAI ’04. Arlington, Virginia, United States: AUAI Press.

*Israel Journal of Mathematics*14 (1): 92–103.

*arXiv:1412.4869 [Stat]*, November.

*Frontiers in Computational Neuroscience*11.

*Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2*, 3356–64. NIPS’14. Cambridge, MA, USA: MIT Press.

## No comments yet. Why not leave one?