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 4 years ago
• cedricvincentcuaz / GDL
  Code for Online Graph Dictionary Learning
  ☆17Updated 3 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 2 years ago
• TRI-GNN / TRI-GNN
  ☆12Updated 3 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated 2 years ago
• dms-net / scatteringGCN
  Scattering GCN: overcoming oversmoothness in graph convolutional networks
  ☆25Updated 3 years ago
• cvignac / SMP
  ☆28Updated 4 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• ZZYSonny / PlanE
  Implementation of the BasePlanE models and the experiments from the NeurIPS 2023 paper "PlanE: Representation Learning over Planar Graphs…
  ☆14Updated last year
• lrnzgiusti / on-oversquashing
  Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)
  ☆15Updated 2 years ago
• PurdueMINDS / size-invariant-GNNs
  Size-Invariant Graph Representations for Graph Classification Extrapolations (ICML 2021 Long Talk)
  ☆23Updated 2 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• uestc-lese / SPGRL
  ☆18Updated 3 years ago
• priba / graph_metric.pytorch
  Graph Metric Learning in PyTorch
  ☆10Updated 4 years ago
• YuGuangWang / HaarPool
  PyTorch Codes for Haar Graph Pooling
  ☆11Updated 2 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago
• ebonilla / VGCN
  Variational Graph Convolutional Networks
  ☆23Updated 4 years ago
• gasteigerjo / lcn
  Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …
  ☆19Updated 2 years ago
• HongtengXu / SGWB-Graphon
  Learning Graphons via Structured Gromov-Wasserstein Barycenters
  ☆23Updated 4 years ago
• c-hofer / graph_filtration_learning
  ☆22Updated 4 years ago
• Mishne-Lab / IGNR
  Implementation of Implicit Graphon Neural Representation
  ☆12Updated 2 years ago
• bunnech / jkonet
  Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)
  ☆20Updated 2 years ago
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆16Updated 4 years ago
• Genentech / GraphGUIDE
  ☆12Updated 2 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆102Updated 2 years ago
• tk-rusch / GraphCON
  GraphCON (ICML 2022)
  ☆59Updated 2 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago