Alternatives and similar repositories for efficient_kde

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

• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• zalanborsos / coresets
  Coresets
  ☆37Updated 3 years ago
• mducoffe / Learning-Wasserstein-Embeddings
  Keras implementation of Deep Wasserstein Embeddings
  ☆48Updated 7 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆68Updated 5 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 5 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆59Updated 4 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆56Updated 3 years ago
• SeojinBang / VIBI
  Explaining a black-box using Deep Variational Information Bottleneck Approach
  ☆46Updated 2 years ago
• djstrouse / information-bottleneck
  a python implementation of various versions of the information bottleneck, including automated parameter searching
  ☆128Updated 5 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.
  ☆73Updated 8 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
• icemiliang / pyvot
  A Python implementation of Monge optimal transportation
  ☆49Updated last year
• fengliu90 / DK-for-TST
  This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).
  ☆50Updated 4 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• eifuentes / swae-pytorch
  Implementation of the Sliced Wasserstein Autoencoder using PyTorch
  ☆103Updated 6 years ago
• skolouri / swae
  Implementation of the Sliced Wasserstein Autoencoders
  ☆91Updated 7 years ago
• dmelis / SENN
  Self-Explaining Neural Networks
  ☆13Updated 2 years ago
• Cyanogenoid / fspool
  [ICLR 2020] FSPool: Learning Set Representations with Featurewise Sort Pooling
  ☆41Updated last year
• namkoong-lab / robustopt
  ☆43Updated 6 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• skolouri / swgmm
  Sliced Wasserstein Distance for Learning Gaussian Mixture Models
  ☆66Updated 2 years ago
• aburnap / Mixed-Membership-Stochastic-Blockmodel
  Mixed Membership Stochastic Blockmodel Implementation with 3 Inference Schemes
  ☆24Updated 10 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• brain-research / ncp
  Reliable Uncertainty Estimates in Deep Neural Networks using Noise Contrastive Priors
  ☆62Updated 5 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆56Updated 6 years ago
• btaba / sinkhorn_knopp
  python implementation of Sinkhorn-Knopp
  ☆33Updated 7 years ago