MarcTLaw / LorentzianDistanceRetrieval
Lorentzian Distance Learning for Hyperbolic Representations: Retrieval experiments
☆11Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for LorentzianDistanceRetrieval
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- Variational Graph Convolutional Networks☆21Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- ☆26Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Code for Online Graph Dictionary Learning☆15Updated 2 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 6 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆16Updated last year
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆17Updated last year
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆35Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- ☆25Updated 5 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 4 years ago
- learning point processes by means of optimal transport and wasserstein distance☆54Updated 6 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Implementation of SBM-meet-GNN☆22Updated 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
- Code for `BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery`, Neurips 2021☆24Updated 3 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆15Updated 4 years ago
- ☆11Updated 2 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆23Updated 4 years ago
- The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".☆20Updated 4 years ago
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆22Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 3 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- Distributed Feedback-Looped Networks☆10Updated 4 years ago
- ☆30Updated last year
- Scattering GCN: overcoming oversmoothness in graph convolutional networks☆25Updated 2 years ago