Papers › MontePython 3: boosted MCMC sampler and other features
MontePython 3: boosted MCMC sampler and other features
Thejs Brinckmann, Julien Lesgourgues
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.
MontePython is a parameter inference package for cosmology. We present the latest development of the code over the past couple of years. We explain, in particular, two new ingredients both contributing to improve the performance of Metropolis-Hastings sampling: an adaptation algorithm for the jumping factor, and a calculation of the inverse Fisher matrix, which can be used as a proposal density. We present several examples to show that these features speed up convergence and can save many hundreds of CPU-hours in the case of difficult runs, with a poor prior knowledge of the covariance matrix. We also summarise all the functionalities of MontePython in the current release, including new likelihoods and plotting options.
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