Graph matching and clustering by comparing heat kernels via optimal transport.
☆26Dec 8, 2022Updated 3 years ago
Alternatives and similar repositories for Spectral-Gromov-Wasserstein
Users that are interested in Spectral-Gromov-Wasserstein 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 framework for comparing metric measure spaces with up to 1M points.☆16Apr 6, 2021Updated 5 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- CO-Optimal Transport☆41Nov 6, 2020Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆46Sep 15, 2019Updated 7 years ago
- Tools for generating and comparing Decorated Merge Trees, enriched persistence-based topological data descriptors.☆19Aug 27, 2022Updated 4 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.
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆50Mar 13, 2023Updated 3 years ago
- This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'☆11May 8, 2023Updated 3 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- ☆15Jul 17, 2023Updated 3 years ago
- Latent optimal transport (LOT) for low rank transport and clustering☆20Jul 22, 2021Updated 5 years ago
- L. Chizat, G. Peyré, B. Schmitzer, F-X. Vialard. Scaling Algorithms for Unbalanced Transport Problems. Preprint Arxiv:1607.05816, 2016.☆43Jan 20, 2017Updated 9 years ago
- Learning the optimal transport map via input convex neural neworks☆44Jun 26, 2020Updated 6 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆38Mar 2, 2021Updated 5 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- ☆17Oct 22, 2020Updated 5 years ago
- ☆12Jul 25, 2024Updated 2 years ago
- Fast Approximate Quadratic Assignment for (Brain) Graph Matching☆16Aug 23, 2016Updated 10 years ago
- Learning Graphons via Structured Gromov-Wasserstein Barycenters☆23Dec 13, 2020Updated 5 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
- ☆12Jun 17, 2022Updated 4 years ago
- Differentiable Euler Characteristic Transform☆17Jun 18, 2024Updated 2 years ago
- A Pytorch implementation of the optimal transport kernel embedding☆122Feb 10, 2021Updated 5 years ago
- Euclidean Wasserstein-2 optimal transportation☆46Aug 19, 2023Updated 3 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- Code for NeurIPS 2019 paper "Hierarchical Optimal Transport for Document Representation"☆54Jan 22, 2020Updated 6 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Mar 3, 2020Updated 6 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆24Nov 18, 2019Updated 6 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆11Dec 24, 2021Updated 4 years ago
- LDP for graph classification☆23Nov 14, 2019Updated 6 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆38Nov 29, 2024Updated last year
- Graphs clustering using kernel measures and estimators. Kernel KMeans, Spectral Clustering, Kernel Ward etc.☆18May 14, 2024Updated 2 years ago
- Supporting code for "Learning to Solve Combinatorial Graph Partitioning Problems via Efficient Exploration".☆13Jun 18, 2022Updated 4 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.
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆29Mar 11, 2020Updated 6 years ago
- Scripts for data and figure generation in SAVER paper☆19Jan 5, 2021Updated 5 years ago
- Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants☆16Apr 23, 2026Updated 5 months ago
- learning point processes by means of optimal transport and wasserstein distance☆54Mar 3, 2018Updated 8 years ago
- Python-based persistent homology algorithms☆19Jul 21, 2023Updated 3 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆76Aug 21, 2016Updated 10 years ago
- Efficient Conditionally Invariant Representation Learning (ICLR 2023, Oral)☆21Nov 27, 2022Updated 3 years ago