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 9 years ago
• topolearn / topo-clustering
  Fast Topological Clustering with Wasserstein Distance (ICLR 2022)
  ☆12Updated 3 years ago
• MichaelArbel / MMD-gradient-flow
  ☆12Updated last year
• wilson-ye-chen / stein_thinning
  Python package for Stein Thinning
  ☆13Updated last year
• harris-chris / joint-shapley-values
  Source code for the Joint Shapley values: a measure of joint feature importance
  ☆13Updated 4 years ago
• ai-se / xtree-plan
  From Prediction to Planning: Improving Software Quality with BELLTREE
  ☆10Updated 3 years ago
• gear / graph-homomorphism-network
  Graph Homomorphism Convolution (ICML'20)
  ☆12Updated 2 years ago
• csinva / mdl-complexity
  MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".
  ☆18Updated 2 years ago
• clementchadebec / geometric_perspective_on_vaes
  Code of "A Geometric Perspective on Variational Autoencoders" (NeurIPS 2022)
  ☆14Updated last year
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 3 years ago
• TAU-MLwell / Set-Tree
  Official repository for the paper: "Trees with Attention for Set Prediction Tasks" (ICML21)
  ☆10Updated 4 years ago
• MarcTLaw / LorentzianDistanceRetrieval
  Lorentzian Distance Learning for Hyperbolic Representations: Retrieval experiments
  ☆13Updated 6 years ago
• maxkatzmann / Hipe
  A Python tool to visualize geometric shapes in the native representation of hyperbolic space.
  ☆10Updated 6 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆33Updated 3 years ago
• cs125-illinois / www-old
  Course website static sources.
  ☆11Updated 3 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• quewentian / ChemBE-bert-CRF
  extract chemical scientific data chain
  ☆10Updated 6 years ago
• frgsimpson / kitt
  Kernel Identification Through Transformers
  ☆14Updated 2 years ago
• matthieuheitz / WassersteinDictionaryLearning
  Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…
  ☆20Updated 6 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 5 years ago
• dicai / pygraphon
  Python library for working with graphons
  ☆23Updated 8 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…
  ☆12Updated 2 years ago
• lttam / TreeWasserstein
  Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…
  ☆11Updated 5 years ago
• dingran / vae-mxnet
  MXNet/Gluon implementation of the original (Gaussian) Variational Autoencoders (VAE)
  ☆10Updated 8 years ago
• apolanco115 / hcp
  hierarchical core-periphery structure
  ☆10Updated 2 years ago
• samihaija / isvd
  Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning
  ☆21Updated 4 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆61Updated 4 years ago
• pmorenoz / ModularGP
  Modular Gaussian Processes
  ☆16Updated 4 years ago
• GiulsLu / Sinkhorn-Barycenters
  Sinkhorn Barycenters via Frank-Wolfe algorithm
  ☆27Updated 5 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago