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
- CO-Optimal Transport☆41Nov 6, 2020Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆45Sep 15, 2019Updated 6 years ago
- Tools for generating and comparing Decorated Merge Trees, enriched persistence-based topological data descriptors.☆17Aug 27, 2022Updated 3 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Jun 13, 2020Updated 5 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☆47Mar 13, 2023Updated 3 years ago
- This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'☆10May 8, 2023Updated 3 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- ☆14Jul 17, 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
- V-Mapper -☆10Aug 6, 2023Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Mar 2, 2021Updated 5 years ago
- Learning the optimal transport map via input convex neural neworks☆44Jun 26, 2020Updated 5 years ago
- ☆17Oct 22, 2020Updated 5 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- 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
- ☆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…☆15Feb 25, 2022Updated 4 years ago
- Differentiable Euler Characteristic Transform☆17Jun 18, 2024Updated last year
- Euclidean Wasserstein-2 optimal transportation☆48Aug 19, 2023Updated 2 years ago
- ☆13May 16, 2018Updated 8 years ago
- 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
- ☆12Jun 17, 2022Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- 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
- Entropic Optimal Transport Benchmark (NeurIPS 2023).☆33Mar 21, 2024Updated 2 years ago
- 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 3 years ago
- LDP for graph classification☆23Nov 14, 2019Updated 6 years ago
- ☆12Aug 21, 2020Updated 5 years ago
- A Berkeley library for probability theory.☆15Jan 14, 2025Updated last year
- Code for ICML 2020 "Graph Optimal Transport for Cross-Domain Alignment"☆163Jul 24, 2020Updated 5 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Scripts for data and figure generation in SAVER paper☆18Jan 5, 2021Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆29Mar 11, 2020Updated 6 years 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 2 years ago
- ☆50Jul 25, 2024Updated last year
- generalized principal component analysis (GLM-PCA) implemented in python☆63Feb 1, 2021Updated 5 years ago
- Learnable Global Pooling Layers Based on Regularized Optimal Transport (ROT)☆16Mar 17, 2024Updated 2 years ago