HeddaCohenIndelman / Learning-Gumbel-Sinkhorn-Permutations-w-Pytorch
LEARNING LATENT PERMUTATIONS WITH GUMBEL-SINKHORN NETWORKS IMPLEMENTATION WITH PYTORCH
☆79Updated last year
Alternatives and similar repositories for Learning-Gumbel-Sinkhorn-Permutations-w-Pytorch:
Users that are interested in Learning-Gumbel-Sinkhorn-Permutations-w-Pytorch are comparing it to the libraries listed below
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆54Updated 3 years ago
- implements optimal transport algorithms in pytorch☆92Updated 2 years ago
- A Pytorch implementation of the optimal transport kernel embedding☆114Updated 3 years ago
- Code for Reparameterizable Subset Sampling via Continuous Relaxations, IJCAI 2019.☆54Updated last year
- Reparameterize your PyTorch modules☆70Updated 4 years ago
- Code for "SoftSort: A Continuous Relaxation for the argsort Operator", ICML 2020.☆44Updated last year
- Backpropagation-Friendly-Eigendecomposition☆71Updated 5 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆60Updated 3 years ago
- Learning Autoencoders with Relational Regularization☆45Updated 4 years ago
- [ICLR 2020] FSPool: Learning Set Representations with Featurewise Sort Pooling☆42Updated last year
- Code for Sliced Gromov-Wasserstein☆66Updated 5 years ago
- [NeurIPS 2019] Deep Set Prediction Networks☆100Updated 4 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆61Updated last year
- Implementation of the Sliced Wasserstein Autoencoder using PyTorch☆101Updated 6 years ago
- Equivariant Transformer (ET) layers are image-to-image mappings that incorporate prior knowledge on invariances with respect to continuo…☆89Updated 5 years ago
- ☆31Updated 4 years ago
- Low-variance, efficient and unbiased gradient estimation for optimizing models with binary latent variables. (ICLR 2019)☆28Updated 5 years ago
- ☆122Updated last year
- Repository for our paper: Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers☆86Updated 4 years ago
- Code for "Stochastic Optimization of Sorting Networks using Continuous Relaxations", ICLR 2019.☆136Updated last year
- ☆74Updated 7 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Original PyTorch implementation of Uncertainty-guided Continual Learning with Bayesian Neural Networks, ICLR 2020☆74Updated 3 years ago
- Group Equivariant Convolutional Neural Networks☆98Updated 7 years ago
- Hyperspherical Prototype Networks☆66Updated 4 years ago
- Differentiable Top-k Classification Learning☆79Updated 2 years ago
- ☆35Updated 4 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆47Updated 3 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 4 years ago