2006
DOI: 10.1214/06-ba127
|View full text |Cite
|
Sign up to set email alerts
|

Nested sampling for general Bayesian computation

Abstract: Nested sampling estimates directly how the likelihood function relates to prior mass. The evidence (alternatively the marginal likelihood, marginal density of the data, or the prior predictive) is immediately obtained by summation. It is the prime result of the computation, and is accompanied by an estimate of numerical uncertainty. Samples from the posterior distribution are an optional byproduct, obtainable for any temperature. The method relies on sampling within a hard constraint on likelihood value, as op… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

6
1,539
0
3

Year Published

2010
2010
2018
2018

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 1,471 publications
(1,607 citation statements)
references
References 13 publications
6
1,539
0
3
Order By: Relevance
“…It is at least of the same complexity as a one-dimensional slice sampler, which produces an uniformly ergodic Markov chain when the likelihood L is bounded but may be slow to converge in other settings (Roberts & Rosenthal, 1999). Skilling (2006) proposes to sample values of θ by iterating M Markov chain Monte Carlo steps, using the truncated prior as the invariant distribution, and a point chosen at random among the N − 1 survivors as the starting point. Since the starting value is already distributed from the invariant distribution, a finite number M of iterations produces an outcome that is marginally distributed from the correct distribution.…”
Section: ·1 Simulating From a Constrained Priormentioning
confidence: 99%
See 3 more Smart Citations
“…It is at least of the same complexity as a one-dimensional slice sampler, which produces an uniformly ergodic Markov chain when the likelihood L is bounded but may be slow to converge in other settings (Roberts & Rosenthal, 1999). Skilling (2006) proposes to sample values of θ by iterating M Markov chain Monte Carlo steps, using the truncated prior as the invariant distribution, and a point chosen at random among the N − 1 survivors as the starting point. Since the starting value is already distributed from the invariant distribution, a finite number M of iterations produces an outcome that is marginally distributed from the correct distribution.…”
Section: ·1 Simulating From a Constrained Priormentioning
confidence: 99%
“…
SUMMARYNested sampling is a simulation method for approximating marginal likelihoods proposed by Skilling (2006). We establish that nested sampling has an approximation error that vanishes at the standard Monte Carlo rate and that this error is asymptotically Gaussian.
…”
mentioning
confidence: 93%
See 2 more Smart Citations
“…Using two classes of stochastic sampling techniques, Markov-Chain Monte Carlo [20][21][22] and nested sampling [23][24][25], LALINFERENCE coherently analyzes the data from all the interferometers in the network and generates the multidimensional PDF on the full set of parameters needed to describe a binary system before marginalizing over all parameters other than the sky location (a binary in circular orbit is described by 9 to 15 parameters, depending on whether spins of the binary components are included in the model). (ii) A much faster low-latency technique, that we will call TIMING++ [8], uses data products from the search stage of the analysis, and can construct sky maps on (sub)minute time scales by using primarily time-delay information between different detector sites.…”
Section: Introductionmentioning
confidence: 99%