Fetching the paper…
Reading the bibliography…
Most current sampling algorithms for high-dimensional distributions are based on MCMC techniques and are approximate in the sense that they are valid only asymptotically.
Shortest Connection Networks and Some Generalizations
R.C. Prim · 1957
Earlier work this paper cites.
A formal basis for the heuristic determination of minimum cost paths
P.E. Hart, N.J. Nilsson, and B. Raphael · 1968
Earlier work this paper cites.
Optimization by simulated annealing
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi · 1983
Earlier work this paper cites.
A tutorial on hidden markov models and selected applications in speech recognition
Lawrence R. Rabiner · 1989
Earlier work this paper cites.
Adaptive rejection sampling for gibbs sampling
W. R. Gilks and P. Wild · 1992
Earlier work this paper cites.
Document image decoding by heuristic search
Anthony C. Kam and Gary E. Kopec · 1996
Earlier work this paper cites.
Exact sampling with coupled markov chains and applications to statistical mechanics
J. Propp and D. Wilson · 1996
Earlier work this paper cites.
Probability and Measure Theory
Robert B. Ash and Catherine A. Doléans-Dade · 1999
Earlier work this paper cites.
Adding linguistic constraints to document image decoding: Comparing the iterate complete path and stack algorithms
Kris Popat, Danel Green, Justin Romberg, and Dan Bloombug · 2001
Cited alongside, same era.
Bayesian methods for hidden markov models: Recursive computing in the 21st century
Steven L. Scott · 2002
Cited alongside, same era.
Srilm - an extensible language modeling toolkit
Andreas Stolcke · 2002
Cited alongside, same era.
An introduction to MCMC for machine learning
Christophe Andrieu, Nando de Freitas, Arnaud Doucet, and Michael I. Jordan · 2003
Cited alongside, same era.
Monte Carlo Statistical Methods (Springer Texts in Statistics)
Christian P. Robert and George Casella · 2004
Cited alongside, same era.
Europarl: A parallel corpus for statistical machine translation
Philipp Koehn · 2005
Tightening LP relaxations for MAP using message-passing
David Sontag, Talya Meltzer, Amir Globerson, Yair Weiss, and Tommi Jaakkola · 2008
Later among the works it cites.
Probabilistic Graphical Models
Daphne Koller and Nir Friedman · 2009
Later among the works it cites.
Exact and Approximate Sampling by Systematic Stochastic Search
Vikash Mansinghka, Daniel Roy, Eric Jonas, and Joshua Tenenbaum · 2009
Later among the works it cites.
Dual decomposition and linear programming relaxations for natural language processing
Alexander M Rush, David Sontag, Michael Collins, and Tommi Jaakkola · 2010
Later among the works it cites.
Exact sampling for the ising model at all temperatures
M. Ullrich · 2010
Later among the works it cites.
Perfection within Reach: Exact MCMC Sampling
Radu V. Craiu and Xiao-Li Meng · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Concave convex adaptive rejection sampling
Dilan Gorur and Yee Whye Teh · 2008
Cited alongside, same era.
Later among the works it cites.
Exact Sampling and Decoding in High-Order Hidden Markov Models
Simon Carter, Marc Dymetman, and Guillaume Bouchard · 2012
Closest in time.