Bayesian strategies: probabilistic programs as generalised graphical models

DOI10.1007/978-3-030-72019-3_19zbMATH Open1473.68054OpenAlexW3137954959MaRDI QIDQ2233478FDOQ2233478

Authors: Hugo Paquet 

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72019-3_19

Recommendations

• The geometry of Bayesian programming
• An application of computable distributions to the semantics of probabilistic programming languages
• Probabilistic game semantics
• Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
• Measure transformer semantics for Bayesian machine learning

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Theory of programming languages (68N15) Applications of game theory (91A80) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Cites Work

• Probabilistic graphical models.
• Title not available (Why is that?)
• Petri nets, event structures and domains. I
• The geometry of tensor calculus. I
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
• Distributed probabilistic and quantum strategies
• Event structures with symmetry
• Title not available (Why is that?)
• Asynchronous Games: Innocence Without Alternation
• Premonoidal categories and notions of computation
• Linear logic
• Introduction to bicategories
• Partial Orders, Event Structures and Linear Strategies
• Title not available (Why is that?)
• Probabilistic \(\pi\)-calculus and event structures
• A game semantics for linear logic
• Bayesian network semantics for Petri nets
• Game theoretic analysis of call-by-value computation
• Markov nets: probabilistic models for distributed and concurrent systems
• CONCUR 2004 - Concurrency Theory
• Nondeterminism in game semantics via sheaves
• Causality vs. interleavings in concurrent game semantics
• Continuous probability distributions in concurrent games
• A lambda-calculus foundation for universal probabilistic programming
• Commutative semantics for probabilistic programming
• Thin games with symmetry and concurrent Hyland-Ong games
• The Parallel Intensionally Fully Abstract Games Model of PCF
• The concurrent game semantics of probabilistic PCF
• Concurrent quantum strategies
• Games and strategies as event structures
• Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
• True-concurrency probabilistic models: Markov nets and a law of large numbers
• Concurrency and probability: removing confusion, compositionally
• A provably correct sampler for probabilistic programs

Cited In (6)

• Bayesian ranking for strategy scheduling in automated theorem provers
• A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces
• Zeta functions and the (linear) logic of Markov processes
• Computational Science – ICCS 2005
• The beta-Bernoulli process and algebraic effects
• The geometry of Bayesian programming

This page was built for publication: Bayesian strategies: probabilistic programs as generalised graphical models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233478)