Alternatives and similar repositories for LorentzianDistanceRetrieval

Users that are interested in LorentzianDistanceRetrieval are comparing it to the libraries listed below

• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 5 years ago
• gasteigerjo / gtn
  Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…
  ☆15Updated 2 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 3 years ago
• cedricvincentcuaz / GDL
  Code for Online Graph Dictionary Learning
  ☆18Updated 3 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 3 years ago
• Mishne-Lab / IGNR
  Implementation of Implicit Graphon Neural Representation
  ☆12Updated 2 years ago
• HekpoMaH / algorithmic-concepts-reasoning
  ☆25Updated 4 years ago
• MichailChatzianastasis / GOAT
  Official Code Repository for the paper "Graph Ordering Attention Networks"
  ☆23Updated 2 years ago
• lrnzgiusti / on-oversquashing
  Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)
  ☆16Updated 2 years ago
• noamrazin / gnn_interactions
  Code for reproducing experiments in "On the Ability of Graph Neural Networks to Model Interactions Between Vertices"
  ☆25Updated 2 years ago
• dms-net / scatteringGCN
  Scattering GCN: overcoming oversmoothness in graph convolutional networks
  ☆25Updated 3 years ago
• msmathcomp / hyperbolic-tsne
  Experiments and content for the "Accelerating hyperbolic t-SNE" paper.
  ☆15Updated last year
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated 2 years ago
• c-hofer / graph_filtration_learning
  ☆22Updated 4 years ago
• ispamm / MATE
  MetA-Train to Explain
  ☆18Updated 3 years ago
• fedelopez77 / sympa
  Embedding graphs in symmetric spaces
  ☆30Updated 4 years ago
• cvignac / SMP
  ☆31Updated 4 years ago
• samihaija / isvd
  Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning
  ☆21Updated 4 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• TRI-GNN / TRI-GNN
  ☆12Updated 4 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• tk-rusch / GraphCON
  GraphCON (ICML 2022)
  ☆60Updated 3 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆43Updated 2 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• PurdueMINDS / size-invariant-GNNs
  Size-Invariant Graph Representations for Graph Classification Extrapolations (ICML 2021 Long Talk)
  ☆23Updated 3 years ago
• sigvae / SIGraphVAE
  ☆26Updated 6 years ago
• DavideBuffelli / SAME
  Code for the papers: "Graph Representation Learning for Multi-Task Settings: a Meta-Learning Approach", "A Meta-Learning Approach for Gra…
  ☆18Updated 3 years ago
• zhongyu1998 / PG-GNN
  Official implementation of the ICML 2022 paper "Going Deeper into Permutation-Sensitive Graph Neural Networks"
  ☆27Updated 3 years ago
• flyingtango / DiGCL
  The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021
  ☆36Updated 4 years ago
• ggoh29 / Simplicial-neural-network-benchmark
  Simplicial neural network benchmarking software
  ☆17Updated 3 years ago