Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Staton, Sam"'
Autor:
Liell-Cock, Jack, Staton, Sam
Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our desiderata are that
Externí odkaz:
http://arxiv.org/abs/2405.09391
Notions of computation can be modelled by monads. Algebraic effects offer a characterization of monads in terms of algebraic operations and equational axioms, where operations are basic programming features, such as reading or updating the state, and
Externí odkaz:
http://arxiv.org/abs/2402.03103
Autor:
Stein, Dario, Staton, Sam
We spell out the paradigm of exact conditioning as an intuitive and powerful way of conditioning on observations in probabilistic programs. This is contrasted with likelihood-based scoring known from languages such as Stan. We study exact conditionin
Externí odkaz:
http://arxiv.org/abs/2312.17141
Autor:
Ackerman, Nathanael L., Freer, Cameron E., Kaddar, Younesse, Karwowski, Jacek, Moss, Sean K., Roy, Daniel M., Staton, Sam, Yang, Hongseok
Publikováno v:
Proc. ACM Program. Lang. 8, POPL, Article 61 (2024), pp 1819-1849
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-behaved equational theory for our graph probabilistic programming languag
Externí odkaz:
http://arxiv.org/abs/2312.17127
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their connections to semir
Externí odkaz:
http://arxiv.org/abs/2312.16694
Autor:
Staton, Sam, Vasilakopoulou, Christina
Publikováno v:
EPTCS 397, 2023
The Sixth International Conference on Applied Category Theory took place at the University of Maryland, 31 July -- 4 August 2023. This conference follows the previous meetings at Leiden (2018), Oxford (2019), MIT (2020, fully online), Cambridge (2021
Externí odkaz:
http://arxiv.org/abs/2312.08138
Autor:
Kaddar, Younesse, Staton, Sam
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 3 - Proceedings of MFPS XXXIX (November 23, 2023) entics:12291
Stochastic memoization is a higher-order construct of probabilistic programming languages that is key in Bayesian nonparametrics, a modular approach that allows us to extend models beyond their parametric limitations and compose them in an elegant an
Externí odkaz:
http://arxiv.org/abs/2309.09467
Autor:
Stein, Dario1 dario.stein@ru.nl, Staton, Sam2 sam.staton@cs.ox.ac.uk
Publikováno v:
Journal of the ACM. Feb2024, Vol. 71 Issue 1, p1-53. 53p.
We introduce a new setting, the category of $\omega$PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is general enough to assign meanings to most practical probabilistic a
Externí odkaz:
http://arxiv.org/abs/2302.10636
We show that streams and lazy data structures are a natural idiom for programming with infinite-dimensional Bayesian methods such as Poisson processes, Gaussian processes, jump processes, Dirichlet processes, and Beta processes. The crucial semantic
Externí odkaz:
http://arxiv.org/abs/2212.07250