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).
☆13Updated 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
- Supervised Training of Conditional Monge Maps☆17Updated last year
- ☆17Updated last year
- ☆23Updated 4 months ago
- ☆19Updated 3 months ago
- Code for Online Graph Dictionary Learning☆17Updated 3 years ago
- NeurIPS'22 Oral: EquiVSet - Learning Neural Set Functions Under the Optimal Subset Oracle☆19Updated 2 years ago
- This repository is the official implementation of Bidirectional Learning for Offline Infinite-width Model-based Optimization (NeurIPS 202…☆15Updated 2 years ago
- ☆12Updated 2 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆36Updated 5 months ago
- Codes for the Numerical Results of the paper "Tangent Bundle Neural Networks: from Manifolds to Celullar Sheaves and Back"☆11Updated 2 years ago
- Exploring the space of drug combinations to discover synergistic drugs using Active Learning☆24Updated 8 months ago
- Learning stochastic dynamics from snapshots through regularized unbalanced optimal transport (ICLR'25 oral)☆13Updated last week
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 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
- The repository implements the paper "Learning Graph Quantized Tokenizers for Transformers".☆10Updated last month
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆40Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- PhD Thesis☆32Updated last year
- ☆12Updated 2 years ago
- Embedding graphs in symmetric spaces☆30Updated 3 years ago
- Official repository for the ICLR 2022 paper "Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions"…☆14Updated 2 years ago
- Official implementation of Fisher-Flow Matching (NeurIPS 2024).☆21Updated 6 months ago
- ☆40Updated 6 months ago
- Ultrahyperbolic Representation Learning☆12Updated 4 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- DynGFN: Bayesian Dynamic Causal Discovery using Generative Flow Networks☆53Updated last year
- ☆24Updated 2 years ago
- TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamics☆114Updated 8 months ago
- Source code for the paper 'Uncovering Neural Scaling Laws in Molecular Representation Learning' (NeurIPS 2023 Datasets and Benchmarks).☆14Updated last year