Papers › Improving Mini-batch Optimal Transport via Partial Transportation

Improving Mini-batch Optimal Transport via Partial Transportation

22 Aug 2021arXiv:2108.09645archive 2025-07-28

Khai Nguyen, Dang Nguyen, The-Anh Vu-Le, Tung Pham, Nhat Ho

Mini-batch optimal transport (m-OT) has been widely used recently to deal with the memory issue of OT in large-scale applications. Despite their practicality, m-OT suffers from misspecified mappings, namely, mappings that are optimal on the mini-batch level but are partially wrong in the comparison with the optimal transportation plan between the original measures. Motivated by the misspecified mappings issue, we propose a novel mini-batch method by using partial optimal transport (POT) between mini-batch empirical measures, which we refer to as mini-batch partial optimal transport (m-POT). Leveraging the insight from the partial transportation, we explain the source of misspecified mappings from the m-OT and motivate why limiting the amount of transported masses among mini-batches via POT can alleviate the incorrect mappings. Finally, we carry out extensive experiments on various applications such as deep domain adaptation, partial domain adaptation, deep generative model, color transfer, and gradient flow to demonstrate the favorable performance of m-POT compared to current mini-batch methods.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

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.

Syntology holds a reference implementation of mini-batch partial optimal transport (m-POT), generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='mini-batch partial optimal transport (m-POT)') (how to connect); the free check have('2108.09645') needs no token.

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

Code

Syntology 11 code samples: 10 from 2 repositories linked to this paper, 1 identical to code harvested from another paper's repository. Across all 11: 7 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified. Where Syntology's instrument failed: 4 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 10 samples from 2 repositories, 7 ran (3 with no instrument failure; 4 where Syntology's instrument failed); 1 identical to code first harvested elsewhere. 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-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

ut-austin-data-science-group/mini-batch-ot officialmentioned in papermentioned on GitHubpytorchSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report
khainb/BoMb-OT officialmentioned on GitHubpytorchSyntology: 9 samples, 6 ran (3 instrument-failed) · 3 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

11 samples harvested: 7 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 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.

4ran · our draft was wrong
3ran
4unverified

Licence: 1 of the 11 samples is 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 2 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. 1 sample is listed last, in a group without a repository. “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.

ut-austin-data-science-group/mini-batch-ot official repository 1 sample, 1 ran (1 instrument-failed) · 0 unverified
BoMbOT ABC/utils.py ran · our draft was wrong MIT (permissive) · 4e7fbdb2bc8ec056 · report fixture: signature x:ndarray/2/float, y:ndarray/2/float, k:int/0/int, m:int/0/int · returned float64 · level recorded 2026-09-22
khainb/BoMb-OT official repository 9 samples, 6 ran (3 instrument-failed) · 3 unverified
BalancedBatchSampler PartialDA/run_mOT.py ran MIT (permissive) · a2d1ed9ac5b514b0 · report fixture: returned BalancedBatchSampler · level recorded 2026-09-22
ImageList PartialDA/run_mOT.py ran MIT (permissive) · 76825d32647cb3ce · report fixture: returned ImageList · level recorded 2026-09-22
InfiniteSliceIterator PartialDA/run_mOT.py ran MIT (permissive) · 978e1da65a934d3a · report fixture: returned InfiniteSliceIterator · level recorded 2026-09-22
image_test in 9 papers PartialDA/run_mOT.py ran · our draft was wrong MIT (permissive) · 60166088c825b407 · report fixture: signature resize_size:int/0/int, crop_size:int/0/int · returned Compose · level recorded 2026-09-22
image_train in 18 papers PartialDA/run_mOT.py ran · our draft was wrong MIT (permissive) · 6d14e3fcb8d93fa1 · report fixture: signature resize_size:int/0/int, crop_size:int/0/int · returned Compose · level recorded 2026-09-22
inv_lr_scheduler in 11 papers PartialDA/run_mOT.py ran · our draft was wrong MIT (permissive) · 693fef7015113684 · report fixture: signature optimizer:SGD/0/?, iter_num:int/0/int, gamma:float/0/float, power:float/0/float, lr:float/0/float, weight_decay:float/0/float · returned SGD · level recorded 2026-09-22
ResNetFc PartialDA/run_mOT.py unverified MIT (permissive) · 4fde4b15ac469854 · report
VGGFc PartialDA/run_mOT.py unverified MIT (permissive) · 0fa0506a51ba91fa · report
train in 522 papers PartialDA/run_mOT.py unverified MIT (permissive) · 4ecaced2e83b4ff1 · report
Repository not located 1 sample, 0 ran · 1 unverified
1 sample is identical to code Syntology harvested from another paper's repository; this paper's own copy was not located, so no repository is named and no licence is recorded.
image_classification repository not located unverified licence of this copy not recorded · b42e76c69ec6ec9c · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another. Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

3 assemblies on this paper: 2 harvested, 1 generated, listed in 2 groups (siblings lifted in one batch form one group).

generated Assembly for mini-batch partial optimal transport (m-POT) (graph method: mini-batch partial optimal transport (m-POT)), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 6 property tests passed on both).

label matches by construction: the code was generated for this method (not judged by a model)

  1. compute_ot_loss_from_plan entry · level 3 · ran · honoured contract · 8bc96396361d2fecef60d3945e547dd9fb3ecb26a81743aad075ae1c56802657

2 sibling assemblies for mini-batch partial optimal transport (m-POT) (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for mini-batch partial optimal transport (m-POT) (graph method: mini-batch partial optimal transport (m-POT)). 14 bricks; individually on a fixture: 8 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. train entry · level 0 · unverified · 4ecaced2e83b4ff1
  2. BalancedBatchSampler helper · level 1 · ran · a2d1ed9ac5b514b0
  3. ImageList helper · level 1 · ran · 76825d32647cb3ce
  4. ResNetFc helper · level 0 · unverified · 4fde4b15ac469854
  5. VGGFc helper · level 0 · unverified · 0fa0506a51ba91fa
  6. image_classification helper · level 0 · unverified · b42e76c69ec6ec9c
  7. image_test data_transform · level 1 · ran · our draft was wrong · 60166088c825b407
  8. image_train data_transform · level 1 · ran · our draft was wrong · 6d14e3fcb8d93fa1
  9. InfiniteSliceIterator helper · level 1 · ran · 978e1da65a934d3a
  10. l_loader helper · level 1 · ran · honoured contract · edd7184ac144c4fa
  11. make_dataset helper · level 0 · unverified · 2301055cb33836bc
  12. rgb_loader helper · level 1 · ran · honoured contract · 2c5ce24ea2b5d2a4
  13. init_weights helper · level 0 · unverified · 7babf7ea472eba97
  14. inv_lr_scheduler helper · level 1 · ran · our draft was wrong · 693fef7015113684

harvested Assembly for mini-batch partial optimal transport (m-POT) (graph method: mini-batch partial optimal transport (m-POT)). 1 brick; individually on a fixture: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 2 siblings

  1. BoMbOT entry · level 1 · ran · our draft was wrong · 4e7fbdb2bc8ec056

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2108.09645") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Domain AdaptationPartial Domain Adaptation

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