Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950061 | Electronic Notes in Theoretical Computer Science | 2016 | 16 Pages |
Abstract
This paper establishes a link between Bayesian inference (learning) and predicate and state transformer operations from programming semantics and logic. Specifically, a very general definition of backward inference is given via first applying a predicate transformer and then conditioning. Analogously, forward inference involves first conditioning and then applying a state transformer. These definitions are illustrated in many examples in discrete and continuous probability theory and also in quantum theory.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bart Jacobs, Fabio Zanasi,