POT : Python Optimal Transport
-
Updated
Aug 21, 2024 - Python
POT : Python Optimal Transport
"Towards Realistic Semi-Supervised Learning" by Mamshad Nayeem Rizve, Navid Kardan, Mubarak Shah (ECCV 2022)
[ICML 2023] Official code for our paper: 'Conditional Tree Matching for Inference-Time Adaptation of Tree Prediction Models'
Rust Optimal Transport solvers
A simple iterative method to approach the double stochastic matrix is to alternately rescale all rows and all columns of A to sum to 1. Both CPU and GPU parallelism is exploited.
Add a description, image, and links to the sinkhorn-knopp topic page so that developers can more easily learn about it.
To associate your repository with the sinkhorn-knopp topic, visit your repo's landing page and select "manage topics."