talwagner / efficient_kde
Efficient LSH-based kernel density estimation
☆29Updated 5 years ago
Alternatives and similar repositories for efficient_kde:
Users that are interested in efficient_kde are comparing it to the libraries listed below
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆55Updated 3 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 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
- MATLAB implementation of linear support vector classification in hyperbolic space☆20Updated 6 years ago
- Code for Sliced Gromov-Wasserstein☆67Updated 5 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆103Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆34Updated 4 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- Keras implementation of Deep Wasserstein Embeddings☆48Updated 7 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated 2 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆62Updated last year
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆55Updated 6 years ago
- EigenPro2 iteration in Tensorflow (Keras)☆23Updated 6 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Coresets☆37Updated 2 years ago
- This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).☆49Updated 3 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Self-Explaining Neural Networks☆13Updated last year
- Code for "Fast Unbalanced Optimal Transport on a Tree" (NeurIPS 2020)☆13Updated 4 years ago
- Non-Parametric Calibration for Classification (AISTATS 2020)☆19Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago