Zobrazeno 1 - 10
of 88
pro vyhledávání: '"Ackerman, Nathanael"'
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
We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to the set of programs such that whenever the program converges it return
Externí odkaz:
http://arxiv.org/abs/2311.12705
Autor:
Ackerman, Nathanael, Mirabi, Mostafa
We study sunflowers within the context of finitely generated substructures of ultrahomogeneous structures. In particular, we look at bounds on how large a set system is needed to guarantee the existence of sunflowers of a given size. We show that if
Externí odkaz:
http://arxiv.org/abs/2310.15527
Suppose $\mathscr{L}^-\subseteq \mathscr{L}$ are languages where $\mathscr{L} \setminus\mathscr{L}^-$ is relational. Additionally, let $\mathbf{K}$ be a strong $\textrm{Fra\"iss\'e}$ class in $\mathscr{L}$. We consider the partial ordering, under sub
Externí odkaz:
http://arxiv.org/abs/2310.11582
We introduce definitions of computable PAC learning for binary classification over computable metric spaces. We provide sufficient conditions for learners that are empirical risk minimizers (ERM) to be computable, and bound the strong Weihrauch degre
Externí odkaz:
http://arxiv.org/abs/2111.14630
Publikováno v:
Journal of Logic and Computation 31, no. 1 (2021), pp. 2-19
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure, both algebra
Externí odkaz:
http://arxiv.org/abs/2101.11849
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
Publikováno v:
Proceedings of the 14th and 15th Asian Logic Conferences, World Scientific (2019), pp. 3-34
Given a countable relational language $L$, we consider probability measures on the space of $L$-structures with underlying set $\mathbb{N}$ that are invariant under the logic action. We study the growth rate of the entropy function of such a measure,
Externí odkaz:
http://arxiv.org/abs/1809.02290
The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of chains. We extend this result to the framework of multiuniversal classes
Externí odkaz:
http://arxiv.org/abs/1804.09067
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