Alternatives and similar repositories for efficient_kde

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

• zalanborsos / coresets
  Coresets
  ☆38Updated 3 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• mducoffe / Learning-Wasserstein-Embeddings
  Keras implementation of Deep Wasserstein Embeddings
  ☆48Updated 7 years ago
• yhenon / pyrcc
  Python implementation of Robust Continuous Clustering
  ☆106Updated 6 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 6 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆59Updated 4 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 5 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆58Updated 7 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆61Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• jlsuarezdiaz / pyDML
  Distance Metric Learning Algorithms for Python
  ☆175Updated 4 years ago
• gpeyre / 2016-ICML-gromov-wasserstein
  Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.
  ☆75Updated 9 years ago
• djstrouse / information-bottleneck
  a python implementation of various versions of the information bottleneck, including automated parameter searching
  ☆131Updated 5 years ago
• SeojinBang / VIBI
  Explaining a black-box using Deep Variational Information Bottleneck Approach
  ☆46Updated 3 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆73Updated 6 years ago
• yassersouri / pytorch-deep-sets
  PyTorch re-implementation of parts of "Deep Sets" (NIPS 2017)
  ☆73Updated 7 years ago
• JonathanWenger / pycalib
  Non-Parametric Calibration for Classification (AISTATS 2020)
  ☆19Updated 3 years ago
• dcmoyer / inv-rep
  Code for Invariant Rep. Without Adversaries (NIPS 2018)
  ☆35Updated 6 years ago
• brain-research / ncp
  Reliable Uncertainty Estimates in Deep Neural Networks using Noise Contrastive Priors
  ☆62Updated 5 years ago
• icml-mcbn / mcbn
  ☆53Updated 7 years ago
• fengliu90 / DK-for-TST
  This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).
  ☆52Updated 4 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆37Updated 5 years ago
• ucla-vision / information-dropout
  Implementation of Information Dropout
  ☆39Updated 8 years ago
• eifuentes / swae-pytorch
  Implementation of the Sliced Wasserstein Autoencoder using PyTorch
  ☆101Updated 7 years ago
• dmelis / SENN
  Self-Explaining Neural Networks
  ☆13Updated 2 years ago
• Jianbo-Lab / L2X
  ☆125Updated 4 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆57Updated 6 years ago
• btaba / sinkhorn_knopp
  python implementation of Sinkhorn-Knopp
  ☆35Updated 7 years ago
• claying / OTK
  A Pytorch implementation of the optimal transport kernel embedding
  ☆118Updated 4 years ago