Optimal transport primitives: Wasserstein distance, Sinkhorn algorithm, and Sinkhorn divergences (balanced + unbalanced).
-
Updated
Jan 19, 2026 - Rust
Optimal transport primitives: Wasserstein distance, Sinkhorn algorithm, and Sinkhorn divergences (balanced + unbalanced).
anyakrakusuma is a high-performance Python solver for the 2D Schrödinger Bridge Problem via Entropic Optimal Transport (EOT), utilizing the log-domain Sinkhorn-Knopp algorithm and Numba acceleration for robust stochastic process interpolation.
Add a description, image, and links to the entropic-regularization topic page so that developers can more easily learn about it.
To associate your repository with the entropic-regularization topic, visit your repo's landing page and select "manage topics."