PythonOT / COOTLinks
CO-Optimal Transport
☆42Updated 4 years ago
Alternatives and similar repositories for COOT
Users that are interested in COOT are comparing it to the libraries listed below
Sorting:
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Learning the optimal transport map via input convex neural neworks☆42Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆38Updated 8 months ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 4 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"☆25Updated 5 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 6 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆42Updated 3 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆16Updated 2 years ago
- ☆17Updated 2 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆23Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- GitHub repository for the ICLR Computational Geometry & Topology Challenge 2021☆51Updated 2 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆41Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Learning generative models with Sinkhorn Loss☆30Updated 6 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).☆21Updated 11 months ago
- A Pytorch implementation of the optimal transport kernel embedding☆117Updated 4 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆16Updated 4 years ago
- Official implementation of "Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks", NeurIPS 2021.☆30Updated 4 months ago
- Official PyTorch implementation of 🏁 MFCVAE 🏁: "Multi-Facet Clustering Variatonal Autoencoders (MFCVAE)" (NeurIPS 2021). A class of var…☆40Updated last year
- ☆17Updated 3 years ago
- Robust Optimal Transport code☆43Updated 2 years ago
- Spatio-temporal alignements: Optimal transport in space and time☆47Updated 3 months ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆56Updated 6 years ago