{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RLHFK7OVLTDLG36FTD2SUTGXSC","short_pith_number":"pith:RLHFK7OV","schema_version":"1.0","canonical_sha256":"8ace557dd55cc6b36fc598f52a4cd790806bbd8b47d807be369ecd22920e4539","source":{"kind":"arxiv","id":"2605.12807","version":1},"attestation_state":"computed","paper":{"title":"Multi-Marginal Couplings for Metropolis-Hastings","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent.","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.CO","authors_text":"Ashish Khisti, Buu Phan, Gergely Flamich, Shahab Asoodeh","submitted_at":"2026-05-12T22:59:47Z","abstract_excerpt":"Convergence diagnosis for Markov chain Monte Carlo is a matter of fundamental importance in computational statistics: it determines the resources allocated to a particular sampling problem and influences the practitioner's view of the quality of estimates obtained from a Markov chain. Motivated by this, we contribute to the emerging class of coupling-based convergence diagnostic algorithms. Concretely, we study coupling multiple Metropolis-Hastings chains using multi-marginal coupling. We introduce a natural objective for this setting and establish lower and upper bounds by drawing connections"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.12807","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2026-05-12T22:59:47Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d3f052aa21bdbdbd1d180a316c32be343642c57b629ba045889ed8cbca376c7a","abstract_canon_sha256":"d098f7e283f2f152065047f75312a62ae3ab4703f3360f008609b1c971d3de8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.580578Z","signature_b64":"Hn+e5YFiKZa60E6hwGn/Maz+pEW0wyNbUH5OYuBpZBV1rjeQbvL5j42VwAkcVUCrGGkyDUbv946MeKTDryWCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ace557dd55cc6b36fc598f52a4cd790806bbd8b47d807be369ecd22920e4539","last_reissued_at":"2026-05-18T03:09:12.579734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.579734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Marginal Couplings for Metropolis-Hastings","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent.","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.CO","authors_text":"Ashish Khisti, Buu Phan, Gergely Flamich, Shahab Asoodeh","submitted_at":"2026-05-12T22:59:47Z","abstract_excerpt":"Convergence diagnosis for Markov chain Monte Carlo is a matter of fundamental importance in computational statistics: it determines the resources allocated to a particular sampling problem and influences the practitioner's view of the quality of estimates obtained from a Markov chain. Motivated by this, we contribute to the emerging class of coupling-based convergence diagnostic algorithms. Concretely, we study coupling multiple Metropolis-Hastings chains using multi-marginal coupling. We introduce a natural objective for this setting and establish lower and upper bounds by drawing connections"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments on grand couplings of Markov chains show that our methods improve coalescence rates across dimensions, reducing meeting times by up to 50% compared with existing baselines.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The adaptive rule for updating the point process preserves the validity of the multi-marginal coupling while removing the dimension-dependent runtime bottleneck.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Multi-marginal couplings combined with an adaptive shared-randomness Poisson Monte Carlo method improve coalescence rates for multiple Metropolis-Hastings chains, cutting meeting times by up to 50%.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"761a91710c71190b481c718f40b9413a03e1b2a68b26c3c18f43f60185324094"},"source":{"id":"2605.12807","kind":"arxiv","version":1},"verdict":{"id":"d49ce706-634f-41b9-8051-cc91f3a2477d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:18:35.114651Z","strongest_claim":"Experiments on grand couplings of Markov chains show that our methods improve coalescence rates across dimensions, reducing meeting times by up to 50% compared with existing baselines.","one_line_summary":"Multi-marginal couplings combined with an adaptive shared-randomness Poisson Monte Carlo method improve coalescence rates for multiple Metropolis-Hastings chains, cutting meeting times by up to 50%.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The adaptive rule for updating the point process preserves the validity of the multi-marginal coupling while removing the dimension-dependent runtime bottleneck.","pith_extraction_headline":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent."},"references":{"count":29,"sample":[{"doi":"","year":1903,"title":"Pairwise optimal coupling of multiple random variables.arXiv preprint arXiv:1903.00632, 2019","work_id":"8f80251f-30e1-429b-9f28-02dc1dec5c4c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Estimating convergence of markov chains with l-lag couplings.Advances in neural information processing systems, 32, 2019","work_id":"e604119b-7365-4b2b-98fa-5d2b4af1ae95","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"General methods for monitoring convergence of iterative simulations.Journal of computational and graphical statistics, 7(4):434–455, 1998","work_id":"0142c83a-1763-4050-97d9-3822e1a47301","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"A coupling-based approach to f-divergences diagnostics for markov chain monte carlo.arXiv preprint arXiv:2510.07559, 2025","work_id":"7c4ca0bb-e7de-409e-a53a-a22607eba396","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Coupling without communi- cation and drafter-invariant speculative decoding","work_id":"72c1ef01-9d86-40ed-8b59-2c45ff68ebba","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":29,"snapshot_sha256":"5381f48e6a7fc5aaf43e51e262a3acddf7b0c36a5d77544ac5ff3c16990d0342","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"af774157885fce277b8851c63a1f15f1547ee5c08103bd80fcc275cfc3f7e52e"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.12807","created_at":"2026-05-18T03:09:12.579853+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12807v1","created_at":"2026-05-18T03:09:12.579853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12807","created_at":"2026-05-18T03:09:12.579853+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLHFK7OVLTDL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLHFK7OVLTDLG36F","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLHFK7OV","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC","json":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC.json","graph_json":"https://pith.science/api/pith-number/RLHFK7OVLTDLG36FTD2SUTGXSC/graph.json","events_json":"https://pith.science/api/pith-number/RLHFK7OVLTDLG36FTD2SUTGXSC/events.json","paper":"https://pith.science/paper/RLHFK7OV"},"agent_actions":{"view_html":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC","download_json":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC.json","view_paper":"https://pith.science/paper/RLHFK7OV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12807&json=true","fetch_graph":"https://pith.science/api/pith-number/RLHFK7OVLTDLG36FTD2SUTGXSC/graph.json","fetch_events":"https://pith.science/api/pith-number/RLHFK7OVLTDLG36FTD2SUTGXSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/action/storage_attestation","attest_author":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/action/author_attestation","sign_citation":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/action/citation_signature","submit_replication":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/action/replication_record"}},"created_at":"2026-05-18T03:09:12.579853+00:00","updated_at":"2026-05-18T03:09:12.579853+00:00"}