Papers › Many processors, little time: MCMC for partitions via optimal transport couplings

Many processors, little time: MCMC for partitions via optimal transport couplings

23 Feb 2022arXiv:2202.11258archive 2025-07-28

Tin D. Nguyen, Brian L. Trippe, Tamara Broderick

Markov chain Monte Carlo (MCMC) methods are often used in clustering since they guarantee asymptotically exact expectations in the infinite-time limit. In finite time, though, slow mixing often leads to poor performance. Modern computing environments offer massive parallelism, but naive implementations of parallel MCMC can exhibit substantial bias. In MCMC samplers of continuous random variables, Markov chain couplings can overcome bias. But these approaches depend crucially on paired chains meetings after a small number of transitions. We show that straightforward applications of existing coupling ideas to discrete clustering variables fail to meet quickly. This failure arises from the "label-switching problem": semantically equivalent cluster relabelings impede fast meeting of coupled chains. We instead consider chains as exploring the space of partitions rather than partitions' (arbitrary) labelings. Using a metric on the partition space, we formulate a practical algorithm using optimal transport couplings. Our theory confirms our method is accurate and efficient. In experiments ranging from clustering of genes or seeds to graph colorings, we show the benefits of our coupling in the highly parallel, time-limited regime.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 20 code samples harvested from 1 repository linked to this paper: 16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 20 samples from 1 repository, 16 ran (16 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

tinnguyen96/partition-coupling officialmentioned in paperMITSyntology: 20 samples, 16 ran (0 instrument-failed) · 4 unverified report

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

20 samples harvested: 16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

16ran
4unverified

Licence: 0 of the 20 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from tinnguyen96/partition-coupling. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

tinnguyen96/partition-coupling official repository 20 samples, 16 ran (0 instrument-failed) · 4 unverified
LCP modules/interesting_functions.py ran MIT (permissive) · 52ecba0403862b85 · report fixture: signature clusts:list/1/set, k:int/0/int · returned ndarray · level recorded 2026-09-24
SixNodeDegFourRegularinit modules/priors.py ran MIT (permissive) · 757d637a887bc404 · report fixture: signature initType:str/0/str · returned tuple · level recorded 2026-09-24
VI_dist modules/partitions.py ran MIT (permissive) · 006ad395725d839e · report fixture: signature clusts1:list/1/set, clusts2:list/1/set · returned float64 · level recorded 2026-09-24
arith_mean modules/aggregators.py ran MIT (permissive) · a8a74b742ef32668 · report fixture: signature x:ndarray/1/float, BT_size:int/0/int, true_val:float/0/float · returned tuple · level recorded 2026-09-24
entropy in 112 papers
census: 22 implementations from 25 papers, 16 distinct outputs across 4 buckets, one shared input per bucket
modules/partitions.py ran MIT (permissive) · 4bae1bb8c1f13a15 · report fixture: signature clusts:list/1/list · returned tuple · level recorded 2026-09-24
extractUnbiasedEstimate modules/samplerLib.py ran MIT (permissive) · 71a5be9eac813695 · report fixture: signature M:int/0/int, burnIn:int/0/int, minIter:int/0/int, hX:list/1/ndarray, hY:list/1/ndarray, tau:int/0/int · returned ndarray · level recorded 2026-09-24
indep_coupling modules/couplings.py ran MIT (permissive) · edd99dab9e297332 · report fixture: signature loc_probs1:ndarray/1/float, loc_probs2:ndarray/1/float, rng:RandomState/0/? · returned tuple · level recorded 2026-09-24
loadGraphData modules/dataUtils.py ran MIT (permissive) · fe91a32664a7e966 · report fixture: signature rDir:str/0/str, dataName:str/0/str · returned Graph · level recorded 2026-09-24
loadMixtureData modules/dataUtils.py ran MIT (permissive) · d9a3a10fbbe7322e · report fixture: signature rDir:str/0/str, dataName:str/0/str · returned ndarray · level recorded 2026-09-24
med_of_m modules/aggregators.py ran MIT (permissive) · 5747252b4dfbd0bc · report fixture: signature x:ndarray/1/float, K:int/0/int, BT_size:int/0/int, true_val:float/0/float · returned tuple · level recorded 2026-09-24
pairwise_VI_dists modules/partitions.py ran MIT (permissive) · b2c557935d487b3c · report fixture: signature clusts1:list/1/set, clusts2:list/1/set, n:int/0/int, allowNewClustX:bool/0/bool, allowNewClustY:bool/0/bool · returned ndarray · level recorded 2026-09-24
parse_compile_file modules/names_and_parser.py ran MIT (permissive) · 5aaa57f3f9c92ea4 · report fixture: signature path:str/0/str · returned dict · level recorded 2026-09-24
posterior_predictive_density modules/interesting_functions.py ran MIT (permissive) · 1be9212a536baf06 · report fixture: signature data:ndarray/2/float, z:ndarray/1/int, data_new:ndarray/2/float, sd:float/0/float, sd0:float/0/float, alpha:float/0/float · returned ndarray · level recorded 2026-09-24
pure_maximal_coupling modules/couplings.py ran MIT (permissive) · 2685d793e0e91366 · report fixture: signature loc_probs1:ndarray/1/float, loc_probs2:ndarray/1/float, rng:RandomState/0/? · returned tuple · level recorded 2026-09-24
pure_naive_coupling modules/couplings.py ran MIT (permissive) · ecc9d019e106cf66 · report fixture: signature loc_probs1:ndarray/1/float, loc_probs2:ndarray/1/float, rng:RandomState/0/? · returned tuple · level recorded 2026-09-24
strToList modules/names_and_parser.py ran fingerprinted MIT (permissive) · 13b4e62e68acd01a · report fixture: signature sampleNonPartitionStr:str/0/str · returned list · level recorded 2026-09-24
find_representative_dists modules/compileUtils.py unverified MIT (permissive) · 46911ec11ede55ea · report
paired_init modules/priors.py unverified MIT (permissive) · 768b052a3ef85107 · report
parse_compile_file_type2 modules/names_and_parser.py unverified MIT (permissive) · 8c9a742daa3a2f4d · report
trim_mean modules/aggregators.py unverified MIT (permissive) · 887b7c45b6e67b1a · report

Tasks

Clustering

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