lmotte / graph-prediction-with-fused-gromov-wassersteinLinks
Python implementation of the supervised graph prediction method proposed in http://arxiv.org/abs/2202.03813 using PyTorch library and POT library (Python Optimal Transport).
☆14Updated 3 years ago
Alternatives and similar repositories for graph-prediction-with-fused-gromov-wasserstein
Users that are interested in graph-prediction-with-fused-gromov-wasserstein are comparing it to the libraries listed below
Sorting:
- ☆17Updated 2 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Updated 2 years ago
- ☆20Updated 8 months ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- Differentiable Euler Characteristic Transform☆17Updated last year
- NeurIPS'22 Oral: EquiVSet - Learning Neural Set Functions Under the Optimal Subset Oracle☆20Updated 2 years ago
- ☆12Updated 4 years ago
- Embedding graphs in symmetric spaces☆30Updated 4 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- ☆29Updated 3 years ago
- Size-Invariant Graph Representations for Graph Classification Extrapolations (ICML 2021 Long Talk)☆23Updated 2 years ago
- This repository reproduces the results in the paper "How expressive are transformers in spectral domain for graphs?"(published in TMLR)☆12Updated 3 years ago
- Learnable Global Pooling Layers Based on Regularized Optimal Transport (ROT)☆16Updated last year
- Path integral based convolution and pooling☆30Updated 2 years ago
- Approximate subgraph motif mining through learnable edge contraction.☆13Updated 2 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆20Updated 2 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆45Updated 3 years ago
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆19Updated 2 years ago
- Supervised Training of Conditional Monge Maps☆19Updated last year
- Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)☆15Updated 2 years ago
- Official repository for the ICLR 2022 paper "Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions"…☆14Updated 3 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆38Updated 11 months ago
- ☆11Updated 2 months ago
- Official repository for the paper "Partition and Code: learning how to compress graphs" (NeurIPS'21) https://arxiv.org/abs/2107.01952☆35Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 3 years ago
- ☆18Updated last year
- Official repository for the Topological Deep Learning Challenge 2024, organized by TAG-DS & PyT-Team and hosted by GRaM Workshop @ ICML 2…☆39Updated 8 months ago
- Official repository for the paper: "Trees with Attention for Set Prediction Tasks" (ICML21)☆10Updated 3 years ago