Gromov-Wasserstein Learning for Graph Matching and Node Embedding
☆77Aug 20, 2019Updated 6 years ago
Alternatives and similar repositories for gwl
Users that are interested in gwl are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆46Sep 15, 2019Updated 6 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- Gromov-Wasserstein Alignment of Embeddings☆69Sep 23, 2021Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆70Dec 2, 2019Updated 6 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.
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆76Aug 21, 2016Updated 9 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Dec 8, 2022Updated 3 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆16Jun 13, 2020Updated 6 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆44Nov 17, 2023Updated 2 years ago
- ☆21Mar 3, 2025Updated last year
- Code for Optimal Transport for structured data with application on graphs☆109Dec 17, 2022Updated 3 years ago
- ☆13Mar 26, 2019Updated 7 years ago
- A Python implementation of Monge optimal transportation☆50Oct 2, 2023Updated 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
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆82Jan 25, 2024Updated 2 years ago
- [PAKDD2023] Improving Knowledge Graph Entity Alignment with Graph Augmentation☆12Nov 16, 2023Updated 2 years ago
- Official implementation of Joint Multidimensional Scaling☆24Nov 19, 2023Updated 2 years ago
- Wasserstein Distance Graph Alignment☆23Feb 9, 2021Updated 5 years ago
- ☆14Apr 16, 2024Updated 2 years ago
- ☆13May 16, 2018Updated 8 years ago
- ☆20Apr 25, 2021Updated 5 years ago
- ☆12May 31, 2021Updated 5 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.
- implements optimal transport algorithms in pytorch☆106May 15, 2022Updated 4 years ago
- Multi-Graph Multi-Label Learning☆11May 30, 2018Updated 8 years ago
- ☆19Nov 28, 2020Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Jun 14, 2019Updated 7 years ago
- Representation learning-based graph alignment based on implicit matrix factorization and structural embeddings☆97Mar 30, 2021Updated 5 years ago
- A clustering algorithm that can perform internal validation inspired by forest fire dynamics and self-organized criticality☆18May 18, 2022Updated 4 years ago
- Wasserstein regularization for sparse multi-task regression☆15Jul 26, 2020Updated 6 years ago
- code submission to NeurIPS2019☆13Aug 9, 2023Updated 2 years ago
- Code for the paper: On Symmetric Losses for Learning from Corrupted Labels☆19May 11, 2019Updated 7 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.
- [ICML 2024] Matrix Variational Masked Autoencoder (M-MAE) for ICML paper "Information Flow in Self-Supervised Learning" (https://arxiv.or…☆15Sep 17, 2024Updated last year
- Official implementation for SPA: A Graph Spectral Alignment Perspective for Domain Adaptation (NeurIPS 2023)☆18Dec 21, 2023Updated 2 years ago
- Repository for our paper: Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers☆88Jan 11, 2021Updated 5 years ago
- Implementation of "Deep Graph Matching Consensus" in PyTorch☆273Sep 22, 2021Updated 4 years ago
- Cross Entropy Low-rank Logits for graph generation.☆19Jun 30, 2026Updated 3 weeks ago
- ☆11Dec 1, 2020Updated 5 years ago
- POT : Python Optimal Transport☆2,827Jul 7, 2026Updated 3 weeks ago