Papers › Partial Optimal Transport with Applications on Positive-Unlabeled Learning

Partial Optimal Transport with Applications on Positive-Unlabeled Learning

19 Feb 2020arXiv:2002.08276archive 2025-07-28

Laetitia Chapel, Mokhtar Z. Alaya, Gilles Gasso

Classical optimal transport problem seeks a transportation map that preserves the total mass betwenn two probability distributions, requiring their mass to be the same. This may be too restrictive in certain applications such as color or shape matching, since the distributions may have arbitrary masses and/or that only a fraction of the total mass has to be transported. Several algorithms have been devised for computing partial Wasserstein metrics that rely on an entropic regularization, but when it comes with exact solutions, almost no partial formulation of neither Wasserstein nor Gromov-Wasserstein are available yet. This precludes from working with distributions that do not lie in the same metric space or when invariance to rotation or translation is needed. In this paper, we address the partial Wasserstein and Gromov-Wasserstein problems and propose exact algorithms to solve them. We showcase the new formulation in a positive-unlabeled (PU) learning application. To the best of our knowledge, this is the first application of optimal transport in this context and we first highlight that partial Wasserstein-based metrics prove effective in usual PU learning settings. We then demonstrate that partial Gromov-Wasserstein metrics is efficient in scenario where point clouds come from different domains or have different features.

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 26 code samples harvested from 3 repositories linked to this paper: 6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 20 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 23 samples from 1 repository, 4 ran (4 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 3 samples from 2 repositories, 2 ran (1 with no instrument failure; 1 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 between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

rflamary/POT officialmentioned in papermentioned on GitHubpytorchMITSyntology: 23 samples, 4 ran (0 instrument-failed) · 19 unverified report
lchapel/partial-GW-for-PU mentioned on GitHubpytorchSyntology: 2 samples, 1 ran (1 instrument-failed) · 1 unverified report
thibsej/unbalanced_gromov_wasserstein mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 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

26 samples harvested: 6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 20 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.

1ran · honoured contract
1ran · our draft was wrong
4ran
20unverified

Licence: 2 of the 26 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 3 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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.

rflamary/POT official repository 23 samples, 4 ran (0 instrument-failed) · 19 unverified
convert_to_html_table benchmarks/benchmark.py ran MIT (permissive) · a2c491dbf8c2fc12 · report fixture: signature results:dict/0/?, param_name:str/0/str, main_title:str/0/str, comments:list/1/str · returned str · level recorded 2026-09-25
make_1D_gauss ot/datasets.py ran MIT (permissive) · e43f1efd614077e6 · report fixture: signature n:int/0/int, m:float/0/float, s:float/0/float · returned ndarray · level recorded 2026-09-25
setup in 24 papers benchmarks/emd.py ran MIT (permissive) · 3cfb9f78cee8fd33 · report fixture: signature n_samples:int/0/int · returned tuple · level recorded 2026-09-25
setup in 24 papers benchmarks/sinkhorn_knopp.py ran MIT (permissive) · e3babe388a4f4b1a · report fixture: signature n_samples:int/0/int · returned tuple · level recorded 2026-09-25
bures_wasserstein_mapping ot/gaussian.py unverified MIT (permissive) · 8a32949258519378 · report
bures_wasserstein_mapping_hd ot/gaussian.py unverified MIT (permissive) · bc8de67925b50231 · report
co_optimal_transport ot/coot.py unverified MIT (permissive) · 69c475a756b4c16d · report
co_optimal_transport2 ot/coot.py unverified MIT (permissive) · 58fcb1243e9431e8 · report
emd_laplace ot/da.py unverified MIT (permissive) · 73765b4368a7da60 · report
empirical_bures_wasserstein_mapping ot/gaussian.py unverified MIT (permissive) · 0644908f11a7d16f · report
empirical_sinkhorn2_geomloss ot/bregman/_geomloss.py unverified MIT (permissive) · 1b4a33bceedbe219 · report
exec_bench benchmarks/benchmark.py unverified MIT (permissive) · 83cc6adc356e85a7 · report
factored_optimal_transport ot/factored.py unverified MIT (permissive) · 06c779d1369d447e · report
gaussian_logpdf ot/gmm.py unverified MIT (permissive) · 5b25f9eee280604c · report
gaussian_pdf in 5 papers ot/gmm.py unverified MIT (permissive) · c17b059ab990ed05 · report
get_sinkhorn_geomloss_lazytensor ot/bregman/_geomloss.py unverified MIT (permissive) · fbf86f3cc43ee048 · report
gmm_pdf ot/gmm.py unverified MIT (permissive) · f707d7f51ef8cb3b · report
make_2D_samples_gauss ot/datasets.py unverified MIT (permissive) · 8d98a43cb6bd2036 · report
sinkhorn_l1l2_gl ot/da.py unverified MIT (permissive) · a41e53894dc65ebb · report
sinkhorn_lpl1_mm ot/da.py unverified MIT (permissive) · 2a7422ba1267f3f3 · report
lchapel/partial-GW-for-PU community (archive-listed) 2 samples, 1 ran (1 instrument-failed) · 1 unverified
compute_cost_matrices partial_gw.py ran · our draft was wrong no licence file found · pointer only · 8b32cc7700975e3c · report fixture: signature P:DataFrame/0/?, U:DataFrame/0/?, prior:float/0/float, nb_dummies:int/0/int · returned tuple · level recorded 2026-09-22
gwgrad partial_gw.py unverified no licence file found · pointer only · 147fd80456b80804 · report
thibsej/unbalanced_gromov_wasserstein community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
euclid_dist experiments_pu/compute_prediction.py ran · honoured contract fingerprinted MIT (permissive) · 475cc1bb2182df28 · report fixture: signature x:Tensor/2/float, y:Tensor/2/float · returned Tensor · level recorded 2026-09-22

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