dalab / matrix-manifolds
Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
☆35Updated 4 years ago
Alternatives and similar repositories for matrix-manifolds:
Users that are interested in matrix-manifolds are comparing it to the libraries listed below
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆55Updated 3 years ago
- ☆12Updated 3 years ago
- Code for Graph Normalizing Flows.☆62Updated 5 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 4 years ago
- ☆27Updated 3 years ago
- SetToGraph paper repository☆21Updated 4 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 3 years ago
- ICML 2020 Paper: Latent Variable Modelling with Hyperbolic Normalizing Flows☆53Updated 2 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- ☆20Updated 3 years ago
- ☆30Updated last year
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 5 years ago
- Code for Graphite iterative graph generation☆59Updated 5 years ago
- Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.☆30Updated 4 years ago
- ☆45Updated 4 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆61Updated 4 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 4 years ago
- Implementation of "Fast and Flexible Temporal Point Processes with Triangular Maps" (Oral @ NeurIPS 2020)☆23Updated last year
- ☆35Updated 5 years ago
- code for the paper in NeurIPS 2019☆40Updated last year
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆103Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆33Updated 4 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- ☆38Updated 4 years ago
- ☆25Updated 3 years ago