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
• mducoffe / Learning-Wasserstein-Embeddings
  Keras implementation of Deep Wasserstein Embeddings
  ☆48Updated 7 years ago
• zalanborsos / coresets
  Coresets
  ☆38Updated 3 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 6 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆61Updated 4 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• btaba / sinkhorn_knopp
  python implementation of Sinkhorn-Knopp
  ☆36Updated 7 years ago
• SeojinBang / VIBI
  Explaining a black-box using Deep Variational Information Bottleneck Approach
  ☆46Updated 3 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆58Updated 7 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
• dmilios / dirichletGPC
  ☆18Updated 7 years ago
• icml-mcbn / mcbn
  ☆53Updated 7 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 6 years ago
• JonathanWenger / pycalib
  Non-Parametric Calibration for Classification (AISTATS 2020)
  ☆19Updated 3 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆57Updated 6 years ago
• yassersouri / pytorch-deep-sets
  PyTorch re-implementation of parts of "Deep Sets" (NIPS 2017)
  ☆73Updated 7 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆59Updated 4 years ago
• kohpangwei / group-influence-release
  ☆50Updated 2 years ago
• jlko / active-testing
  Active and Sample-Efficient Model Evaluation
  ☆26Updated 8 months ago
• dmelis / SENN
  Self-Explaining Neural Networks
  ☆13Updated 2 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 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
• claying / OTK
  A Pytorch implementation of the optimal transport kernel embedding
  ☆119Updated 4 years ago
• snap-stanford / crust
  [NeurIPS 2020] Coresets for Robust Training of Neural Networks against Noisy Labels
  ☆35Updated 4 years ago
• skolouri / swgmm
  Sliced Wasserstein Distance for Learning Gaussian Mixture Models
  ☆66Updated 2 years ago
• skolouri / swae
  Implementation of the Sliced Wasserstein Autoencoders
  ☆92Updated 7 years ago
• djstrouse / information-bottleneck
  a python implementation of various versions of the information bottleneck, including automated parameter searching
  ☆132Updated 5 years ago
• lsgos / uncertainty-adversarial-paper
  Code for the paper 'Understanding Measures of Uncertainty for Adversarial Example Detection'
  ☆62Updated 7 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 5 years ago
• facebookresearch / InvarianceUnitTests
  Toy datasets to evaluate algorithms for domain generalization and invariance learning.
  ☆43Updated 4 years ago