ABC Samplers
This Chapter, "ABC Samplers", is to appear in the forthcoming Handbook of Approximate Bayesian Computation (2018). It details the main ideas and algorithms used to sample from the ABC approximation to the posterior distribution, including methods based on rejection/importance sampling, MCMC and sequential Monte Carlo.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
New affine invariant ensemble samplers and their dimensional scaling
We introduce new affine invariant ensemble samplers that are easy to construct and improve upon existing algorithms, especially for high-dimensional problems. Specifically, we propose a derivative-free ensemble side move…
Time Division Multiplexing: From a Co-Prime Sampling Point of View
Co-prime sampling is a strategy for acquiring the signal below the Nyquist rate. The prototype and extended co-prime samplers require two low rate sub-samplers. One of the sub-samplers in the extended co-prime scheme is …
A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplers
We study the complexity of heavy-tailed sampling and present a separation result in terms of obtaining high-accuracy versus low-accuracy guarantees i.e., samplers that require only $O(\log(1/\varepsilon))$ versus $\Omega…
Convergence rates for optimised adaptive importance samplers
Adaptive importance samplers are adaptive Monte Carlo algorithms to estimate expectations with respect to some target distribution which \textit{adapt} themselves to obtain better estimators over a sequence of iterations…
Corrected Samplers for Discrete Flow Models
Discrete flow models (DFMs) have been proposed to learn the data distribution on finite state space, offering a flexible framework as an alternative to discrete diffusion models. A line of recent work has studied sampler…
Text-to-Image Generation