Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Ackerman, Nathanael L."'
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
Publikováno v:
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, PMLR 89:1640-1649, 2019
The objective of goodness-of-fit testing is to assess whether a dataset of observations is likely to have been drawn from a candidate probability distribution. This paper presents a rank-based family of goodness-of-fit tests that is specialized to di
Externí odkaz:
http://arxiv.org/abs/1902.10142
Autor:
Staton, Sam, Stein, Dario, Yang, Hongseok, Ackerman, Nathanael L., Freer, Cameron E., Roy, Daniel M.
Publikováno v:
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), 141:1-141:15, 2018
In this paper we use the framework of algebraic effects from programming language theory to analyze the Beta-Bernoulli process, a standard building block in Bayesian models. Our analysis reveals the importance of abstract data types, and two types of
Externí odkaz:
http://arxiv.org/abs/1802.09598
We investigate the relative computability of exchangeable binary relational data when presented in terms of the distribution of an invariant measure on graphs, or as a graphon in either $L^1$ or the cut distance. We establish basic computable equival
Externí odkaz:
http://arxiv.org/abs/1801.10387
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 2 (April 30, 2019) lmcs:3834
We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show that the feed
Externí odkaz:
http://arxiv.org/abs/1708.01139
Publikováno v:
Mathematical Structures in Computer Science, 27:8 (2017), pp. 1287-1314
We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration, is strongly Weihrauch equivalent to the limit operator Lim. When a mea
Externí odkaz:
http://arxiv.org/abs/1509.02992
Publikováno v:
Journal of the ACM. Jun2019, Vol. 66 Issue 3, p1-40. 40p.
Publikováno v:
Journal of the ACM, 66:3 (2019), pp. 23:1-23:40
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a universal compu
Externí odkaz:
http://arxiv.org/abs/1005.3014
Autor:
Ackerman, Nathanael L.1 nate@math.harvard.edu, Brian, Will2 wbrian.math@gmail.com
Publikováno v:
Mathematical Logic Quarterly. May2019, Vol. 65 Issue 1, p46-56. 11p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.