Graph matching and clustering by comparing heat kernels via optimal transport.
☆27Dec 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
Sorting:
- CO-Optimal Transport☆42Nov 6, 2020Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Sep 15, 2019Updated 6 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- Tools for generating and comparing Decorated Merge Trees, enriched persistence-based topological data descriptors.☆17Aug 27, 2022Updated 3 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Nov 1, 2022Updated 3 years ago
- This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'☆10May 8, 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…☆16Feb 25, 2022Updated 4 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Jun 13, 2020Updated 5 years ago
- ☆12Jul 25, 2024Updated last year
- Learning the optimal transport map via input convex neural neworks☆42Jun 26, 2020Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Mar 13, 2023Updated 2 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
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Oct 18, 2019Updated 6 years ago
- Latent optimal transport (LOT) for low rank transport and clustering☆20Jul 22, 2021Updated 4 years ago
- A Pytorch implementation of the optimal transport kernel embedding☆119Feb 10, 2021Updated 5 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Mar 2, 2021Updated 5 years ago
- SODEN: A Scalable Continuous-Time Survival Model through Ordinary Differential Equation Networks☆14Mar 2, 2023Updated 3 years ago
- Entropic Optimal Transport Benchmark (NeurIPS 2023).☆31Mar 21, 2024Updated last year
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆23Nov 18, 2019Updated 6 years ago
- Euclidean Wasserstein-2 optimal transportation☆46Aug 19, 2023Updated 2 years ago
- Source code for the Joint Shapley values: a measure of joint feature importance☆13Sep 14, 2021Updated 4 years ago
- ☆12Jun 17, 2022Updated 3 years ago
- Custom graph/network/multi-weighted network class based on storing list of neighbors for each nodes (as opposed to edge list) for scalabl…☆12Jan 18, 2024Updated 2 years ago
- Fast Approximate Quadratic Assignment for (Brain) Graph Matching☆16Aug 23, 2016Updated 9 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆12Dec 24, 2021Updated 4 years ago
- Learning Graphons via Structured Gromov-Wasserstein Barycenters☆23Dec 13, 2020Updated 5 years ago
- Efficient Conditionally Invariant Representation Learning (ICLR 2023, Oral)☆21Nov 27, 2022Updated 3 years ago
- Official Tensorflow Code for the paper "Overcomplete Deep Subspace Clustering Networks" - WACV 2021☆13Nov 23, 2020Updated 5 years ago
- Almost Surely Stable Deep Dynamics [NeurIPS 2020]☆13Dec 8, 2022Updated 3 years ago
- ☆13Jul 17, 2023Updated 2 years ago
- ☆11Feb 14, 2022Updated 4 years ago
- L4DC2021 code repository☆15Apr 14, 2021Updated 4 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 4 years ago
- Learnable Global Pooling Layers Based on Regularized Optimal Transport (ROT)☆16Mar 17, 2024Updated last year
- Geometric Algebra Flow Matching (GAFL) for Protein Backbone Generation☆17Oct 31, 2025Updated 4 months ago
- Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".☆10Sep 2, 2024Updated last year
- Python code for implementing embeddings in the Wasserstein space of elliptical distributions☆11Jul 22, 2020Updated 5 years ago
- Graph Homomorphism Convolution (ICML'20)☆12Jul 6, 2023Updated 2 years ago
- Tensorflow implementation for Deep Cognitive Subspace Clustering (DeepCogSC)☆11Nov 6, 2019Updated 6 years ago