Informed Proposals for Local MCMC in Discrete Spaces

References

• Barker, A. A. (1965), “Monte Carlo Calculations of the Radial Distribution Functions for a Proton–Electron Plasma,” Australian Journal of Physics, 18, 119–134. DOI: 10.1071/PH650119.
   Google Scholar
• Briscolini, D., Di Consiglio, L., Liseo, B., Tancredi, A., and Tuoto, T. (2018), “New Methods for Small Area Estimation With Linkage Uncertainty,” International Journal of Approximate Reasoning, 94, 30–42. DOI: 10.1016/j.ijar.2017.12.005.
   Web of Science ®Google Scholar
• Copas, J., and Hilton, F. (1990), “Record Linkage: Statistical Models for Matching Computer Records,” Journal of the Royal Statistical Society, Series A, 153, 287–320. DOI: 10.2307/2982975.
   PubMed Web of Science ®Google Scholar
• Dellaert, F., Seitz, S., Thorpe, C., and Thrun, S. (2003), “EM, MCMC, and Chain Flipping for Structure From Motion With Unknown Correspondence,” Machine Learning, 50, 45–71.
   Web of Science ®Google Scholar
• Durmus, A., Roberts, G. O., Vilmart, G., Zygalakis, K. C. (2017), “Fast langevin Based Algorithm for MCMC in High Dimensions,” The Annals of Applied Probability, 27, 2195–2237. DOI: 10.1214/16-AAP1257.
   Web of Science ®Google Scholar
• Fellegi, I. P., and Sunter, A. B. (1969), “A Theory for Record Linkage,” Journal of the American Statistical Association, 64, 1183–1210. DOI: 10.1080/01621459.1969.10501049.
   Web of Science ®Google Scholar
• Girolami, M., and Calderhead, B. (2011), “Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods,” Journal of the Royal Statistical Society, Series B, 73, 123–214. DOI: 10.1111/j.1467-9868.2010.00765.x.
   Google Scholar
• Green, P. J., and Mardia, K. V. (2006), “Bayesian Alignment Using Hierarchical Models, With Applications in Protein Bioinformatics,” Biometrika, 93, 235–254. DOI: 10.1093/biomet/93.2.235.
   Web of Science ®Google Scholar
• Hastings, W. K. (1970), “Monte Carlo Sampling Methods Using Markov Chains and Their Applications,” Biometrika, 57, 97–109. DOI: 10.1093/biomet/57.1.97.
   Web of Science ®Google Scholar
• Hurn, M. (1997), “Difficulties in the Use of Auxiliary Variables in Markov Chain Monte Carlo Methods,” Statistics and Computing, 7, 35–44.
   Web of Science ®Google Scholar
• Jerrum, M., and Sinclair, A. (1996), “The Markov Chain Monte Carlo method: An Approach to Approximate Counting and Integration,” in Approximation Algorithms for NP-hard Problems, Boston: PWS Publishing Co., pp. 482–520.
   Google Scholar
• Johndrow, J., Lum, K., and Dunson, D. (2018), “Theoretical Limits of Microclustering for Record Linkage,” Biometrika, 105, 431–446. DOI: 10.1093/biomet/asy003.
   PubMed Web of Science ®Google Scholar
• Lee, A., Yau, C., Giles, M. B., Doucet, A., and Holmes, C. C. (2010), “On the Utility of Graphics Cards to Perform Massively Parallel Simulation of Advanced Monte Carlo Methods,” Journal of Computational and Graphical Statistics, 19, 769–789. DOI: 10.1198/jcgs.2010.10039.
   PubMed Web of Science ®Google Scholar
• Levin, D., Peres, Y., and Wilmer, E. (2009), Markov Chains and Mixing Times, Providence, RI: American Mathematical Society.
   Google Scholar
• Liu, J. S., Liang, F., and Wong, W. H. (2000), “The Multiple-Try Method and Local Optimization in Metropolis Sampling,” Journal of the American Statistical Association, 95, 121–134. DOI: 10.1080/01621459.2000.10473908.
   Web of Science ®Google Scholar
• McVeigh, B. S., and Murray, J. S. (2017), “Practical Bayesian Inference for Record Linkage,” arXiv preprint arXiv:1710.10558.
   Google Scholar
• Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E. (1953), “Equation of State Calculations by Fast Computing Machines,” The Journal of Chemical Physics, 21, 1087–1092. DOI: 10.1063/1.1699114.
   Web of Science ®Google Scholar
• Moores, M. T., Hargrave, C. E., Deegan, T., Poulsen, M., Harden, F., and Mengersen, K. (2015a), “An External Field Prior for the Hidden Potts Model With Application to Cone-Beam Computed Tomography,” Computational Statistics & Data Analysis, 86, 27–41. DOI: 10.1016/j.csda.2014.12.001.
   Web of Science ®Google Scholar
• Moores, M. T., Pettitt, A. N., and Mengersen, K. “Scalable Bayesian Inference for the Inverse Temperature of a Hidden Potts Model,” arXiv preprint arXiv:1503.08066, 2015b.
   Google Scholar
• Neal, R. (2011), “MCMC Using Hamiltonian Dynamics,” in Handbook of Markov Chain Monte Carlo, eds. S. Brooks, A. Gelman, G. Jones, and X. Meng, New York: CRC Press, pp. 113–162.
   Google Scholar
• Nishimura, A., Dunson, D., and Lu, J. (2017), “Discontinuous Hamiltonian Monte Carlo for Sampling Discrete Parameters,” arXiv preprint arXiv:1705.08510.
   Google Scholar
• Oh, S., Russell, S., and Sastry, S. “Markov Chain Monte Carlo Data Association for Multi-Target Tracking,” IEEE Transactions on Automatic Control, 54, 481–497, 2009.
   Web of Science ®Google Scholar
• Pakman, A., and Paninski, L. (2013), “Auxiliary-Variable Exact Hamiltonian Monte Carlo Samplers for Binary Distributions,” in Advances in Neural Information Processing Systems, 2490–2498.
   Google Scholar
• Peskun, P. (1973), “Optimum Monte-Carlo Sampling Using Markov Chains,” Biometrika, 60, 607–612. DOI: 10.1093/biomet/60.3.607.
   Web of Science ®Google Scholar
• Plummer, M., Best, N., Cowles, K., and Vines. K. (2006), “Coda: Convergence Diagnosis and Output Analysis for MCMC,” R News, 6, 7–11, available at https://journal.r-project.org/archive/.
   Google Scholar
• Robert, C., and Casella, G. (2005), Monte Carlo Statistical Methods, Heidelberg: Springer-Verlag Berlin.
   Google Scholar
• Roberts, G., and Rosenthal, J. (1998), “Optimal Scaling of Discrete Approximations to Langevin Diffusions,” Journal of the Royal Statistical Society, Series B, 60, 255–268. DOI: 10.1111/1467-9868.00123.
   Google Scholar
• Roberts, G., Gelman, A., and Gilks, W. (1997), “Weak Convergence and Optimal Scaling of Random Walk Metropolis Algorithms,” The Annals of Applied Probability, 7, 110–120. DOI: 10.1214/aoap/1034625254.
   Web of Science ®Google Scholar
• Sadinle, M. (2017), “Bayesian Estimation of Bipartite Matchings for Record Linkage,” Journal of the American Statistical Association, 112, 1–13.
   PubMed Web of Science ®Google Scholar
• Schäfer, C., and Chopin, N. (2013), “Sequential Monte Carlo on Large Binary Sampling Spaces,” Statistics and Computing, 23, 163–184. DOI: 10.1007/s11222-011-9299-z.
   Web of Science ®Google Scholar
• Steorts, R. C. (2015) “Entity Resolution With Empirically Motivated Priors,” Bayesian Analysis, 10, 849–875. DOI: 10.1214/15-BA965SI.
   Web of Science ®Google Scholar
• Steorts, R. C., Hall, R., and Fienberg, S. E. (2016), “A Bayesian Approach to Graphical Record Linkage and Deduplication,” Journal of the American Statistical Association, 111, 1660–1672. DOI: 10.1080/01621459.2015.1105807.
   Web of Science ®Google Scholar
• Swendsen, R. H., and Wang, J.-S. (1987), “Nonuniversal Critical Dynamics in Monte Carlo Simulations,” Physical Review Letters, 58, 86. DOI: 10.1103/PhysRevLett.58.86.
   PubMed Web of Science ®Google Scholar
• Tancredi, A., and Liseo, B. (2011), “A Hierarchical Bayesian Approach to Record Linkage and Population Size Problems,” The Annals of Applied Statistics, 5, 1553–1585. DOI: 10.1214/10-AOAS447.
   Web of Science ®Google Scholar
• Tierney, L. (1998), “A Note on Metropolis–Hastings Kernels for General State Spaces,” Annals of Applied Probability, 8, 1–9. DOI: 10.1214/aoap/1027961031.
   Web of Science ®Google Scholar
• Titsias, M. K., and Papaspiliopoulos, O. (2018), “Auxiliary Gradient-based Sampling Algorithms,” Journal of the Royal Statistical Society, Series B, 80, 749–767. DOI: 10.1111/rssb.12269.
   Google Scholar
• Titsias, M. K., and Yau, C. (2017), “The Hamming Ball Sampler,” Journal of the American Statistical Association, 112, 1–14.
   PubMed Web of Science ®Google Scholar
• Welling, M., and Teh, Y. (2011), “Bayesian Learning Via Stochastic Gradient Langevin Dynamics,” Proceedings of the 28th International Conference on Machine Learning (ICML-11), Bellevue, WA, 681–688.
   Google Scholar
• Zanella, G. (2015), “Random Partition Models and Complementary Clustering of Anglo-Saxon Place-Names,” The Annals of Applied Statistics, 9, 1792–1822. DOI: 10.1214/15-AOAS884.
   Web of Science ®Google Scholar
• Zanella, G., Betancourt, B., Wallach, H., Miller, J., Zaidi, A., and Steorts, R. C. (2016), “Flexible Models for Microclustering With Application to Entity Resolution,” Advances in Neural Information Processing Systems, 1417–1425.
   Google Scholar
• Zhang, Y., Ghahramani, Z., Storkey, A. J., and Sutton, C. A. (2012), “Continuous Relaxations for Discrete Hamiltonian Monte Carlo,” in Advances in Neural Information Processing Systems, eds. F. Pereira, C. J. C. Burges, L. Bottou and K. Q. Weinberger, Lake Tahoe, NV: Curran Associates, Inc., 3194–3202.
   Google Scholar