meyerscetbon / LOTLinks
☆17Updated 3 years ago
Alternatives and similar repositories for LOT
Users that are interested in LOT are comparing it to the libraries listed below
Sorting:
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- ☆14Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 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
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆42Updated last year
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Official code for the CVPR 2022 (oral) paper "OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks.…☆35Updated 3 years ago
- ☆41Updated 5 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆24Updated 3 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 4 years ago
- Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"☆36Updated last year
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆16Updated 4 years ago
- A Pytorch implementation of missing data imputation using optimal transport.☆102Updated 4 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆12Updated 3 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- A list of awesome papers and cool resources on optimal transport and its applications in general! As you will notice, this list is curren…☆228Updated 4 years ago
- ☆10Updated 3 years ago
- Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"☆13Updated last year
- [ICML 2024] How Interpretable Are Interpretable Graph Neural Networks?☆14Updated last year
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆42Updated 2 years ago
- ☆15Updated 4 years ago
- Implementation of Implicit Graphon Neural Representation☆12Updated last year
- Uncertainty Aware Semi-Supervised Learning on Graph Data☆38Updated 4 years ago
- ☆13Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆26Updated 5 years ago