Distributional Sliced-Wasserstein distance code
☆50Jul 22, 2024Updated last year
Alternatives and similar repositories for DSW
Users that are interested in DSW are comparing it to the libraries listed below
Sorting:
- ☆43Feb 21, 2020Updated 6 years ago
- Predictive Coding for Locally-Linear Control (ICML-2020)☆17Jul 22, 2024Updated last year
- Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"☆14Feb 24, 2026Updated last week
- Code for Sliced Gromov-Wasserstein☆69Dec 2, 2019Updated 6 years ago
- Official PyTorch implementation for paper: Energy-Based Sliced Wasserstein Distance☆18Feb 21, 2025Updated last year
- Coloring lips and drawing glasses on faces in custom images or live webcam☆11Sep 10, 2019Updated 6 years ago
- ☆11Oct 3, 2022Updated 3 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Jun 14, 2019Updated 6 years ago
- ☆12Jul 25, 2024Updated last year
- A trained neural network built from scratch to classify clothes and digits from the MNIST dataset☆14Sep 11, 2019Updated 6 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- A minimal, single-file implementation of the MeanFlow paper on 2D toy examples, with a side-by-side comparison to rectified flow.☆26Jul 4, 2025Updated 7 months ago
- ☆18Mar 31, 2024Updated last year
- ☆15Mar 30, 2020Updated 5 years ago
- JMLR Cover Letter Template☆10Dec 15, 2021Updated 4 years ago
- Augmented Sliced Wasserstein Distances☆10Jun 14, 2025Updated 8 months ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Mar 13, 2023Updated 2 years ago
- ☆13Jul 25, 2023Updated 2 years ago
- Reimplementation of Wasserstein Auto Encoder (WAE) with Wasserstein GAN based penalty D_Z in Tensorflow☆12Mar 28, 2019Updated 6 years ago
- PyTorch implementation of "Kernel Neural Optimal Transport" (ICLR 2023)☆34Oct 3, 2023Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Dec 8, 2022Updated 3 years ago
- Scalable framework for comparing metric measure spaces with up to 1M points.☆15Apr 6, 2021Updated 4 years ago
- Fast Laplacian estimation☆16May 31, 2024Updated last year
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 4 years ago
- ☆14Jun 3, 2024Updated last year
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Apr 26, 2023Updated 2 years ago
- This is an implementation of Graph Convolution Topic Model for Data Streams☆15Sep 12, 2022Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Jan 22, 2021Updated 5 years ago
- Dynamic inference from single-cell snapshots by optimal transport☆20Mar 14, 2024Updated last year
- CO-Optimal Transport☆42Nov 6, 2020Updated 5 years ago
- ☆18Jun 26, 2023Updated 2 years ago
- Structure Index code repository☆18Jun 13, 2025Updated 8 months ago
- A Pytorch implementation of missing data imputation using optimal transport.☆105Jun 20, 2021Updated 4 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆66Apr 24, 2023Updated 2 years ago
- Sliced Iterative Generator (SIG) & Gaussianizing Iterative Slicing (GIS)☆37Mar 20, 2023Updated 2 years ago
- Implementation code for the paper "Aggregating Residue-Level Protein Language Model Embeddings with Optimal Transport"☆22May 3, 2025Updated 10 months ago
- Python notebooks for Optimal Transport between Gaussian Mixture Models☆47Apr 24, 2021Updated 4 years ago
- ☆18Mar 16, 2022Updated 3 years ago
- Official implementation of Transformer Neural Processes☆79Aug 21, 2022Updated 3 years ago