Belief propagation in monoidal categories

Jason Morton

doi:10.4204/EPTCS.172.18

Belief propagation in monoidal categories

Jason Morton

Mathematics

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

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.

Original language	English (US)
Pages (from-to)	262-269
Number of pages	8
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	172
DOIs	https://doi.org/10.4204/EPTCS.172.18
State	Published - Dec 28 2014
Event	11th Workshop on Quantum Physics and Logic, QPL 2014 - Kyoto, Japan Duration: Jun 4 2014 → Jun 6 2014

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.4204/EPTCS.172.18

Cite this

@article{53d7c6c2c6464aae91973f746e6c48eb,

title = "Belief propagation in monoidal categories",

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.",

author = "Jason Morton",

note = "Publisher Copyright: {\textcopyright} J. Morton.; 11th Workshop on Quantum Physics and Logic, QPL 2014 ; Conference date: 04-06-2014 Through 06-06-2014",

year = "2014",

month = dec,

day = "28",

doi = "10.4204/EPTCS.172.18",

language = "English (US)",

volume = "172",

pages = "262--269",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

T1 - Belief propagation in monoidal categories

AU - Morton, Jason

N1 - Publisher Copyright: © J. Morton.

PY - 2014/12/28

Y1 - 2014/12/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84938681429&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938681429&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.172.18

DO - 10.4204/EPTCS.172.18

M3 - Conference article

AN - SCOPUS:84938681429

SN - 2075-2180

VL - 172

SP - 262

EP - 269

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 11th Workshop on Quantum Physics and Logic, QPL 2014

Y2 - 4 June 2014 through 6 June 2014

ER -

Belief propagation in monoidal categories

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this