2016
DOI: 10.48550/arxiv.1608.05263
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Design and Implementation of Probabilistic Programming Language Anglican

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(17 citation statements)
references
References 0 publications
0
17
0
Order By: Relevance
“…In probabilistic programming, the state space model can be used to model program execution and particle filters are used as one of the general probabilistic programming inference methods. Examples of probabilistic programming languages that use particle filters and SMC for inference include Anglican [6], Biips [7], Birch [8], Figaro [9], LibBi [10], Venture [11], WebPPL [12] and Turing [13].…”
Section: Particle Filtersmentioning
confidence: 99%
“…In probabilistic programming, the state space model can be used to model program execution and particle filters are used as one of the general probabilistic programming inference methods. Examples of probabilistic programming languages that use particle filters and SMC for inference include Anglican [6], Biips [7], Birch [8], Figaro [9], LibBi [10], Venture [11], WebPPL [12] and Turing [13].…”
Section: Particle Filtersmentioning
confidence: 99%
“…This means we can skip re-execution of this part of the program by calling the continuation at α. The implementation in Anglican makes use of this optimization (Tolpin et al, 2016). A second optimization is callsite caching (Ritchie et al, 2016a), which memoizes return values of functions in a manner that accounts for both the argument values and the environment that a function closes over, allowing re-execution in the proposal to be skipped when the arguments and environment are identical.…”
Section: Metropolis-hastingsmentioning
confidence: 99%
“…are interpretable for non-experts [1]. Further, many state-of-the-art inference methods can be cast in a composable Bayesian way [2] [3] [4].…”
Section: Motivationmentioning
confidence: 99%
“…Once the event arrived the remote system will increase the delay clock for δ in its local time again. With this clock mechanism, we define the resulting joint distribution in factorized way by focusing on the observation and the effect of a delay on it: P (sprinkler|humidity, δ) = P (sprinkler|humidity * ) P (humidity * |humidity, δ) delayed observation (1) We denote the modified observation with humidity * , which can be seen as the traditional conditional distribution.…”
Section: Proposal: Delay-dependent Inferencementioning
confidence: 99%