talwagner / efficient_kdeLinks
Efficient LSH-based kernel density estimation
☆29Updated 6 years ago
Alternatives and similar repositories for efficient_kde
Users that are interested in efficient_kde are comparing it to the libraries listed below
Sorting:
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Coresets☆38Updated 3 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆75Updated 9 years ago
- 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
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Python implementation of smooth optimal transport.☆61Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 6 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆59Updated 4 years ago
- Keras implementation of Deep Wasserstein Embeddings☆48Updated 7 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆57Updated 6 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Updated 6 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 5 years ago
- Explaining a black-box using Deep Variational Information Bottleneck Approach☆46Updated 3 years ago
- EigenPro2 iteration in Tensorflow (Keras)☆23Updated 6 years ago
- PyTorch re-implementation of parts of "Deep Sets" (NIPS 2017)☆73Updated 7 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆66Updated 2 years ago
- Code for "Stochastic Optimization of Sorting Networks using Continuous Relaxations", ICLR 2019.☆147Updated 2 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- python implementation of Sinkhorn-Knopp☆34Updated 7 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Implementation of the Neural Clustering Process algorithm in Pytorch☆31Updated 5 years ago
- tensorflow implementation of the Wasserstein (aka optimal transport) distance☆73Updated 4 years ago
- A Python implementation of Monge optimal transportation☆49Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Supporting code for "Parallel Streaming Wasserstein Barycenters"☆10Updated 8 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- ☆53Updated 7 years ago
- MATLAB implementation of linear support vector classification in hyperbolic space☆20Updated 7 years ago