Higher Order Bayesian Networks, Exactly - POPL 2024
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 16-minute conference talk from POPL 2024 introducing a higher-order programming language for Bayesian networks. Discover how this lambda-calculus-based language proves sound and complete with respect to Bayesian networks, allowing for the encoding of networks as terms and the compilation of programs into networks. Learn about the language's ability to specify recursive probability models and hierarchical structures, as well as its compositional and cost-aware semantics based on factors. Delve into the advanced techniques from linear logic, intersection types, rewriting theory, and Girard's geometry of interaction that underpin this novel approach to probabilistic programming and Bayesian inference.
Syllabus
[POPL'24] Higher Order Bayesian Networks, Exactly
Taught by
ACM SIGPLAN
Related Courses
The Mathematical Underpinnings of Promises in C++CppNow via YouTube The Intellectual Ascent to Agda
CppNow via YouTube Developing Smart Contracts
GOTO Conferences via YouTube Scaling Decision-Theoretic Probabilistic Programming Through Factorization
ACM SIGPLAN via YouTube A Denotational Approach to Release/Acquire Concurrency - GALOP'24
ACM SIGPLAN via YouTube