A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1405.2618.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Belief propagation in monoidal categories
<span title="2014-12-28">2014</span>
<i title="Open Publishing Association">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a>
</i>
Preserved Fulltext
Other Versions
<span title="2014-12-30">2014</span>
<span class="release-stage">accepted</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.2618v2">arXiv:1405.2618v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rul7uzdhcva4zfhpb2aase2ez4">fatcat:rul7uzdhcva4zfhpb2aase2ez4</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.2618v2">arXiv:1405.2618v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rul7uzdhcva4zfhpb2aase2ez4">fatcat:rul7uzdhcva4zfhpb2aase2ez4</a> </span>
<span title="2014-05-12">2014</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.2618v1">arXiv:1405.2618v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/33oz3orwxzflddwjqfj7noex5u">fatcat:33oz3orwxzflddwjqfj7noex5u</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1405.2618v1">arXiv:1405.2618v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/33oz3orwxzflddwjqfj7noex5u">fatcat:33oz3orwxzflddwjqfj7noex5u</a> </span>
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.
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.172.18">doi:10.4204/eptcs.172.18</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fa37qdcblbfwpndjwedbzziowi">fatcat:fa37qdcblbfwpndjwedbzziowi</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190827142838/https://arxiv.org/pdf/1405.2618.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/b4/13/b413b8d5259c3996323c4e4ee0524e493fd57ee4.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.172.18">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
Publisher / doi.org
</button>
</a>