{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/parallelizing-mcmc-with-random-partition","title":"Parallelizing MCMC with Random Partition Trees","arxiv_id":"1506.03164","date":"2015-06-10","proceeding":"NeurIPS 2015 12","authors":["Xiangyu Wang","Fangjian Guo","Katherine A. Heller","David B. Dunson"],"abstract":"The modern scale of data has brought new challenges to Bayesian inference. In\nparticular, conventional MCMC algorithms are computationally very expensive for\nlarge data sets. A promising approach to solve this problem is embarrassingly\nparallel MCMC (EP-MCMC), which first partitions the data into multiple subsets\nand runs independent sampling algorithms on each subset. The subset posterior\ndraws are then aggregated via some combining rules to obtain the final\napproximation. Existing EP-MCMC algorithms are limited by approximation\naccuracy and difficulty in resampling. In this article, we propose a new\nEP-MCMC algorithm PART that solves these problems. The new algorithm applies\nrandom partition trees to combine the subset posterior draws, which is\ndistribution-free, easy to resample from and can adapt to multiple scales. We\nprovide theoretical justification and extensive experiments illustrating\nempirical performance.","url_abs":"http://arxiv.org/abs/1506.03164v2","url_pdf":"http://arxiv.org/pdf/1506.03164v2.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":"abstracts"},"code_links":[{"paper_slug":"parallelizing-mcmc-with-random-partition","repo_url":"https://github.com/richardkwo/random-tree-parallel-MCMC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"parallelizing-mcmc-with-random-partition","repo_url":"https://github.com/wwrechard/random-tree-parallel-MCMC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1506.03164","atlas_url":"https://app.syntology.ai/?focus=1506.03164","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1506.03164"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1506.03164\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1506.03164"},"call":"get_concepts_for_paper(arxiv_id=\"1506.03164\")"}],"by_repo":[{"repo":"richardkwo/random-tree-parallel-MCMC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"wwrechard/random-tree-parallel-MCMC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7e2b9899bb5f099a070c9229d7fdf47509af45f1980285a9d2c781413235511e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}