Alternatives and similar repositories for matrix-manifolds:

Users that are interested in matrix-manifolds are comparing it to the libraries listed below

• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆55Updated 3 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 3 years ago
• joeybose / HyperbolicNF
  ICML 2020 Paper: Latent Variable Modelling with Hyperbolic Normalizing Flows
  ☆53Updated 2 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• dimkal89 / rvae
  ☆38Updated 4 years ago
• jliu / graph-normalizing-flows
  Code for Graph Normalizing Flows.
  ☆62Updated 5 years ago
• NNReasoning / What-Can-Neural-Networks-Reason-About
  ☆45Updated 4 years ago
• Haggaim / InvariantGraphNetworks
  Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"
  ☆24Updated 4 years ago
• hadarser / SetToGraphPaper
  SetToGraph paper repository
  ☆22Updated 4 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆36Updated last year
• xinshi-chen / ParticleFlowBayesRule
  Pytorch implementation for "Particle Flow Bayes' Rule"
  ☆14Updated 5 years ago
• cvignac / SMP
  ☆27Updated 3 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 5 years ago
• samihaija / isvd
  Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning
  ☆20Updated 3 years ago
• jacobdeasy / geometric-js
  ☆16Updated 3 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆21Updated 5 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆104Updated 5 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆57Updated 3 years ago
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 4 years ago
• oskopek / mvae
  Mixed-curvature Variational Autoencoders (ICLR 2020)
  ☆62Updated 4 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• wilson-ye-chen / sp-mcmc
  MATLAB code for Stein Point Markov Chain Monte Carlo.
  ☆13Updated 5 years ago
• paulmorio / geo2dr
  Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.
  ☆45Updated last year
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• balcilar / Spectral-Designed-Graph-Convolutions
  Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper
  ☆50Updated 4 years ago
• hhcho / hyplinear
  MATLAB implementation of linear support vector classification in hyperbolic space
  ☆20Updated 6 years ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago