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☆70Sep 23, 2021Updated 4 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
- Code for ICML 2020 "Graph Optimal Transport for Cross-Domain Alignment"☆164Jul 24, 2020Updated 6 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
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆16Jun 13, 2020Updated 6 years ago
- "Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport" in ICDE 2023☆18Oct 23, 2023Updated 2 years ago
- ☆21Mar 3, 2025Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Jan 22, 2021Updated 5 years ago
- Code for Optimal Transport for structured data with application on graphs☆110Dec 17, 2022Updated 3 years ago
- ☆13Mar 26, 2019Updated 7 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Apr 26, 2023Updated 3 years ago
- A Python implementation of Monge optimal transportation☆50Oct 2, 2023Updated 2 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆50Mar 13, 2023Updated 3 years ago
- 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
- ☆17Oct 22, 2020Updated 5 years ago
- ☆13May 16, 2018Updated 8 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- ☆20Apr 25, 2021Updated 5 years ago
- ☆12May 31, 2021Updated 5 years ago
- implements optimal transport algorithms in pytorch☆106May 15, 2022Updated 4 years ago
- ☆12Jan 29, 2022Updated 4 years ago
- Implementation of the Gumbel-Sigmoid distribution in PyTorch.☆20Jul 22, 2022Updated 4 years ago
- ☆19Nov 28, 2020Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Jun 14, 2019Updated 7 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
- 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 the paper: On Symmetric Losses for Learning from Corrupted Labels☆19May 11, 2019Updated 7 years ago
- Official implementation for SPA: A Graph Spectral Alignment Perspective for Domain Adaptation (NeurIPS 2023)☆18Dec 21, 2023Updated 2 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 last month
- Learned string similarity for entity names using optimal transport.☆35Nov 17, 2020Updated 5 years ago
- A toolbox for sparse contrastive principal component analysis☆12Feb 10, 2025Updated last year
- ☆18Jul 19, 2022Updated 4 years ago