talwagner / efficient_kde

Related projects ⓘ

Alternatives and complementary repositories for efficient_kde

• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• zalanborsos / coresets
  Coresets
  ☆37Updated 2 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
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆56Updated 3 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆26Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆30Updated 3 years ago
• nerdslab / PyHiWA
  Alignment between clustered datasets via hierarchical Wasserstein distance
  ☆38Updated last year
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆54Updated 5 years ago
• BorgwardtLab / WTK
  A Wasserstein Subsequence Kernel for Time Series.
  ☆21Updated 5 months ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 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…
  ☆12Updated 4 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆66Updated 4 years ago
• aripakman / neural_clustering_process
  Implementation of the Neural Clustering Process algorithm in Pytorch
  ☆31Updated 4 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆36Updated last year
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆53Updated 3 years ago
• btaba / sinkhorn_knopp
  python implementation of Sinkhorn-Knopp
  ☆33Updated 6 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆43Updated last year
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆71Updated 5 years ago
• dmilios / dirichletGPC
  ☆17Updated 5 years ago
• hhcho / hyplinear
  MATLAB implementation of linear support vector classification in hyperbolic space
  ☆21Updated 6 years ago
• IBM / wasserstein-barycenters
  Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…
  ☆20Updated 5 years ago
• hichamjanati / spatio-temporal-alignements
  Spatio-temporal alignements: Optimal transport in space and time
  ☆42Updated 3 years ago
• icemiliang / pyvot
  A Python implementation of Monge optimal transportation
  ☆48Updated last year
• hichamjanati / mtw
  Wasserstein regularization for sparse multi-task regression
  ☆15Updated 4 years ago
• GiulsLu / OT-gradients
  ☆12Updated 6 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆44Updated 4 years ago
• mducoffe / Learning-Wasserstein-Embeddings
  Keras implementation of Deep Wasserstein Embeddings
  ☆46Updated 6 years ago
• GiulsLu / Sinkhorn-Barycenters
  Sinkhorn Barycenters via Frank-Wolfe algorithm
  ☆24Updated 4 years ago
• siplab-gt / hiwa-matlab
  Hierarchical Wasserstein Alignment
  ☆10Updated 4 years ago
• lchapel / partial-GW-for-PU
  Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…
  ☆21Updated 4 years ago