Optimal transport algorithms for Julia
-
Updated
May 7, 2024 - Julia
Optimal transport algorithms for Julia
Pseudo-labeling for tabular data
The implementation for the paper "On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm".
Sparse simplex projection-based Wasserstein k-means
🦆 A simple sinkhorn algorithm to solve optimal transport problem writen in Matlab
Python Implementation of "Fast Computation of Wasserstein Barycenters"
Code for "A MFG Model for the Dynamics of Cities" (Barilla, Carlier, Lasry 2021)
[ICML 2023] Official code for our paper: 'Conditional Tree Matching for Inference-Time Adaptation of Tree Prediction Models'
Crowd Counting: A view around state-of-the-art
Python translation of Cuturi's MATLAB code for Sinkhorn Optimal Transport.
Computational optimal transport
Add a description, image, and links to the sinkhorn-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the sinkhorn-algorithm topic, visit your repo's landing page and select "manage topics."