talwagner / efficient_kdeLinks
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
Sorting:
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 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
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 6 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".☆18Updated 2 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Coresets☆37Updated 3 years ago
- Code for "Generative causal explanations of black-box classifiers"☆34Updated 4 years ago
- Keras implementation of Deep Wasserstein Embeddings☆48Updated 7 years ago
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- Fair Empirical Risk Minimization (FERM)☆37Updated 4 years ago
- Code for "The Intrinsic Dimension of Images and Its Impact on Learning" - ICLR 2021 Spotlight https://openreview.net/forum?id=XJk19XzGq2J☆69Updated last year
- Implementation of the Neural Clustering Process algorithm in Pytorch☆31Updated 4 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆104Updated 5 years ago
- Self-Explaining Neural Networks☆13Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Explaining a black-box using Deep Variational Information Bottleneck Approach☆46Updated 2 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- Code for Invariant Rep. Without Adversaries (NIPS 2018)☆35Updated 5 years ago
- Distributional Shapley: A Distributional Framework for Data Valuation☆30Updated last year
- Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"☆25Updated 3 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- MATLAB implementation of linear support vector classification in hyperbolic space☆20Updated 7 years ago
- Toy datasets to evaluate algorithms for domain generalization and invariance learning.☆42Updated 3 years ago
- A Wasserstein Subsequence Kernel for Time Series.☆21Updated last year
- Non-Parametric Calibration for Classification (AISTATS 2020)☆19Updated 3 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated last year
- This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).☆49Updated 4 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆56Updated 3 years ago