audeg / Sinkhorn-GANLinks
Learning generative models with Sinkhorn Loss
☆30Updated 6 years ago
Alternatives and similar repositories for Sinkhorn-GAN
Users that are interested in Sinkhorn-GAN are comparing it to the libraries listed below
Sorting:
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Implementation of the Sliced Wasserstein Autoencoder using PyTorch☆102Updated 7 years ago
- ☆54Updated last year
- This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).☆51Updated 4 years ago
- PyTorch implementation of the OT-Flow approach in arXiv:2006.00104☆56Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆27Updated 5 years ago
- Code for "Variational Autoencoder with Learned Latent Structure"☆34Updated 4 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆66Updated 2 years ago
- Exemplar VAE: Linking Generative Models, Nearest Neighbor Retrieval, and Data Augmentation☆69Updated 4 years ago
- ICML 2020 Paper: Latent Variable Modelling with Hyperbolic Normalizing Flows☆54Updated 2 years ago
- Python implementation of smooth optimal transport.☆60Updated 4 years ago
- PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)☆57Updated 2 years ago
- Official Release of "Learning the Stein Discrepancy for Training and Evaluating Energy-Based Models without Sampling"☆49Updated 5 years ago
- ☆64Updated last year
- Learning the optimal transport map via input convex neural neworks☆41Updated 5 years ago
- A Python implementation of Monge optimal transportation☆49Updated 2 years ago
- Implementation of Methods Proposed in Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networks (NeurIPS 2019)☆35Updated 5 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆57Updated 6 years ago
- ☆30Updated 4 years ago
- ☆29Updated 3 years ago
- ☆124Updated 2 years ago
- ☆41Updated 5 years ago
- ☆37Updated 5 years ago
- The official code for Efficient Learning of Generative Models via Finite-Difference Score Matching☆12Updated 2 years ago
- Robust Optimal Transport code☆43Updated 3 years ago
- PyTorch implementation of Algorithm 1 of "On the Anatomy of MCMC-Based Maximum Likelihood Learning of Energy-Based Models"☆38Updated last year
- Contains code for the NeurIPS 2020 paper by Pan et al., "Continual Deep Learning by FunctionalRegularisation of Memorable Past"☆44Updated 4 years ago