SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2407.14957 · ICML · 2024

Strongly Isomorphic Neural Optimal Transport Across Incomparable Spaces

David Alvarez-Melis, Athina Sotiropoulou

arXiv · PDF · Open in the Atlas

Code that ran

None of the 4 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (4 no recorded run), measured 2026-11-22; 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/2407.14957.json · badge: /api/ran/2407.14957.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
ott-jax/ott community
Papers with Code archive
0 ran · 4 no recorded run
FunctionStatusWhere it lives
BasePotential Not yet run
unverified (harvested, no recorded run)
ott-jax/ott/src/ott/neural/methods/conditional_monge_gap.py
code served (permissive licence) · get_code("e89b3e3a85ceaf8d")
How it ran

no invocation recorded.

ConditionalMongeGapEstimator Not yet run
unverified (harvested, no recorded run)
ott-jax/ott/src/ott/neural/methods/conditional_monge_gap.py
code served (permissive licence) · get_code("fe1e52b46badb38e")
How it ran

no invocation recorded.

ConditionalPerturbationNetwork Not yet run
unverified (harvested, no recorded run)
ott-jax/ott/src/ott/neural/methods/conditional_monge_gap.py
code served (permissive licence) · get_code("e6b5c9908b8c4c5e")
How it ran

no invocation recorded.

PotentialTrainState Not yet run
unverified (harvested, no recorded run)
ott-jax/ott/src/ott/neural/methods/conditional_monge_gap.py
code served (permissive licence) · get_code("7b5af0a497d4701c")
How it ran

no invocation recorded.

Also present in other papers' code

Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 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 4 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) has recently emerged as a powerful framework for learning minimaldisplacement maps between distributions. The predominant approach involves a neural parametrization of the Monge formulation of OT, typically assuming the same space for both distributions. However, the setting across "incomparable spaces" (e.g., of different dimensionality), corresponding to the Gromov-Wasserstein distance, remains underexplored, with existing methods often imposing restrictive assumptions on the cost function. In this paper, we present a novel neural formulation of the Gromov-Monge (GM) problem rooted in one of its fundamental properties: invariance to strong isomorphisms. We operationalize this property by decomposing the learnable OT map into two components: (i) an approximate strong isomorphism between the source distribution and an intermediate reference distribution, and (ii) a GM-optimal map between this reference and the target distribution. Our formulation leverages and extends the Monge gap regularizer of Uscidda & Cuturi (2023) to eliminate the need for complex architectural requirements of other neural OT methods, yielding a simple but practical method that enjoys favorable theoretical guarantees. Our preliminary empirical results show that our framework provides a promising approach to learn OT maps across diverse spaces.

For agents

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

get_harvested_code_for_paper("2407.14957")
get_code_for_paper("2407.14957")
have("2407.14957")

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

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

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

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

Connect an agent — have() is free.