Co-occurring keywords · papers mentioning both
Papers
Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters
NeurIPS 2018
Differentiable Submodular Maximization
IJCAI 2018
Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distance
NeurIPS 2018
Distilled Wasserstein Learning for Word Embedding and Topic Modeling
NeurIPS 2018
Easy Identification From Better Constraints: Multi-Shot Person Re-Identification From Reference Constraints
CVPR 2018
Fast Similarity Search via Optimal Sparse Lifting
NeurIPS 2018
Geometrically Coupled Monte Carlo Sampling
NeurIPS 2018
Gromov-Wasserstein Alignment of Word Embedding Spaces
EMNLP 2018
Improving GANs Using Optimal Transport
ICLR 2018
Inference via Low-Dimensional Couplings
JMLR 2018
Large Scale computation of Means and Clusters for Persistence Diagrams using Optimal Transport
NeurIPS 2018
Large Scale Optimal Transport and Mapping Estimation
ICLR 2018
Learning Generative Models with Sinkhorn Divergences
AISTATS 2018
Learning Neural Representation for CLIR with Adversarial Framework
EMNLP 2018
Learning semantic similarity in a continuous space
NeurIPS 2018
Multi-Level Metric Learning via Smoothed Wasserstein Distance
IJCAI 2018
Neural Architecture Search with Bayesian Optimisation and Optimal Transport
NeurIPS 2018
On the Convergence and Robustness of Training GANs with Regularized Optimal Transport
NeurIPS 2018
On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport
NeurIPS 2018
Pathwise Derivatives Beyond the Reparameterization Trick
ICML 2018
Regularized Optimal Transport and the Rot Mover's Distance
JMLR 2018
Representing and Learning High Dimensional Data With the Optimal Transport Map From a Probabilistic Viewpoint
CVPR 2018
Re-Weighted Adversarial Adaptation Network for Unsupervised Domain Adaptation
CVPR 2018
Semi-Supervised Optimal Transport for Heterogeneous Domain Adaptation
IJCAI 2018
Sliced Wasserstein Distance for Learning Gaussian Mixture Models
CVPR 2018