Reactive graphs enable efficient MCMC inference in probabilistic programming languages by automatically tracking and selectively recomputing data dependencies during sampling.
C3: Lightweight Incrementalized MCMC for Probabilistic Programs Using Continuations and Callsite Caching
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Reactive Graphs for Efficient Markov Chain Monte Carlo Inference in Probabilistic Programming Languages
Reactive graphs enable efficient MCMC inference in probabilistic programming languages by automatically tracking and selectively recomputing data dependencies during sampling.