8 papers
Imprecise Probabilistic Programming, Precisely: Credal Sets via Graded Monads, BDDs, and Semiring-Parametric Inference (Functional Pearl)
Jack Liell-Cock, Sam Staton
Imprecise probability generalizes standard probability theory by replacing a single distribution with a convex set of possible distributions. We show that this generalization requi…
Clock systems for stochastic and non-deterministic categorical systems theories
Owen Lynch, David Jaz Myers, Eigil Fjeldgren Rischel +1
One of the characteristic features of categorical systems theory is that the behavior of systems can be characterized by certain morphisms into them. In other words, behaviors form…
Likelihood Hacking in Probabilistic Program Synthesis
Jacek Karwowski, Younesse Kaddar, Zihuiwen Ye +3
When language models are trained by reinforcement learning (RL) to write probabilistic programs, they can artificially inflate their marginal-likelihood reward by producing program…
An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic Theories
Ohad Kammar, Jack Liell-Cock, Sam Lindley +2
We use the theory of algebraic effects to give a complete equational axiomatization for dynamic threads. Our method is based on parameterized algebraic theories, which give a concr…
A causal Markov category with Kolmogorov products
Sean Moss, Sam Staton
In Fritz & Rischel, Infinite products and zero-one laws in categorical probability, the problem was posed of finding an interesting Markov category which is causal and has all (sma…
The Relative Monadic Metalanguage
Jack Liell-Cock, Zev Shirazi, Sam Staton
Relative monads provide a controlled view of computation. We generalise the monadic metalanguage to a relative setting and give a complete semantics with strong relative monads. Ad…