POT : Python Optimal Transport
-
Updated
Jun 22, 2024 - Python
POT : Python Optimal Transport
Code for our TMLR '24 Journal: MMD-Regularized UOT.
Optimal transport algorithms for Julia
Improving word mover’s distance by leveraging self-attention matrix
Implementation and results from "Beyond GOTEX: Using Multiple Feature Detectors for Better Texture Synthesis"
A materials discovery algorithm geared towards exploring high-performance candidates in new chemical spaces.
A Python implementation of Monge optimal transportation
Tensorflow Implementation of Stochastic Wasserstein Autoencoder for Probabilistic Sentence Generation (NAACL 2019).
Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".
Julia interface for the Python Optimal Transport (POT) library
Code for "Fixed Support Tree-Sliced Wasserstein Barycenter"
Optimal transport for comparing short brain connectivity between individuals | Optimal transport | Wasserstein distance | Barycenter | K-medoids | Isomap| Sulcus | Brain
Pytorch Implementation for Topic Modeling with Wasserstein Autoencoders
Sparse simplex projection-based Wasserstein k-means
Employing Optimal Transport metrics for Point Cloud Registration
TensorFlow implementation of Wasserstein GAN (WGAN) with MNIST dataset.
The Wasserstein Distance and Optimal Transport Map of Gaussian Processes
Source code for "Training Generative Adversarial Networks Via Turing Test".
Generating Atari Images with WGANs in PyTorch
Add a description, image, and links to the wasserstein topic page so that developers can more easily learn about it.
To associate your repository with the wasserstein topic, visit your repo's landing page and select "manage topics."