matthieuheitz / WassersteinDictionaryLearning
Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Wasserstein dictionary learning: Optimal transport-based unsupervised nonlinear dictionary learning." SIAM Journal on Imaging Sciences, 2018
☆18Updated 5 years ago
Alternatives and similar repositories for WassersteinDictionaryLearning:
Users that are interested in WassersteinDictionaryLearning are comparing it to the libraries listed below
- A matlab toolbox to perform Wasserstein Dictionary Learning or NMF☆32Updated 8 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- ☆12Updated 3 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Spatio-temporal alignements: Optimal transport in space and time☆43Updated 3 years ago
- Legendre decomposition for tensors☆13Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 3 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆55Updated 5 years ago
- Code for density estimation with nonparametric cluster shapes.☆38Updated 8 years ago
- Keras implementation of Deep Wasserstein Embeddings☆48Updated 6 years ago
- Learning generative models with Sinkhorn Loss☆28Updated 6 years ago
- A study of performance of optimal transport.☆10Updated 4 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
- Dirichlet Process K-means☆47Updated 9 months ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- Movies Recommendation with Hierarchical Poisson Factorization in Edward☆18Updated 7 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 6 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- Courses and practical sessions for the Optimal Transport and Machine learning course at Statlearn 2018☆26Updated 6 years ago
- ☆29Updated 3 years ago
- Code in support of the paper Continuous Mixtures of Tractable Probabilistic Models☆12Updated 5 months ago
- Random feature latent variable models in Python☆22Updated last year
- Fast algorithm for leverage score sampling, low rank (kernel) matrix factorization and PCA☆16Updated last year
- Pytorch implementation for "Particle Flow Bayes' Rule"☆14Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆33Updated 4 years ago