Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Zaiser, Fabian"'
We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in this setting: even if exact Bayesian inference is possible, the state of
Externí odkaz:
http://arxiv.org/abs/2411.10393
Publikováno v:
Advances in Neural Information Processing Systems 36 (NeurIPS 2023)
We present an exact Bayesian inference method for discrete statistical models, which can find exact solutions to a large class of discrete inference problems, even with infinite support and continuous priors. To express such models, we introduce a pr
Externí odkaz:
http://arxiv.org/abs/2305.17058
A challenging problem in probabilistic programming is to develop inference algorithms that work for arbitrary programs in a universal probabilistic programming language (PPL). We present the nonparametric involutive Markov chain Monte Carlo (NP-iMCMC
Externí odkaz:
http://arxiv.org/abs/2211.01100
We propose a new method to approximate the posterior distribution of probabilistic programs by means of computing guaranteed bounds. The starting point of our work is an interval-based trace semantics for a recursive, higher-order probabilistic progr
Externí odkaz:
http://arxiv.org/abs/2204.02948
Probabilistic programming uses programs to express generative models whose posterior probability is then computed by built-in inference engines. A challenging goal is to develop general purpose inference algorithms that work out-of-the-box for arbitr
Externí odkaz:
http://arxiv.org/abs/2106.10238
Autor:
Zaiser, Fabian, Ong, C. -H. Luke
Publikováno v:
EPTCS 320, 2020, pp. 167-196
The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional predicate for
Externí odkaz:
http://arxiv.org/abs/2005.06659
The 2-Opt heuristic is one of the simplest algorithms for finding good solutions to the metric Traveling Salesman Problem. It is the key ingredient to the well-known Lin-Kernighan algorithm and often used in practice. So far, only upper and lower bou
Externí odkaz:
http://arxiv.org/abs/1909.12025
Publikováno v:
In Operations Research Letters July 2020 48(4):401-404
