Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
☆44Sep 15, 2019Updated 6 years ago
Alternatives and similar repositories for s-gwl
Users that are interested in s-gwl are comparing it to the libraries listed below
Sorting:
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆73Aug 20, 2019Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Dec 8, 2022Updated 3 years ago
- Code for Online Graph Dictionary Learning☆18Mar 1, 2022Updated 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 2 years ago
- Official implementation of Joint Multidimensional Scaling☆24Nov 19, 2023Updated 2 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Nov 1, 2022Updated 3 years ago
- Scalable framework for comparing metric measure spaces with up to 1M points.☆16Apr 6, 2021Updated 4 years ago
- CO-Optimal Transport☆42Nov 6, 2020Updated 5 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☆15Jun 13, 2020Updated 5 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Apr 26, 2023Updated 2 years ago
- Gromov-Wasserstein Alignment of Embeddings☆68Sep 23, 2021Updated 4 years ago
- ☆18Jul 19, 2022Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆69Dec 2, 2019Updated 6 years ago
- Entropic Optimal Transport Benchmark (NeurIPS 2023).☆31Mar 21, 2024Updated last year
- Clustering using Deep Learning (T-SNE visualization of autoencoder embeddings )☆10Mar 3, 2019Updated 7 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Mar 13, 2023Updated 2 years ago
- ☆43Feb 21, 2020Updated 6 years ago
- [Neurips 2025] Official Implementation of ConfRover models☆20Feb 3, 2026Updated last month
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆78Jan 25, 2024Updated 2 years ago
- Imputation of single cell RNA-sequencing data with autoencoder☆16Jun 23, 2021Updated 4 years ago
- A repository housing metadata and data files (or links to data files) that are being prepared as sample data bundles for various uses.☆13Feb 12, 2022Updated 4 years ago
- Learnable Global Pooling Layers Based on Regularized Optimal Transport (ROT)☆16Mar 17, 2024Updated last year
- The official implementation of "Test-time Adaptation for Regression by Subspace Alignment" (ICLR 2025).☆15Jun 6, 2025Updated 9 months ago
- Code for ICML 2020 "Graph Optimal Transport for Cross-Domain Alignment"☆161Jul 24, 2020Updated 5 years ago
- ☆12Jan 29, 2022Updated 4 years ago
- Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"☆14Feb 24, 2026Updated last week
- single-cell RNA-seq clustering☆10Sep 14, 2020Updated 5 years ago
- ☆12Jul 25, 2024Updated last year
- Python implementation of the supervised graph prediction method proposed in http://arxiv.org/abs/2202.03813 using PyTorch library and POT…☆16Feb 25, 2022Updated 4 years ago
- ☆17Oct 22, 2020Updated 5 years ago
- ☆15Feb 5, 2024Updated 2 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- Wasserstein regularization for sparse multi-task regression☆15Jul 26, 2020Updated 5 years ago
- ☆13May 16, 2018Updated 7 years ago
- Library of python functions for the analysis of hypergraphs.☆15Feb 1, 2025Updated last year
- Pytorch implementation of "Entropic Neural Optimal Transport via Diffusion Processes" (NeurIPS 2023, oral).☆43Mar 11, 2024Updated last year
- Code for Optimal Transport for structured data with application on graphs☆104Dec 17, 2022Updated 3 years ago
- Scripts for data and figure generation in SAVER paper☆17Jan 5, 2021Updated 5 years ago