Compositional Semantics for Probabilistic Programs with Exact Conditioning

• URL: http://arxiv.org/abs/2101.11351v1
• Date: Wed, 27 Jan 2021 12:31:18 GMT
• Title: Compositional Semantics for Probabilistic Programs with Exact Conditioning
• Authors: Dario Stein, Sam Staton
• Abstract summary: We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We show that the good properties of our language are not particular to Gaussians, but can be derived from universal properties.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational and equational semantics for this language, establishing convenient properties like exchangeability of conditions. Conditioning on equality of continuous random variables is nontrivial, as the exact observation may have probability zero; this is Borel's paradox. Using categorical formulations of conditional probability, we show that the good properties of our language are not particular to Gaussians, but can be derived from universal properties, thus generalizing to wider settings. We define the Cond construction, which internalizes conditioning as a morphism, providing general compositional semantics for probabilistic programming with exact conditioning.

Related papers

• Decoherence and Probability [0.0]
  Non-probabilistic accounts of the emergence of probability via decoherence are unconvincing. An alternative account of the emergence of probability involves the combination of textitquasi-probabilistic emergence, via a partially interpreted decoherence model.
  arXiv  Detail & Related papers  (2024-10-02T08:16:09Z)
• Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
  We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution. Our method consistently outperforms existing approaches in terms of conditional coverage.
  arXiv  Detail & Related papers  (2024-07-01T20:44:48Z)
• $\omega$PAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs [64.25762042361839]
  $omega$PAP spaces are spaces for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is general enough to assign meanings to most practical probabilistic and differentiable programs. We establish the almost-everywhere differentiability of probabilistic programs' trace density functions.
  arXiv  Detail & Related papers  (2023-02-21T12:50:05Z)
• Distributional Gradient Boosting Machines [77.34726150561087]
  Our framework is based on XGBoost and LightGBM. We show that our framework achieves state-of-the-art forecast accuracy.
  arXiv  Detail & Related papers  (2022-04-02T06:32:19Z)
• Why we should interpret density matrices as moment matrices: the case of (in)distinguishable particles and the emergence of classical reality [69.62715388742298]
  We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs) We will show that QT for both distinguishable and indistinguishable particles can be formulated in this way. We will show that finitely exchangeable probabilities for a classical dice are as weird as QT.
  arXiv  Detail & Related papers  (2022-03-08T14:47:39Z)
• Degenerate Gaussian factors for probabilistic inference [0.0]
  We propose a parametrised factor that enables inference on Gaussian networks where linear dependencies exist among the random variables. By using this principled factor definition, degeneracies can be accommodated accurately and automatically at little additional computational cost.
  arXiv  Detail & Related papers  (2021-04-30T13:58:29Z)
• Transitional Conditional Independence [0.0]
  We introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and previous notions of (conditional) random variables and non-stochastic variables.
  arXiv  Detail & Related papers  (2021-04-23T11:52:15Z)
• Probabilistic Programs with Stochastic Conditioning [38.63814604977958]
  We propose a generalization of deterministic conditioning to conditioning, that is, conditioning on the marginal distribution of a variable taking a particular form. Although we present conditioning in the context of probabilistic programming, our formalization is general and applicable to other settings.
  arXiv  Detail & Related papers  (2020-10-01T10:17:52Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)
• Learning Probabilistic Sentence Representations from Paraphrases [47.528336088976744]
  We define probabilistic models that produce distributions for sentences. We train our models on paraphrases and demonstrate that they naturally capture sentence specificity. Our model captures sentential entailment and provides ways to analyze the specificity and preciseness of individual words.
  arXiv  Detail & Related papers  (2020-05-16T21:10:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.