Learning generative models with Sinkhorn Loss
☆32Nov 9, 2018Updated 7 years ago
Alternatives and similar repositories for Sinkhorn-GAN
Users that are interested in Sinkhorn-GAN are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Code for the paper "Improving GANs Using Optimal Transport"☆75Nov 22, 2018Updated 7 years ago
- Implementation of the paper 'Stochastic Wasserstein Barycenters'☆11Oct 17, 2018Updated 7 years ago
- ☆10Jun 22, 2022Updated 4 years ago
- Official repository of "Minibatch optimal transport distances; analysis and applications" (https://arxiv.org/pdf/2101.01792.pdf)☆10Oct 15, 2021Updated 4 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- ☆12Oct 20, 2020Updated 5 years ago
- Repository detailing updated allowlisting and clonal analysis workflow☆11Feb 1, 2025Updated last year
- Source code for "Continuous Regularized Wasserstein Barycenters" [NeurIPS 2020].☆16Nov 4, 2020Updated 5 years ago
- [ICML'21 Oral] Improving Lossless Compression Rates via Monte Carlo Bits-Back Coding☆14Jun 10, 2021Updated 5 years ago
- A tensorflow implementation of the Sinkhorn Distance calculation☆27Apr 28, 2019Updated 7 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆29Mar 11, 2020Updated 6 years ago
- MAE: Mutual Posterior-Divergence Regularization for Variational AutoEncoders☆23Apr 30, 2019Updated 7 years ago
- Tensorflow implementation of Attribute-Controlled Traffic Data Augmentation Using Conditional Generative Models☆12Mar 18, 2020Updated 6 years ago
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆82Jan 25, 2024Updated 2 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Multimodal Generative Learning Utilizing Jensen-Shannon-Divergence☆18Nov 12, 2022Updated 3 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆24Nov 18, 2019Updated 6 years ago
- ☆11Apr 10, 2023Updated 3 years ago
- Tensorflow implementation of optimal transport (OT) with Sinkhorn algorithm.☆19Nov 5, 2019Updated 6 years ago
- Keypoint-Guided Optimal Transport (NeurIPS 2022)☆25Aug 23, 2023Updated 3 years ago
- pytorch implementation of stacked denoising autoencoder☆20Oct 18, 2017Updated 8 years ago
- A novel variant of sliced Wasserstein based on a new slicing technique that utilizes the convolution operator.☆12Jan 14, 2023Updated 3 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆50Mar 13, 2023Updated 3 years ago
- Diffusion-based Missing-view Generation With the Application on Incomplete Multi-view Clustering☆10May 26, 2024Updated 2 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Latent optimal transport (LOT) for low rank transport and clustering☆20Jul 22, 2021Updated 5 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆41Apr 27, 2023Updated 3 years ago
- Beta-VAE implementations in both PyTorch and Tensorflow☆22Jul 26, 2018Updated 8 years ago
- This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).☆56Jun 21, 2021Updated 5 years ago
- ☆19Nov 21, 2022Updated 3 years ago
- Python implementation of smooth optimal transport.☆61May 5, 2021Updated 5 years ago
- ☆10Jan 29, 2019Updated 7 years ago
- K-Means is a clustering algorithm which is used for cluster analysis in data mining; it partitions the data set into k clusters. In this …☆10Aug 19, 2017Updated 9 years ago
- An unofficial PyTorch implementation of "A Sliced Wasserstein Loss for Neural Texture Synthesis" paper [CVPR 2021].☆14Nov 10, 2021Updated 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.
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆17Jun 27, 2021Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 8, 2022Updated 3 years ago
- Code your mBot STEM robot using Scratch Blocks☆14Jul 22, 2018Updated 8 years ago
- Joint distribution optimal transportation for domain adaptation☆107Nov 27, 2017Updated 8 years ago
- TeX template for ICMV conference (SPIE-like)☆13Nov 8, 2018Updated 7 years ago
- Notes from courses and workshops I've taught or assisted with at UC Davis and UC Berkeley.☆30Sep 17, 2025Updated 11 months ago
- Group project "Algorithms for large-scale optimal transport". Implement ADMMs and Sinkhorn's Algorithms.☆11Jan 28, 2019Updated 7 years ago