Introduces independent subproblem inference and proves asymptotic convergence guarantees for hybrid MCMC algorithms defined via inference metaprogramming.
Proceedings of the ACM on Programming Languages (PACMPL) 2, ICFP (30 7 2018), 83:1–83:29
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Compositional Inference Metaprogramming with Convergence Guarantees
Introduces independent subproblem inference and proves asymptotic convergence guarantees for hybrid MCMC algorithms defined via inference metaprogramming.