▲ | srean 4 days ago | |||||||
At the core both derive their optimization from the distributive property. If the expression graph has symmetry, you get more optimization out of it. https://www.cs.ubc.ca/~murphyk/Teaching/Papers/GDL.pdf Check out the first paragraph
Two extremely influential papers appeared back to back in transactions information theory. This is one of them.The other is https://vision.unipv.it/IA2/Factor graphs and the sum-product algorithm.pdf Both are absolute gems of papers. The editor made sure that both appear in the same volume. | ||||||||
▲ | rigtorp 4 days ago | parent | next [-] | |||||||
Interesting, of course many computations can be expressed as a graph. In the case of the bipartite graph we perform belief propagation on to decode LDPC where is the optimization from the distributive property? The parity matrix would typically be constructed so that there's few subexpression to factor out, to maximize the error correcting properties. I agree both FFT and belief propagation can be expressed as message passing algorithms. | ||||||||
| ||||||||
▲ | kqbx 4 days ago | parent | prev | next [-] | |||||||
The second link is broken on HN because it contains a space. Here's a clickable version: https://vision.unipv.it/IA2/Factor%20graphs%20and%20the%20su... | ||||||||
▲ | adamnemecek 4 days ago | parent | prev [-] | |||||||
There’s a whole subfield called generalized distributive law https://en.wikipedia.org/wiki/Generalized_distributive_law |