most citedProbabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets

3 citations · 3 across the 2 of their papers we have counts for

collaborators
Showing cs.PLShow all

2 papers · 1 filter

cs.PL2026

Compositional Information Geometry of Probabilistic Programs

Jacek Karwowski, Frank Nielsen, Sam Staton

We study the compositional, intensional information geometry of probabilistic programs. For a first-order probabilistic programming language with finite random variables, we constr…

cs.PL2023★ 3 cited

Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets

Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar +5

We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-beh…