Towards representation agnostic probabilistic programming
Programming Languages
2026-01-01 v1 Artificial Intelligence
Abstract
Current probabilistic programming languages and tools tightly couple model representations with specific inference algorithms, preventing experimentation with novel representations or mixed discrete-continuous models. We introduce a factor abstraction with five fundamental operations that serve as a universal interface for manipulating factors regardless of their underlying representation. This enables representation-agnostic probabilistic programming where users can freely mix different representations (e.g. discrete tables, Gaussians distributions, sample-based approaches) within a single unified framework, allowing practical inference in complex hybrid models that current toolkits cannot adequately express.
Cite
@article{arxiv.2512.23740,
title = {Towards representation agnostic probabilistic programming},
author = {Ole Fenske and Maximilian Popko and Sebastian Bader and Thomas Kirste},
journal= {arXiv preprint arXiv:2512.23740},
year = {2026}
}
Comments
Accepted at LAFI@POPL25