twistedcubic / copt
[NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
☆16Updated 4 years ago
Alternatives and similar repositories for copt:
Users that are interested in copt are comparing it to the libraries listed below
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆40Updated last year
- ☆17Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆31Updated 3 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Uncertainty Aware Semi-Supervised Learning on Graph Data☆40Updated 3 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 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"☆15Updated 3 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 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
- ☆9Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 3 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
- Rethinking Graph Regularization for Graph Neural Networks (AAAI2021)☆34Updated 3 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆47Updated 2 years ago
- A Flexible Generative Framework for Graph-based Semi-supervised Learning (NeurIPS 2019)☆16Updated 3 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Learning Autoencoders with Relational Regularization☆45Updated 4 years ago
- Learning Graphons via Structured Gromov-Wasserstein Barycenters☆22Updated 4 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 3 years ago
- Embedding graphs in symmetric spaces☆29Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- ☆21Updated 3 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))☆17Updated 6 months ago
- This repo is for source code of NeurIPS 2021 paper "Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibration".☆21Updated 3 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆21Updated 5 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆45Updated 3 years ago