MarcTLaw / LorentzianDistanceRetrievalLinks
Lorentzian Distance Learning for Hyperbolic Representations: Retrieval experiments
☆12Updated 6 years ago
Alternatives and similar repositories for LorentzianDistanceRetrieval
Users that are interested in LorentzianDistanceRetrieval are comparing it to the libraries listed below
Sorting:
- ☆28Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Updated 2 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Code for "Graph-based Semi-Supervised & Active Learning for Edge Flows"☆15Updated 6 years ago
- Variational Graph Convolutional Networks☆23Updated 4 years ago
- Code for Online Graph Dictionary Learning☆17Updated 3 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 4 years ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆36Updated 3 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- ☆25Updated 5 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- A Note On Over-Smoothing for Graph Neural Network☆20Updated 4 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 6 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- ☆12Updated 3 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- learning point processes by means of optimal transport and wasserstein distance☆54Updated 7 years ago
- Scattering GCN: overcoming oversmoothness in graph convolutional networks☆25Updated 3 years ago
- ☆17Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- ☆47Updated 3 years ago
- ☆35Updated 6 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆22Updated 3 years ago
- ☆44Updated 7 years ago
- ☆22Updated 4 years ago
- Source code for AAAI 2019 paper "Hyperbolic Heterogeneous Information Network Embedding"☆24Updated 3 years ago