ruilin-li / Learning-to-Match-via-Inverse-Optimal-TransportLinks
☆13Updated 7 years ago
Alternatives and similar repositories for Learning-to-Match-via-Inverse-Optimal-Transport
Users that are interested in Learning-to-Match-via-Inverse-Optimal-Transport are comparing it to the libraries listed below
Sorting:
- Code for Variational Laplace Autoencoders☆54Updated 2 years ago
- ☆10Updated 6 years ago
- Code to reproduce experiments in "Meta-learning probabilistic inference for prediction"☆70Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- matrix square root and its gradient☆48Updated 6 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Code for Optimal Transport for structured data with application on graphs☆101Updated 2 years ago
- ☆25Updated 5 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
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆104Updated 5 years ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Parallel Bread first Search on Hadoop☆18Updated 3 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- AISTATS 2019: Confidence-based Graph Convolutional Networks for Semi-Supervised Learning☆59Updated 6 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- REPresentAtion bIas Removal (REPAIR) of datasets☆56Updated 2 years ago
- demo codes for several approximate optimal transport solvers☆20Updated 7 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- ☆10Updated 3 years ago
- Source code for PairNorm (ICLR 2020)☆78Updated 5 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆56Updated 3 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆16Updated 6 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 5 years ago