Fetching the paper…
Reading the bibliography…
Slice Sampling has emerged as a powerful Markov Chain Monte Carlo algorithm that adapts to the characteristics of the target distribution with minimal hand-tuning.
Robbins H, Monro S (1951) A stochastic approximation method. The annals of mathematical statistics pp 400–407
1951
Earlier work this paper cites.
Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society: Series B (Methodological) 39(1):1–22
1977
Earlier work this paper cites.
Gilks WR, Roberts GO, George EI (1994) Adaptive direction sampling. Journal of the Royal Statistical Society: Series D (The Statistician) 43(1):179–189
1994
Earlier work this paper cites.
Sokal A (1997) Monte carlo methods in statistical mechanics: foundations and new algorithms. In: Functional integration, Springer, pp 131–192
1997
Earlier work this paper cites.
Liu JS, Chen R (1998) Sequential monte carlo methods for dynamic systems. Journal of the American statistical association 93(443):1032–1044
1998
Earlier work this paper cites.
Haario H, Saksman E, Tamminen J, et al. (2001) An adaptive metropolis algorithm. Bernoulli 7(2):223–242
2001
Earlier work this paper cites.
Iba Y (2001) Extended ensemble monte carlo. International Journal of Modern Physics C 12(05):623–656
2001
Earlier work this paper cites.
MacKay DJ (2003) Information theory, inference and learning algorithms. Cambridge university press
2003
Earlier work this paper cites.
Neal RM (2003) Slice sampling. Annals of statistics pp 705–741
2003
Earlier work this paper cites.
Rasmussen CE (2003) Gaussian processes in machine learning. In: Summer School on Machine Learning, Springer, pp 63–71
2003
Earlier work this paper cites.
Keeling CD, Whorf TP (2004) Atmospheric co2 concentrations derived from flask air samples at sites in the sio network. Trends: a compendium of data on Global Change
2004
Earlier work this paper cites.
Bishop CM (2006) Pattern recognition. Machine learning 128(9)
2006
Cited alongside, same era.
Del Moral P, Doucet A, Jasra A (2006) Sequential monte carlo samplers. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 68(3):411–436
2006
Cited alongside, same era.
Ter Braak CJ (2006) A markov chain monte carlo version of the genetic algorithm differential evolution: easy bayesian computing for real parameter spaces. Statistics and Computing 16(3):239–249
2006
Cited alongside, same era.
Roberts GO, Rosenthal JS (2007) Coupling and ergodicity of adaptive markov chain monte carlo algorithms. Journal of applied probability 44(2):458–475
2007
Cited alongside, same era.
ter Braak CJ, Vrugt JA (2008) Differential evolution markov chain with snooker updater and fewer chains. Statistics and Computing 18(4):435–446
2008
Neal RM, et al. (2011) Mcmc using hamiltonian dynamics. Handbook of markov chain monte carlo 2(11):2
2011
Later among the works it cites.
Foreman-Mackey D, Hogg DW, Lang D, Goodman J (2013) emcee: the mcmc hammer. Publications of the Astronomical Society of the Pacific 125(925):306
2013
Later among the works it cites.
Hoffman MD, Gelman A (2014) The no-u-turn sampler: adaptively setting path lengths in hamiltonian monte carlo. Journal of Machine Learning Research 15(1):1593–1623
2014
Later among the works it cites.
Tibbits MM, Groendyke C, Haran M, Liechty JC (2014) Automated factor slice sampling. Journal of Computational and Graphical Statistics 23(2):543–563
2014
Later among the works it cites.
Farr B, Farr WM (2015) kombine: a kernel-density-based, embarrassingly parallel ensemble sampler. URL https://github.com/bfarr/kombine
2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Feroz F, Hobson MP (2008) Multimodal nested sampling: an efficient and robust alternative to markov chain monte carlo methods for astronomical data analyses. Monthly Notices of the Royal Astronomical Society 384(2):449–463
2008
Cited alongside, same era.
Nesterov Y (2009) Primal-dual subgradient methods for convex problems. Mathematical programming 120(1):221–259
2009
Cited alongside, same era.
Vrugt JA, Ter Braak C, Diks C, Robinson BA, Hyman JM, Higdon D (2009) Accelerating markov chain monte carlo simulation by differential evolution with self-adaptive randomized subspace sampling. International Journal of Nonlinear Sciences and Numerical Simulation 10(3):273–290
2009
Cited alongside, same era.
Goodman J, Weare J (2010) Ensemble samplers with affine invariance. Communications in applied mathematics and computational science 5(1):65–80
2010
Cited alongside, same era.
Görür D, Rasmussen CE (2010) Dirichlet process gaussian mixture models: Choice of the base distribution. Journal of Computer Science and Technology 25(4):653–664
2010
Cited alongside, same era.
Murray I, Adams R, MacKay D (2010) Elliptical slice sampling. In: Proceedings of the thirteenth international conference on artificial intelligence and statistics, JMLR Workshop and Conference Proceedings, pp 541–548
2010
Cited alongside, same era.
Garbuno-Inigo A, Hoffmann F, Li W, Stuart AM (2020a) Interacting langevin diffusions: Gradient structure and ensemble kalman sampler. SIAM Journal on Applied Dynamical Systems 19(1):412–441
Cited in the paper.
Later among the works it cites.
Tran KT, Ninness B (2015) Reunderstanding slice sampling as parallel mcmc. In: 2015 IEEE Conference on Control Applications (CCA), IEEE, pp 1197–1202
2015
Later among the works it cites.
Betancourt M (2017) A conceptual introduction to hamiltonian monte carlo. arXiv preprint arXiv:170102434
2017
Later among the works it cites.
Leimkuhler B, Matthews C, Weare J (2018) Ensemble preconditioning for markov chain monte carlo simulation. Statistics and Computing 28(2):277–290
2018
Later among the works it cites.
Foreman-Mackey D (2019) Autocorrelation analysis & convergence — emcee 3.0.2 documentation. URL https://emcee.readthedocs.io/en/stable/tutorials/autocorr/
2019
Later among the works it cites.
Karamanis M, Beutler F, Peacock JA (2021) zeus: A python implementation of ensemble slice sampling for efficient bayesian parameter inference. arXiv preprint arXiv:210503468
2021
Closest in time.
Nishihara R, Murray I, Adams RP (2014) Parallel mcmc with generalized elliptical slice sampling. The Journal of Machine Learning Research 15(1):2087–2112
2087
Closest in time.