Python notebooks for Optimal Transport between Gaussian Mixture Models
☆49Apr 24, 2021Updated 5 years ago
Alternatives and similar repositories for gmmot
Users that are interested in gmmot are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- an R package collection for topological data analysis☆17Apr 16, 2026Updated 4 months ago
- ☆13Mar 26, 2019Updated 7 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- ☆12Feb 14, 2022Updated 4 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆67Apr 24, 2023Updated 3 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- Python functions to compute multiparameter persistence landscapes from a RIVET file☆15Jul 13, 2024Updated 2 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆44Nov 17, 2023Updated 2 years ago
- ☆12Jun 13, 2023Updated 3 years ago
- Interface julia for R☆17Nov 23, 2025Updated 8 months ago
- Compute free-support Wasserstein barycenters exactly☆10Aug 22, 2024Updated last year
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters☆10Mar 5, 2024Updated 2 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆46Jun 17, 2022Updated 4 years ago
- Code for NeurIPS 2019 paper "Hierarchical Optimal Transport for Document Representation"☆54Jan 22, 2020Updated 6 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Code for the paper "The Random Feature Model for Input-Output Maps between Banach Spaces" (SIREV SIGEST 2024, SISC 2021)☆15Aug 8, 2024Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Jun 14, 2019Updated 7 years ago
- Learning the optimal transport map via input convex neural neworks☆44Jun 26, 2020Updated 6 years ago
- ☆10Jun 22, 2022Updated 4 years ago
- A set of functions for well-known Cumulative Distribution Function (CDF)-based distance measure☆15Jan 5, 2024Updated 2 years ago
- Demo of diffusion models #DDPM applied to molecular dynamics of small peptide☆14Jan 26, 2024Updated 2 years ago
- Euclidean Wasserstein-2 optimal transportation☆48Aug 19, 2023Updated 2 years ago
- Efficient Wasserstein Barycenter in MATLAB (for "Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support" …☆24Aug 2, 2019Updated 7 years ago
- Code for "Re-evaluating Word Mover’s Distance" (ICML 2022)☆40Jun 15, 2022Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- package for ATOL: Automatic Topologically-Oriented Learning☆24Feb 24, 2025Updated last year
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆17Dec 22, 2020Updated 5 years ago
- Code for reproducing the experiment results of the paper Imitation Learning with Sinkhorn Distances.☆14Aug 2, 2020Updated 6 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆26Feb 3, 2020Updated 6 years ago
- ☆12Oct 14, 2018Updated 7 years ago
- Implementation of the iPiano algorithm for non-convex and non-smooth optimization as described in [1].☆12Nov 28, 2018Updated 7 years ago
- Preprocessing pipeline for (sc)ATAC data☆10Feb 22, 2022Updated 4 years ago
- ☆12Mar 15, 2023Updated 3 years ago
- ☆43Feb 21, 2020Updated 6 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Train and visualise a latent variable model of moving objects.☆16Apr 28, 2020Updated 6 years ago
- PyTorch implementation of the OT-Flow approach in arXiv:2006.00104☆61Jul 25, 2024Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 8, 2022Updated 3 years ago
- ☆13Dec 19, 2023Updated 2 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆17Jun 27, 2021Updated 5 years ago
- Baum, Marcus, and Uwe D. Hanebeck. "Shape tracking of extended objects and group targets with star-convex RHMs." 14th International Confe…☆12Jan 28, 2022Updated 4 years ago
- ☆24Sep 10, 2021Updated 4 years ago