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:
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- 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☆41Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆38Updated 9 months ago
- ☆17Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"☆25Updated 5 years ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 4 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Code for "Disentangling images with Lie group transformations and sparse coding" (2023).☆13Updated 4 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆56Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 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
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆42Updated 2 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).☆21Updated 11 months ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆16Updated 2 years ago
- A Pytorch implementation of the optimal transport kernel embedding☆117Updated 4 years ago
- ☆17Updated 3 years ago
- Python implementation of smooth optimal transport.☆60Updated 4 years ago
- The repository for Hyperbolic Representation Learning for Computer Vision, ECCV 2022☆64Updated 2 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆56Updated 6 years ago
- Learning generative models with Sinkhorn Loss☆30Updated 6 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆24Updated 3 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Embedding graphs in symmetric spaces☆30Updated 3 years ago