Informed Proposals for Local MCMC in Discrete Spaces
From MaRDI portal
Publication:5130627
DOI10.1080/01621459.2019.1585255zbMath1445.60053arXiv1711.07424OpenAlexW2962997929MaRDI QIDQ5130627
Publication date: 28 October 2020
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.07424
Markov chain Monte CarloPeskun orderingBayesian discrete modelsBayesian record linkageinformed Metropolis-Hastings schemes
Related Items
Random Partition Models for Microclustering Tasks, Markov Kernels Local Aggregation for Noise Vanishing Distribution Sampling, A prior for record linkage based on allelic partitions, The G-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models, Nonreversible Jump Algorithms for Bayesian Nested Model Selection, d-blink: Distributed End-to-End Bayesian Entity Resolution, The taxicab sampler: MCMC for discrete spaces with application to tree models, A Bayesian Nonparametric Test for Cross-Group Differences Relative to a Control, Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes, A fresh Take on ‘Barker Dynamics’ for MCMC, A new flexible Bayesian hypothesis test for multivariate data, Unlabelled landmark matching via Bayesian data selection, and application to cell matching across imaging modalities, Gibbs Sampling for Mixtures in Order of Appearance: The Ordered Allocation Sampler, Bayesian Semiparametric Longitudinal Drift-Diffusion Mixed Models for Tone Learning in Adults, A multiple imputation procedure for record linkage and causal inference to estimate the effects of home-delivered meals, Informed reversible jump algorithms, Uncertainty modelling and computational aspects of data association, MALA with annealed proposals: a generalization of locally and globally balanced proposal distributions, Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An external field prior for the hidden Potts model with application to cone-beam computed tomography
- Random partition models and complementary clustering of Anglo-Saxon place-names
- Entity resolution with empirically motivated priors
- A hierarchical Bayesian approach to record linkage and population size problems
- Sequential Monte Carlo on large binary sampling spaces
- A note on Metropolis-Hastings kernels for general state spaces
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- EM, MCMC, and chain flipping for structure from motion with unknown correspondence
- Fast Langevin based algorithm for MCMC in high dimensions
- New methods for small area estimation with linkage uncertainty
- Optimum Monte-Carlo sampling using Markov chains
- Handbook of Markov Chain Monte Carlo
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- Auxiliary Gradient-Based Sampling Algorithms
- Markov Chain Monte Carlo Data Association for Multi-Target Tracking
- Equation of State Calculations by Fast Computing Machines
- Theoretical limits of microclustering for record linkage
- Bayesian alignment using hierarchical models, with applications in protein bioinformatics
- Monte Carlo sampling methods using Markov chains and their applications
