Co-occurring keywords · papers mentioning both
Papers
Learning With Batch-Wise Optimal Transport Loss for 3D Shape Recognition
CVPR 2019
Linear-Complexity Data-Parallel Earth Mover’s Distance Approximations
ICML 2019
Lower Bounds on Adversarial Robustness from Optimal Transport
NeurIPS 2019
Manifold-Valued Image Generation with Wasserstein Generative Adversarial Nets
AAAI 2019
Massively scalable Sinkhorn distances via the Nyström method
NeurIPS 2019
Max-Sliced Wasserstein Distance and Its Use for GANs
CVPR 2019
Monge blunts Bayes: Hardness Results for Adversarial Training
ICML 2019
Multi-marginal Wasserstein GAN
NeurIPS 2019
Nonparametric Density Estimation & Convergence Rates for GANs under Besov IPM Losses
NeurIPS 2019
Obtaining Fairness using Optimal Transport Theory
ICML 2019
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms
ICML 2019
On Scalable and Efficient Computation of Large Scale Optimal Transport
ICML 2019
On the Complexity of Approximating Wasserstein Barycenters
ICML 2019
Optimal Transport-based Alignment of Learned Character Representations for String Similarity
ACL 2019
Optimal Transport: Fast Probabilistic Approximation with Exact Solvers
JMLR 2019
Optimal Transport for Multi-source Domain Adaptation under Target Shift
AISTATS 2019
Optimal Transport for structured data with application on graphs
ICML 2019
Optimal Transport Maps For Distribution Preserving Operations on Latent Spaces of Generative Models
ICLR 2019
Oversampling for Imbalanced Data via Optimal Transport
AAAI 2019
Parallel Optimal Transport GAN
CVPR 2019
Probability Functional Descent: A Unifying Perspective on GANs, Variational Inference, and Reinforcement Learning
ICML 2019
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
NeurIPS 2019
Scalable Thompson Sampling via Optimal Transport
AISTATS 2019
Screening Sinkhorn Algorithm for Regularized Optimal Transport
NeurIPS 2019
Sinkhorn AutoEncoders
UAI 2019