Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Measure Transformer Semantics for Bayesian Machine Learning
Microsoft Research, Cambridge.
Microsoft Research, Cambridge.
University of Pennsylvania.
Microsoft Research, Cambridge.
Show others and affiliations
2011 (English)In: 20th European Symposium on Programming: Held as Part of the Joint European Conferences on Theory and Practice of Software / [ed] G. Barthe, Berlin, Heidelberg: Springer-Verlag , 2011, 77-96 p.Conference paper, Published paper (Refereed)
Abstract [en]

The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (that is, a prior distribution) and a set of observations of variables. There is a trend in machine learning towards expressing Bayesian models as probabilistic programs. As a foundation for this kind of programming, we propose a core functional calculus with primitives for sampling prior distributions and observing variables. We define combinators for measure transformers, based on theorems in measure theory, and use these to give a rigorous semantics to our core calculus. The original features of our semantics include its support for discrete, continuous, and hybrid measures, and, in particular, for observations of zero-probability events. We compile our core language to a small imperative language that has a straightforward semantics via factor graphs, data structures that enable many efficient inference algorithms. We use an existing inference engine for efficient approximate inference of posterior marginal distributions, treating thousands of observations per second for large instances of realistic models.

Place, publisher, year, edition, pages
Berlin, Heidelberg: Springer-Verlag , 2011. 77-96 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6602
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-161498DOI: 10.1007/978-3-642-19718-5_5OAI: oai:DiVA.org:uu-161498DiVA: diva2:456362
Conference
ESOP 2011, 20th European Symposium on Programming, Saarbrücken, Germany
Available from: 2011-12-06 Created: 2011-11-14 Last updated: 2011-12-06Bibliographically approved

Open Access in DiVA

fulltext(281 kB)224 downloads
File information
File name FULLTEXT02.pdfFile size 281 kBChecksum SHA-512
703b64a3945f21427e7d3dfff1695e29015dc4ce66485308bfaf44f9cc7005efd93ba0b083178f104a581820e3ff4f7fbebcce3119cc2434c21b5c54e5c4863b
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Borgström, Johannes
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 224 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 498 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf