☆43Feb 21, 2020Updated 6 years ago
Alternatives and similar repositories for gsw
Users that are interested in gsw are comparing it to the libraries listed below
Sorting:
- Distributional Sliced-Wasserstein distance code☆50Jul 22, 2024Updated last year
- Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"☆14Feb 24, 2026Updated last week
- Implementation of the Sliced Wasserstein Autoencoder using PyTorch☆101Sep 24, 2018Updated 7 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Jun 14, 2019Updated 6 years ago
- Sliced Wasserstein Generator☆22Oct 30, 2018Updated 7 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆66Apr 24, 2023Updated 2 years ago
- Multi-Domain Image-to-Image Translation using StarGAN with Max Sliced Wasserstein Distance.☆14May 17, 2019Updated 6 years ago
- JMLR Cover Letter Template☆10Dec 15, 2021Updated 4 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Sep 15, 2019Updated 6 years ago
- "Applying Regularized Schrödinger-Bridge-Based Stochastic Process in Generative Modeling"☆11Aug 16, 2022Updated 3 years ago
- Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters☆10Mar 5, 2024Updated 2 years ago
- ☆13Jul 25, 2023Updated 2 years ago
- ☆10Jun 22, 2022Updated 3 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆27Feb 3, 2020Updated 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
- Geometric Algebra Flow Matching (GAFL) for Protein Backbone Generation☆17Oct 31, 2025Updated 4 months ago
- Learnable Global Pooling Layers Based on Regularized Optimal Transport (ROT)☆16Mar 17, 2024Updated last year
- Fast Laplacian estimation☆16May 31, 2024Updated last year
- ☆13Sep 13, 2023Updated 2 years ago
- Sliced Wasserstein Distance (SWD) in PyTorch☆116Oct 29, 2019Updated 6 years ago
- ☆12Jul 25, 2024Updated last year
- ☆14Jul 23, 2023Updated 2 years ago
- ☆12Jan 29, 2022Updated 4 years ago
- A Python library for variational inference with normalizing flow and annealing☆15Mar 13, 2025Updated 11 months ago
- Wasserstein regularization for sparse multi-task regression☆15Jul 26, 2020Updated 5 years ago
- Look for arXiv papers in a Zotero library and find available DOIs of published versions.☆14Apr 11, 2024Updated last year
- 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 8 months ago
- Code for "Score-based Generative Modeling Secretly Minimizes the Wasserstein Distance", NeurIPS 2022☆17Feb 11, 2023Updated 3 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- ☆15Mar 30, 2020Updated 5 years ago
- Poincare Embeddings for Word Vector Representations☆19Oct 29, 2017Updated 8 years ago
- Code for "Margin-aware Adversarial Domain Adaptation with Optimal Transport" paper☆16Jan 31, 2022Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆69Dec 2, 2019Updated 6 years ago
- Python class to easily deal with protein networks.☆20May 23, 2020Updated 5 years ago
- Implementation code for the paper "Aggregating Residue-Level Protein Language Model Embeddings with Optimal Transport"☆22May 3, 2025Updated 10 months ago
- ☆17Nov 3, 2022Updated 3 years ago
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Nov 8, 2021Updated 4 years ago
- Official PyTorch implementation for paper: Energy-Based Sliced Wasserstein Distance☆18Feb 21, 2025Updated last year