Bayesian strategies: probabilistic programs as generalised graphical models

DOI10.1007/978-3-030-72019-3_19MaRDI QIDQ2233478zbMATH OpenOpenAlexFDO

Authors Hugo Paquet

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

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

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)

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

Cites work

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

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)