Belief propagation in monoidal categories
arXiv:1405.2618 · doi:10.4204/EPTCS.172.18
Abstract
We discuss a categorical version of the celebrated belief propagation algorithm. This provides a way to prove that some algorithms which are known or suspected to be analogous, are actually identical when formulated generically. It also highlights the computational point of view in monoidal categories.
In Proceedings QPL 2014, arXiv:1412.8102