{"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/coreset-markov-chain-monte-carlo","title":"Coreset Markov Chain Monte Carlo","arxiv_id":"2310.17063","date":"2023-10-25","proceeding":null,"authors":["Naitong Chen","Trevor Campbell"],"abstract":"A Bayesian coreset is a small, weighted subset of data that replaces the full dataset during inference in order to reduce computational cost. However, state of the art methods for tuning coreset weights are expensive, require nontrivial user input, and impose constraints on the model. In this work, we propose a new method -- Coreset MCMC -- that simulates a Markov chain targeting the coreset posterior, while simultaneously updating the coreset weights using those same draws. Coreset MCMC is simple to implement and tune, and can be used with any existing MCMC kernel. We analyze Coreset MCMC in a representative setting to obtain key insights about the convergence behaviour of the method. Empirical results demonstrate that Coreset MCMC provides higher quality posterior approximations and reduced computational cost compared with other coreset construction methods. Further, compared with other general subsampling MCMC methods, we find that Coreset MCMC has a higher sampling efficiency with competitively accurate posterior approximations.","url_abs":"https://arxiv.org/abs/2310.17063v2","url_pdf":"https://arxiv.org/pdf/2310.17063v2.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":"coreset-markov-chain-monte-carlo","repo_url":"https://github.com/naitongchen/coreset-mcmc-experiments","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2310.17063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17063"}},"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/naitongchen/coreset-mcmc-experiments","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":3},"by_repo_kind":{"official":{"samples":3,"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":"bf4c9ae9f2a061bc","entry":"kl_heuristic","repo":"naitongchen/coreset-mcmc-experiments","repo_kind":"official","path":"gaussian_location_convergence.py","file_url":"https://github.com/naitongchen/coreset-mcmc-experiments/blob/HEAD/gaussian_location_convergence.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bf4c9ae9f2a061bc"}},{"code_sha256_prefix":"39f5768e05b71444","entry":"tune_gamma","repo":"naitongchen/coreset-mcmc-experiments","repo_kind":"official","path":"gaussian_location_convergence.py","file_url":"https://github.com/naitongchen/coreset-mcmc-experiments/blob/HEAD/gaussian_location_convergence.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"39f5768e05b71444"}},{"code_sha256_prefix":"e33defc6a9ffd32b","entry":"tune_gamma_alpha","repo":"naitongchen/coreset-mcmc-experiments","repo_kind":"official","path":"gaussian_location_convergence.py","file_url":"https://github.com/naitongchen/coreset-mcmc-experiments/blob/HEAD/gaussian_location_convergence.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e33defc6a9ffd32b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}