twistedcubic / copt
[NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
☆16Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for copt
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆38Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- CO-Optimal Transport☆42Updated 4 years ago
- ☆16Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆15Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆44Updated 4 years ago
- Official code for the CVPR 2022 (oral) paper "OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks.…☆34Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 3 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆13Updated last year
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆49Updated 3 years ago
- Uncertainty Aware Semi-Supervised Learning on Graph Data☆40Updated 3 years ago
- ☆26Updated 3 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- Learning Graphons via Structured Gromov-Wasserstein Barycenters☆22Updated 3 years ago
- ☆21Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- Code for "Explainability methods for graph convolutional neural networks" - PE Pope*, S Kolouri*, M Rostami, CE Martin, H Hoffmann (CVPR …☆34Updated 3 months ago
- ☆12Updated 6 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 3 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 4 years ago
- Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.☆30Updated 4 years ago
- PyTorch Codes for Haar Graph Pooling☆11Updated last year
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".☆9Updated 2 months ago