← All concepts

optimal transport

Imagine you have two piles of dirt and want to reshape one into the other with minimal effort. Optimal transport is the mathematical way to find the cheapest plan for moving each grain, where "cost" is usually distance. It tells you exactly how much of each source point should go to each target point, and the minimal total cost is called the Wasserstein distance.

The papers show optimal transport is a versatile tool beyond earth moving. They use it to align different data types with few examples, to couple random samples more effectively during training, to reformulate robust optimization as a transport problem, to estimate how noisy each human preference is, and even to repair hallucinated features in vision-language models. In each case, enforcing or approximating optimal transport's structure, like monotone assignments or entropy-regularized matching, improves performance, robustness, or data efficiency.

Papers
5
Released code
0
First seen
Oct 2026
Latest
Oct 2026

5 papers in the last two months, against 0 in the two before.

Start here

Three papers to read first, in the order they came out
  1. 1Optimal transport aligns pretrained modalities with only hundreds of paired anchors

    Aligning two frozen unimodal encoders requires only 100 to 500 paired anchors when anchor-relative coordinates, entropic optimal transport, and distillation are combined.

    Oct 2026
  2. 2Larger optimal transport batches make flow matching more stable

    Larger online entropic OT minibatches reduce gradient variance and integration error in flow matching.

    Oct 2026
  3. 3A few clean labels can fix sample-wise noise in reward model training

    Reward models trained on noisy human feedback can be made unbiased by calibrating sample-wise noise with a few clean labels via optimal transport.

    Oct 2026

The papers

Most central to this idea first, not most recent.

Concepts are extracted from each paper and reused across the corpus, so this page grows on its own as the desk reads.