Code for Optimal Transport for structured data with application on graphs
☆107Dec 17, 2022Updated 3 years ago
Alternatives and similar repositories for FGW
Users that are interested in FGW are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Code for Sliced Gromov-Wasserstein☆70Dec 2, 2019Updated 6 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Jun 14, 2019Updated 7 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆44Nov 17, 2023Updated 2 years ago
- POT : Python Optimal Transport☆2,822Updated this week
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆49Mar 13, 2023Updated 3 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆77Aug 20, 2019Updated 6 years ago
- Official repository of "Minibatch optimal transport distances; analysis and applications" (https://arxiv.org/pdf/2101.01792.pdf)☆10Oct 15, 2021Updated 4 years ago
- ☆13May 16, 2018Updated 8 years ago
- Code for ICML 2020 "Graph Optimal Transport for Cross-Domain Alignment"☆164Jul 24, 2020Updated 5 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Dec 8, 2022Updated 3 years ago
- CO-Optimal Transport☆41Nov 6, 2020Updated 5 years ago
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆81Jan 25, 2024Updated 2 years ago
- ☆17Oct 22, 2020Updated 5 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- ☆10Jun 22, 2022Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Jan 22, 2021Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆46Sep 15, 2019Updated 6 years ago
- ☆16Sep 2, 2020Updated 5 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆24Nov 18, 2019Updated 6 years ago
- Order-preserving Optimal Transport for Distances between Sequences☆30Oct 4, 2018Updated 7 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- Python numerical optimization toolbox☆12Nov 20, 2018Updated 7 years ago
- PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)☆67Feb 3, 2023Updated 3 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- ☆13Feb 4, 2025Updated last year
- Keras implementation of Deep Wasserstein Embeddings☆48Apr 15, 2018Updated 8 years ago
- Code repository for the paper "DeepPermNet: Visual Permutation Learning".☆20Oct 6, 2017Updated 8 years ago
- Implementation of the iPiano algorithm for non-convex and non-smooth optimization as described in [1].☆12Nov 28, 2018Updated 7 years ago
- Python implementation of smooth optimal transport.☆60May 5, 2021Updated 5 years ago
- ☆28Dec 5, 2019Updated 6 years ago
- Code for NeurIPS 2019 paper "Hierarchical Optimal Transport for Document Representation"☆54Jan 22, 2020Updated 6 years ago
- Graph Metric Learning in PyTorch☆10Apr 7, 2021Updated 5 years ago
- implements optimal transport algorithms in pytorch☆106May 15, 2022Updated 4 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆30Jan 4, 2018Updated 8 years ago
- code for paper "Improving Sequence-to-Sequence Learning via Optimal Transport"☆68Jun 24, 2019Updated 7 years ago
- NRPSpredictor2 is a program to predict the specificity of bacterial and fungal adenylation domains.☆11Oct 7, 2019Updated 6 years ago
- ☆18Jul 19, 2022Updated 3 years ago
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆19Apr 26, 2023Updated 3 years ago
- Pytorch implementation of "Entropic Neural Optimal Transport via Diffusion Processes" (NeurIPS 2023, oral).☆43Mar 11, 2024Updated 2 years ago
- AMI Meeting Parallel Corpus☆13Dec 11, 2020Updated 5 years ago