Alternatives and similar repositories for homsearch

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

• raminarmanfar / GRASP
  Greedy Randomized Adaptive Search Procedure (GRASP) using Python
  ☆10Updated 8 years ago
• gear / graph-homomorphism-network
  Graph Homomorphism Convolution (ICML'20)
  ☆12Updated 2 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• harris-chris / joint-shapley-values
  Source code for the Joint Shapley values: a measure of joint feature importance
  ☆13Updated 3 years ago
• MarcTLaw / LorentzianDistanceRetrieval
  Lorentzian Distance Learning for Hyperbolic Representations: Retrieval experiments
  ☆12Updated 6 years ago
• TAU-MLwell / Set-Tree
  Official repository for the paper: "Trees with Attention for Set Prediction Tasks" (ICML21)
  ☆10Updated 3 years ago
• MichaelArbel / MMD-gradient-flow
  ☆12Updated last year
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• layer6ai-labs / two_step_zoo
  Codebase accompanying the paper "Diagnosing and Fixing Manifold Overfitting in Deep Generative Models"
  ☆9Updated 11 months ago
• maxkatzmann / Hipe
  A Python tool to visualize geometric shapes in the native representation of hyperbolic space.
  ☆10Updated 5 years ago
• csinva / mdl-complexity
  MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".
  ☆18Updated 2 years ago
• bunnech / jkonet
  Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)
  ☆20Updated 2 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• petrapoklukar / GeomCA
  Official Python implementation of Geometric Component Analysis (GeomCA) algorithm.
  ☆9Updated 3 years ago
• BorgwardtLab / significant-subgraph-mining
  Finding statistically significant subgraphs while correcting for multiple testing
  ☆8Updated 9 years ago
• CharlotteMagister / GCExplainer
  ☆19Updated last year
• topolearn / topo-clustering
  Fast Topological Clustering with Wasserstein Distance (ICLR 2022)
  ☆12Updated 3 years ago
• joneswack / dp-rfs
  This repository contains PyTorch implementations of various random feature maps for dot product kernels.
  ☆21Updated last year
• cedricvincentcuaz / GDL
  Code for Online Graph Dictionary Learning
  ☆17Updated 3 years ago
• IBM / wasserstein-barycenters
  Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…
  ☆22Updated 5 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• samirchowdhury / HyperCOT
  Code for computing Hypergraph Co-Optimal Transport distances
  ☆16Updated 2 years ago
• HanbaekLyu / NNetwork
  Custom graph/network/multi-weighted network class based on storing list of neighbors for each nodes (as opposed to edge list) for scalabl…
  ☆11Updated last year
• idiap / nvib
  ☆11Updated 3 months 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
• rpatrik96 / nl-causal-representations
  This is the code for the paper Jacobian-based Causal Discovery with Nonlinear ICA, demonstrating how identifiable representations (partic…
  ☆18Updated 11 months ago
• gwgundersen / rflvm
  Random feature latent variable models in Python
  ☆23Updated 2 years ago
• bpucla / ibebm
  ☆12Updated 4 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 5 years ago
• hadarser / SetToGraphPaper
  SetToGraph paper repository
  ☆22Updated 4 years ago