awesome-optimal-transport
github.com/kilianfatras/awesome-optimal-transport ↗A list of awesome papers and cool resources on optimal transport and its applications in general! As you will notice, this list is currently mostly focused on optimal transport for machine learning topics.
246
GitHub Stars
67
Curated Resources
7
Categories
3 hours ago
Last Refreshed
Fast approximation Optimal TransportRelaxed Optimal TransportCurse of dimensionWasserstein barycentersGenerative modelsDomain adaptationAdversarial robustness
Use this list with your AI agent
Add the Context Awesome MCP server to Claude, Cursor, or any MCP client, then ask:
"Show me regularized optimal transport resources from awesome-optimal-transport"
Installation instructions →What's inside
Resources
Wasserstein barycenters
- Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters
- Fast Computation of Wasserstein Barycenters
- Improved Complexity Bounds in Wasserstein Barycenter Problem
- On the Complexity of Approximating Wasserstein Barycenters
- Parallel Streaming Wasserstein Barycenters
- Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm
Domain adaptation
- DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation
Code
- Differentially Private Optimal Transport: Application to Domain Adaptation
- Joint distribution optimal transportation for domain adaptation
Code
- Joint Partial Optimal Transport for Open Set Domain Adaptation
- Margin-aware Adversarial Domain Adaptation with Optimal Transport
- Optimal Transport for Domain Adaptation
Fast approximation Optimal Transport
- Differential Properties of Sinkhorn Approximation for Learning with Wasserstein DistanceRegularized Optimal Transport
- Distributional Sliced-Wasserstein and Applications to Generative ModelingSliced Optimal Transport
- Generalized Sliced Wasserstein DistancesSliced Optimal Transport
- Hierarchical Optimal Transport for Multimodal Distribution AlignmentApproximating Optimal Transport
- Interpolating between Optimal Transport and MMD using Sinkhorn DivergencesRegularized Optimal Transport
Code
- Learning with minibatch Wasserstein : asymptotic and gradient propertiesApproximating Optimal Transport
Code
Generative models
- Disentangled Recurrent Wasserstein Autoencoder
- Learning Generative Models across Incomparable Spaces
Code
- Learning Generative Models with Sinkhorn Divergences
- OT-GAN: Improving GANs Using Optimal Transport
Code
- Sliced-Wasserstein Flows: Nonparametric Generative Modeling via Optimal Transport and Diffusions
Code
- Sliced Wasserstein Generative Models
Curse of dimension
- Gaussian-Smoothed Optimal Transport: Metric Structure and Statistical Efficiency
- Sample Complexity of Sinkhorn Divergences
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
- Subspace Detours: Building Transport Plans that are Optimal on Subspace Projections
- Subspace Robust Wasserstein Distances
Code
Relaxed Optimal Transport
- On Unbalanced Optimal Transport: An Analysis of Sinkhorn AlgorithmUnbalanced and Partial Optimal Transport
- Partial Gromov-Wasserstein with applications on Positive-Unlabeled LearningUnbalanced and Partial Optimal Transport
Code
- Robust Optimal Transport with Applications in Generative Modeling and Domain AdaptationRobust Optimal Transport
Code
- Scaling Algorithms for Unbalanced Transport ProblemsUnbalanced and Partial Optimal Transport
- Unbalanced Optimal Transport: Dynamic and Kantorovich formulationsUnbalanced and Partial Optimal Transport
Code
- When OT meets MoM: Robust estimation of Wasserstein DistanceRobust Optimal Transport
Showing a sample of 67 resources. View the full list on GitHub →