{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/unbiased-markov-chain-monte-carlo-with","title":"Unbiased Markov chain Monte Carlo with couplings","arxiv_id":"1708.03625","date":"2017-08-11","proceeding":null,"authors":["Pierre E. Jacob","John O'Leary","Yves F. Atchadé"],"abstract":"Markov chain Monte Carlo (MCMC) methods provide consistent of integrals as the number of iterations goes to infinity. MCMC estimators are generally biased after any fixed number of iterations. We propose to remove this bias by using couplings of Markov chains together with a telescopic sum argument of Glynn and Rhee (2014). The resulting unbiased estimators can be computed independently in parallel. We discuss practical couplings for popular MCMC algorithms. We establish the theoretical validity of the proposed estimators and study their efficiency relative to the underlying MCMC algorithms. Finally, we illustrate the performance and limitations of the method on toy examples, on an Ising model around its critical temperature, on a high-dimensional variable selection problem, and on an approximation of the cut distribution arising in Bayesian inference for models made of multiple modules.","url_abs":"https://arxiv.org/abs/1708.03625v4","url_pdf":"https://arxiv.org/pdf/1708.03625v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"unbiased-markov-chain-monte-carlo-with","repo_url":"https://github.com/pierrejacob/debiasedmcmc","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"unbiased-markov-chain-monte-carlo-with","repo_url":"https://github.com/pierrejacob/unbiasedmcmc","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"unbiased-markov-chain-monte-carlo-with","repo_url":"https://github.com/ColCarroll/couplings","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"unbiased-markov-chain-monte-carlo-with","repo_url":"https://github.com/niloyb/LlagCouplings","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=1708.03625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.03625"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pierrejacob/debiasedmcmc","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ColCarroll/couplings","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/niloyb/LlagCouplings","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pierrejacob/unbiasedmcmc","reach":{"status":"unanswered"}}],"summary":{"ran_draft_wrong":1,"ran_honours":2,"unverified":1},"by_repo_kind":{"listed":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"36d801042d0cb566","entry":"maximal_coupling","repo":"ColCarroll/couplings","repo_kind":"listed","path":"couplings/maximal_couplings.py","file_url":"https://github.com/ColCarroll/couplings/blob/HEAD/couplings/maximal_couplings.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"36d801042d0cb566"}},{"code_sha256_prefix":"cf2b5d2f46ed1f2a","entry":"maximal_coupling_reference","repo":"ColCarroll/couplings","repo_kind":"listed","path":"couplings/maximal_couplings.py","file_url":"https://github.com/ColCarroll/couplings/blob/HEAD/couplings/maximal_couplings.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cf2b5d2f46ed1f2a"}},{"code_sha256_prefix":"b42c95e02f86921f","entry":"unbiased_estimator","repo":"ColCarroll/couplings","repo_kind":"listed","path":"couplings/metropolis_hastings.py","file_url":"https://github.com/ColCarroll/couplings/blob/HEAD/couplings/metropolis_hastings.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b42c95e02f86921f"}},{"code_sha256_prefix":"5102681d4097aefa","entry":"reflection_maximal_coupling","repo":"ColCarroll/couplings","repo_kind":"listed","path":"couplings/maximal_couplings.py","file_url":"https://github.com/ColCarroll/couplings/blob/HEAD/couplings/maximal_couplings.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5102681d4097aefa"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}