cs.AIAug 13, 2026

FLARE MCMC: Fidelity-based Layer-Adaptive REcursive proposals for MCMC

Authors: Harini Venkatesan, Christian Shelton, Ming-Feng Ho, Simeon Bird, Mengxuan Wu

Organizations: Department of Computer Science and Engineering, University of California, Riverside · Leinweber Center for Theoretical Physics, University of Michigan · Department of Physics and Astronomy, University of California, Riverside

Abstract

Markov chain Monte Carlo (MCMC) requires only the ability to evaluate the likelihood, making it a common technique for inference in complex models. However, it can have a slow mixing rate, requiring the generation of many samples to obtain good estimates and an overall high computational cost. FLARE MCMC is a multi-fidelity layered MCMC method that exploits lower-fidelity approximations of the true likelihood calculation to improve mixing and leads to overall faster performance. Such lower-fidelity likelihoods are commonly available in scientific and engineering applications where the model involves a simulation whose resolution or accuracy can be tuned. Our technique uses recursive, layered chains with simple layer tuning; it does not require the likelihood to take any form or have any particular internal mathematical structure. We demonstrate experimentally that FLARE MCMC achieves larger effective sample sizes for the same computational time across different scientific domains including hydrology and cosmology.

Figures & tables

Appendix figures & tables2 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Product Monte Carlo: Expectation Under a Product of Densities

    Oct 8, 2026Pietro Carlotti, Sifan Liu, Yuling YaoBayesian Inference

  2. SCOPE Before You Sample: Conformal Scores Guide Posterior Exploration for Fast and Calibrated Bayesian Predictive Inference

    Oct 12, 2026Zahra Moslemi, Ziyi Liang, Babak ShahbabaBayesian InferencePosterior Sampling