Parallelized nested sampling
Parallelized nested sampling
复制标题
并行嵌套采样
DOI:
--
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
P. Goggans
中科院分区:
文献类型:
--
作者:
R. W. Henderson;P. Goggans
One of the important advantages of nested sampling as an MCMC technique is its ability to draw representative samples from multimodal distributions and distributions with other degeneracies. This coverage is accomplished by maintaining a number of so-called live samples within a likelihood constraint. In usual practice, at each step, only the sample with the least likelihood is discarded from this set of live samples and replaced. In [1], Skilling shows that for a given number of live samples, discarding only one sample yields the highest precision in estimation of the log-evidence. However, if we increase the number of live samples, more samples can be discarded at once while still maintaining the same precision. For computer code running only serially, this modification would considerably increase the wall clock time necessary to reach convergence. However, if we use a computer with parallel processing capabilities, and we write our code to take advantage of this parallelism to replace multiple samples ...