meyerscetbon / LOTLinks
☆17Updated 2 years ago
Alternatives and similar repositories for LOT
Users that are interested in LOT are comparing it to the libraries listed below
Sorting:
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 6 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- ☆14Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆16Updated 4 years ago
- PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))☆16Updated 11 months ago
- ☆40Updated 5 years ago
- A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…☆37Updated 2 years ago
- Ultrahyperbolic Representation Learning☆13Updated 4 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago
- ☆21Updated 3 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated last year
- Latent optimal transport (LOT) for low rank transport and clustering☆19Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Code for Online Graph Dictionary Learning☆17Updated 3 years ago
- ☆10Updated 3 years ago
- Implementation of Implicit Graphon Neural Representation☆12Updated last year
- Source code of "What Makes Graph Neural Networks Miscalibrated?" (NeurIPS 2022)☆23Updated 2 weeks ago
- Rethinking Graph Regularization for Graph Neural Networks (AAAI2021)☆34Updated 4 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 4 years ago