Alternatives and similar repositories for homsearch

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

• gear / graph-homomorphism-network
  Graph Homomorphism Convolution (ICML'20)
  ☆11Updated 2 years ago
• raminarmanfar / GRASP
  Greedy Randomized Adaptive Search Procedure (GRASP) using Python
  ☆10Updated 9 years ago
• joneswack / dp-rfs
  This repository contains PyTorch implementations of various random feature maps for dot product kernels.
  ☆22Updated last year
• dicai / pygraphon
  Python library for working with graphons
  ☆23Updated 8 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• TAU-MLwell / Set-Tree
  Official repository for the paper: "Trees with Attention for Set Prediction Tasks" (ICML21)
  ☆10Updated 3 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 3 years ago
• MichaelArbel / MMD-gradient-flow
  ☆12Updated last year
• csinva / mdl-complexity
  MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".
  ☆18Updated 2 years ago
• diningphil / continual_learning_for_graphs
  ☆13Updated 4 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆37Updated 5 years ago
• runame / laplace-refinement
  Posterior Refinement Improves Sample Efficiency in Bayesian Neural Networks
  ☆10Updated 3 years ago
• rsonthal / TreeRep
  Learning Tree structures and Tree metrics
  ☆24Updated last year
• tlacombe / topologicalUncertainty
  ☆11Updated 3 years ago
• MarcTLaw / LorentzianDistanceRetrieval
  Lorentzian Distance Learning for Hyperbolic Representations: Retrieval experiments
  ☆13Updated 6 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆61Updated 4 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated 2 years ago
• dimkal89 / rvae
  ☆37Updated 5 years ago
• rpatrik96 / nl-causal-representations
  This is the code for the paper Jacobian-based Causal Discovery with Nonlinear ICA, demonstrating how identifiable representations (partic…
  ☆21Updated last year
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• ChengzijunAixiaoli / PPMM
  Python3 implementation of the paper [Large-scale optimal transport map estimation using projection pursuit]
  ☆15Updated 4 years ago
• GiulsLu / OT-gradients
  ☆12Updated 7 years ago
• GiulsLu / Sinkhorn-Barycenters
  Sinkhorn Barycenters via Frank-Wolfe algorithm
  ☆27Updated 5 years ago
• msmathcomp / hyperbolic-tsne
  Experiments and content for the "Accelerating hyperbolic t-SNE" paper.
  ☆15Updated last year
• 000Justin000 / gnn-residual-correlation
  ☆20Updated 4 years ago
• frgsimpson / kitt
  Kernel Identification Through Transformers
  ☆14Updated 2 years ago
• layer6ai-labs / UoMH
  ☆12Updated 2 years ago
• CharlotteMagister / GCExplainer
  ☆19Updated last year
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• bunnech / jkonet
  Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)
  ☆22Updated 2 years ago