Papers › An adaptive approximate Bayesian computation MCMC with Global-Local proposals
An adaptive approximate Bayesian computation MCMC with Global-Local proposals
Xuefei Cao, Shijia Wang, Yongdao Zhou
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper, we address the challenge of Markov Chain Monte Carlo (MCMC) algorithms within the approximate Bayesian Computation (ABC) framework, which often get trapped in local optima due to their inherent local exploration mechanism. We propose a novel Global-Local ABC-MCMC algorithm that combines the ``exploration" capabilities of global proposals with the ``exploitation" finesse of local proposals. We integrate iterated importance resampling into the likelihood-free framework to establish an effective global proposal distribution. For high-dimensional parameter spaces, we optimize the efficiency of the local sampler by leveraging Langevin dynamics and common random numbers. Furthermore, we introduce two adaptive schemes to enhance the algorithmic performance. The first scheme divides the update target of the importance proposal into a sequence of intermediate target distributions that progressively approximate the ABC posterior, thereby gradually updating the importance proposal distribution during the iterations. The second adaptive scheme automatically selects the optimal mixture of global and local moves through sequential optimization, based on a relative version of the expected squared jumping distance (ESJD). We theoretically and numerically demonstrate that our method is able to improve sampling efficiency and achieve more reliable convergence for complex posteriors. We develop a software package that is available at https://github.com/caofff/GL-ABC-MCMC.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections