Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
☆46Sep 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆77Aug 20, 2019Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 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 3 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆16Jun 13, 2020Updated 6 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.
- Official implementation of Joint Multidimensional Scaling☆24Nov 19, 2023Updated 2 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
- Scalable framework for comparing metric measure spaces with up to 1M points.☆16Apr 6, 2021Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- ☆18Jul 19, 2022Updated 4 years ago
- CO-Optimal Transport☆41Nov 6, 2020Updated 5 years ago
- AISTATS 2019: Reference-based Adversarial Sampling & Its applications to Soft Q-learning☆15Jan 21, 2019Updated 7 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Dec 8, 2022Updated 3 years ago
- Gromov-Wasserstein Alignment of Embeddings☆69Sep 23, 2021Updated 4 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.
- Latent optimal transport (LOT) for low rank transport and clustering☆20Jul 22, 2021Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆50Mar 13, 2023Updated 3 years ago
- ☆17Oct 22, 2020Updated 5 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆44Nov 17, 2023Updated 2 years ago
- Python implementation of the supervised graph prediction method proposed in http://arxiv.org/abs/2202.03813 using PyTorch library and POT…☆15Feb 25, 2022Updated 4 years ago
- Wasserstein regularization for sparse multi-task regression☆15Jul 26, 2020Updated 6 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆76Aug 21, 2016Updated 9 years ago
- Clustering using Deep Learning (T-SNE visualization of autoencoder embeddings )☆11Mar 3, 2019Updated 7 years ago
- ☆43Feb 21, 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 computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- Code for ICML 2020 "Graph Optimal Transport for Cross-Domain Alignment"☆164Jul 24, 2020Updated 6 years ago
- Official implementation for SPA: A Graph Spectral Alignment Perspective for Domain Adaptation (NeurIPS 2023)☆18Dec 21, 2023Updated 2 years ago
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆82Jan 25, 2024Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆109Dec 17, 2022Updated 3 years ago
- ☆21Mar 3, 2025Updated last year
- Learnable Global Pooling Layers Based on Regularized Optimal Transport (ROT)☆16Mar 17, 2024Updated 2 years ago
- Code of paper "Joint Link Prediction and Network Alignment via Cross-graph Embedding"☆21Sep 21, 2023Updated 2 years ago
- Supporting code for "Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration".☆13Jun 18, 2022Updated 4 years ago
- Open source password manager - Proton Pass • AdSecurely store, share, and autofill your credentials with Proton Pass, the end-to-end encrypted password manager trusted by millions.
- Graphs clustering using kernel measures and estimators. Kernel KMeans, Spectral Clustering, Kernel Ward etc.☆18May 14, 2024Updated 2 years ago
- Graph-based learning in Python☆17Mar 9, 2018Updated 8 years ago
- Scripts for data and figure generation in SAVER paper☆18Jan 5, 2021Updated 5 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
- ☆28Dec 5, 2019Updated 6 years ago
- Pytorch implementation of "Entropic Neural Optimal Transport via Diffusion Processes" (NeurIPS 2023, oral).☆44Mar 11, 2024Updated 2 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆24Jun 19, 2023Updated 3 years ago