Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
☆44Nov 17, 2023Updated 2 years ago
Alternatives and similar repositories for GOT
Users that are interested in GOT 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 accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Dec 8, 2022Updated 3 years ago
- Code for SGDD☆26Oct 19, 2023Updated 2 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆17Dec 22, 2020Updated 5 years ago
- ☆13May 16, 2018Updated 8 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
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- A list of awesome papers and cool resources on optimal transport and its applications in general! As you will notice, this list is curren…☆246May 9, 2021Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆76Aug 20, 2019Updated 6 years ago
- Code for Online Graph Dictionary Learning☆18Mar 1, 2022Updated 4 years ago
- Official codebase for paper Disentangled Condensation for Graphs (DisCo). This codebase is based on the open-source Pytorch Geometric fra…☆11Feb 12, 2025Updated last year
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆45Sep 15, 2019Updated 6 years ago
- ☆10Nov 15, 2024Updated last year
- Source code of GResNet☆17Sep 16, 2020Updated 5 years ago
- "Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport" in ICDE 2023☆18Oct 23, 2023Updated 2 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Mastodon server running for the Doubanius Tertius project☆10Apr 4, 2022Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- Pytorch implementation of "Entropic Neural Optimal Transport via Diffusion Processes" (NeurIPS 2023, oral).☆43Mar 11, 2024Updated 2 years ago
- Implementation of FedBary☆17Mar 24, 2025Updated last year
- ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks(ICLR 2023)☆20Nov 3, 2023Updated 2 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆75Aug 21, 2016Updated 9 years ago
- ☆16Jul 6, 2023Updated 2 years ago
- Wasserstein Distance Graph Alignment☆23Feb 9, 2021Updated 5 years ago
- Implementation of Wasserstein adversarial attacks.☆24Jan 2, 2021Updated 5 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Code for "Re-evaluating Word Mover’s Distance" (ICML 2022)☆40Jun 15, 2022Updated 3 years ago
- The implementation for the paper "On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm".☆12Apr 11, 2020Updated 6 years ago
- Source code of NeurIPS 2022 paper “Co-Modality Graph Contrastive Learning for Imbalanced Node Classification”☆21Jan 15, 2023Updated 3 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆89Sep 1, 2024Updated last year
- [WWW2024 Oral] "Graph Out-of-Distribution Generalization via Causal Intervention”.☆27Oct 23, 2024Updated last year
- ESICCC: A systematic computational framework for evaluation, selection and integration of cell-cell communication inference methods☆13Jan 10, 2024Updated 2 years ago
- Implementation of the iPiano algorithm for non-convex and non-smooth optimization as described in [1].☆12Nov 28, 2018Updated 7 years ago
- Official repo and evaluation implementation of KnowRecall and VisRecall☆10May 22, 2025Updated last year
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆47Mar 13, 2023Updated 3 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Speech waveform synthesis filters☆13Jul 21, 2017Updated 8 years ago
- ☆58Sep 28, 2022Updated 3 years ago
- Code for ICML 2020 "Graph Optimal Transport for Cross-Domain Alignment"☆163Jul 24, 2020Updated 5 years ago
- ☆31Jan 29, 2024Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Jun 14, 2019Updated 6 years ago
- COmpositional Zero-Inflated Network Estimation☆11Nov 20, 2023Updated 2 years ago
- Published papers focusing on graph domain adaptation, with survey paper online as Domain Adaptation for Graph Representation Learning: Ch…☆55Apr 23, 2025Updated last year