lmotte / graph-prediction-with-fused-gromov-wasserstein
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).
☆12Updated 2 years ago
Related projects: ⓘ
- NeurIPS'22 Oral: EquiVSet - Learning Neural Set Functions Under the Optimal Subset Oracle☆18Updated last year
- Learnable Global Pooling Layers Based on Regularized Optimal Transport (ROT)☆15Updated 6 months ago
- ☆13Updated 5 months ago
- A list of papers for group meeting☆15Updated last week
- ☆15Updated last year
- ☆13Updated this week
- ☆13Updated last year
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆16Updated last year
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆17Updated last year
- Supervised Training of Conditional Monge Maps☆13Updated 10 months ago
- Code for the papers: "Graph Representation Learning for Multi-Task Settings: a Meta-Learning Approach", "A Meta-Learning Approach for Gra…☆16Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Code for Online Graph Dictionary Learning☆15Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- Codebase for "Discriminative Jackknife: Quantifying Uncertainty in Deep Learning via Higher-Order Influence Functions", ICML 2020.☆8Updated 4 years ago
- This repository reproduces the results in the paper "How expressive are transformers in spectral domain for graphs?"(published in TMLR)☆11Updated 2 years ago
- Ultrahyperbolic Representation Learning☆11Updated 4 years ago
- Embedding graphs in symmetric spaces☆28Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Lorentzian Distance Learning for Hyperbolic Representations: Retrieval experiments☆11Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Stable Differentiable Causal Discovery (SDCD)☆13Updated 3 months ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- ☆17Updated last year
- Deep Large-Scale Inference UsingKnockoffs☆11Updated 2 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated last year
- Random feature latent variable models in Python☆21Updated last year
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆15Updated 4 years ago
- Official repository for the ICLR 2022 paper "Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions"…☆14Updated 2 years ago
- [NeurIPS 2023] "Rethinking Tokenizer and Decoder in Masked Graph Modeling for Molecules"☆27Updated 6 months ago