trneedham / QuantizedGromovWassersteinLinks
Scalable framework for comparing metric measure spaces with up to 1M points.
☆14Updated 4 years ago
Alternatives and similar repositories for QuantizedGromovWasserstein
Users that are interested in QuantizedGromovWasserstein are comparing it to the libraries listed below
Sorting:
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Scalable python GPU solvers for fused unbalanced gromov-wasserstein optimal transport problems, with routines and examples to align brain…☆42Updated 2 months ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 4 years ago
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆75Updated last year
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Latent optimal transport (LOT) for low rank transport and clustering☆19Updated 4 years ago
- Official implementation of Joint Multidimensional Scaling☆22Updated last year
- CO-Optimal Transport☆42Updated 4 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆16Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- This Python package will allow you to replicate the experiments from our research on applying Optimal Transport as a similarity metric in…☆41Updated 2 years ago
- Attraction-Repulsion Spectrum in Neighbor Embeddings☆31Updated 2 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- TARDIS: Topological Algorithms for Robust DIscovery of Singularities☆43Updated 2 years ago
- ☆13Updated 2 years ago
- ☆13Updated 9 months ago
- ☆32Updated 2 years ago
- Learning cell fate landscapes from spatial transcriptomics using Fused Gromov-Wasserstein☆13Updated 3 months ago
- Code accompanying paper "Set Norm and Equivariant Skip Connections: Putting the Deep in Deep Sets."☆28Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- ☆33Updated 3 months ago
- Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.☆150Updated 3 years ago
- Negative-Binomial VAE for discrete data☆18Updated 5 years ago
- Probabilistic contrastive principal component analysis (PCPCA)☆24Updated 3 years ago
- Multilayer modelling of the human transcriptome and biological mechanisms of complex diseases and traits☆11Updated 4 years ago
- Gaussian process regression package for counts data with negative binomial and zero-inflated negative binomial likelihoods☆22Updated 6 months ago
- Transformer Based Embeddings of Wasserstein Distance☆19Updated last week
- ☆10Updated last year
- Dynamic inference from single-cell snapshots by optimal transport☆19Updated last year
- Graphical modelling with time series data using an ODE model☆11Updated 3 years ago