SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2010.05862 · NeurIPS · 2020

Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptation

Soheil Feizi, Yogesh Balaji, Rama Chellappa

arXiv · PDF · Open in the Atlas

Code that ran

3 of 6 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 2 have no contract verdict; 1 failure of our instrument; 3 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2010.05862.json · badge: /api/ran/2010.05862.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
kheyer/OTDD community
Papers with Code archive
2 ran · 1 no recorded run
yogeshbalaji/robustOT marked official in Papers with Code
Papers with Code archive
1 ran · 2 no recorded run
FunctionStatusWhere it lives
CostFunction Ran
ran on a synthesized input · constructed an object; no result was computed
kheyer/OTDD/OTDD/otdd.py
pointer only (licence: NONE) · get_code("cf9913d615a39e58")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, kheyer/OTDD when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

ROTSolver Ran
ran on a synthesized input
yogeshbalaji/robustOT/discrete_distributions/solvers/ROT.py
pointer only (licence: NONE) · get_code("3d9fe47c4edabc35")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, yogeshbalaji/robustOT when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_class_matrix Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
kheyer/OTDD/OTDD/otdd.py
pointer only (licence: NONE) · get_code("5dcc11c88abe2da5")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, kheyer/OTDD when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

RobustOTCost Not yet run
unverified (harvested, no recorded run)
kheyer/OTDD/OTDD/otdd.py
pointer only (licence: NONE) · get_code("1c8f766a38067582")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, kheyer/OTDD when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

generate_scatter_plots Not yet run
unverified (harvested, no recorded run)
yogeshbalaji/robustOT/discrete_distributions/solvers/ROT.py
pointer only (licence: NONE) · get_code("d4bc92bd4b4943bd")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, yogeshbalaji/robustOT when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

generate_scatter_plots_with_coupling Not yet run
unverified (harvested, no recorded run)
yogeshbalaji/robustOT/discrete_distributions/solvers/ROT.py
pointer only (licence: NONE) · get_code("f6cbece1ae89dfac")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, yogeshbalaji/robustOT when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 6 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Optimal Transport (OT) distances such as Wasserstein have been used in several areas such as GANs and domain adaptation. OT, however, is very sensitive to outliers (samples with large noise) in the data since in its objective function, every sample, including outliers, is weighed similarly due to the marginal constraints. To remedy this issue, robust formulations of OT with unbalanced marginal constraints have previously been proposed. However, employing these methods in deep learning problems such as GANs and domain adaptation is challenging due to the instability of their dual optimization solvers. In this paper, we resolve these issues by deriving a computationally-efficient dual form of the robust OT optimization that is amenable to modern deep learning applications. We demonstrate the effectiveness of our formulation in two applications of GANs and domain adaptation. Our approach can train state-of-the-art GAN models on noisy datasets corrupted with outlier distributions. In particular, our optimization computes weights for training samples reflecting how difficult it is for those samples to be generated in the model. In domain adaptation, our robust OT formulation leads to improved accuracy compared to the standard adversarial adaptation methods. Our code is available at https://github.com/yogeshbalaji/robustOT. The OT sensitivity to outliers is undesirable, especially when we deal with large-scale datasets where the noise is inevitable. This sensitivity is a consequence of exactly satisfying the marginal constraints in OT's objective. Hence, to boost OT's robustness against outliers, we propose to utilize recent formulations of unbalanced optimal transport [6, 13] which relax OT's marginal constraints. The authors in [6,13] provide an exact dual form for the unbalanced OT problem. However, we have found that using this dual optimization in large-scale deep learning applications such as GANs results in poor convergence and an unstable behaviour (see Section 3.1 and the appendix for details). To remedy this issue, in this work, we derive a computationally efficient dual form for the unbalanced OT optimization that is suited for practical deep learning applications. Our dual simplifies to a weighted OT objective, with low weights assigned to outlier samples. These instance weights can also be useful in interpreting the difficulty of input samples for learning a given task. We develop two solvers for this dual problem based on either a discrete formulation or a continuous stochastic relaxation. These solvers demonstrate high stability in large-scale deep learning applications. We show that, under mild assumptions, our robust OT measure (which is similar in form to the unbalanced OT) is upper bounded by a constant factor of the true OT distance (OT ignoring outliers) for any outlier distribution. Hence, our robust OT can be used for effectively handling outliers. This is visualized in Figure 1(c), where couplings obtained by robust OT effectively ignores outlier samples, yielding a good estimate of the true OT distance. We demonstrate the effectiveness of the proposed robust OT formulation in two large-scale deep learning applications of generative modeling and domain adaptation. In generative modeling, we show how robust Wasserstein GANs can be trained using state-of-the-art GAN architectures to effectively ignore outliers in the generative distrubution. In domain adaptation, we utilize the robust OT framework for the challenging task of synthetic to real adaptation, where our approach improves adversarial adaptation techniques by ∼ 5%.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2010.05862")
get_code_for_paper("2010.05862")
have("2010.05862")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2010.05862.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2010.05862.svg)](https://syntology.ai/paper/2010.05862)

Connect an agent — have() is free.