optimal transport

Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm NeurIPS 2019 Sliced Gromov-Wasserstein NeurIPS 2019 Sliced Wasserstein Auto-Encoders ICLR 2019 Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptation CVPR 2019 Sliced-Wasserstein Flows: Nonparametric Generative Modeling via Optimal Transport and Diffusions ICML 2019 Sliced Wasserstein Generative Models CVPR 2019 Sobolev Descent AISTATS 2019 Solving graph compression via optimal transport NeurIPS 2019 Statistical Optimal Transport via Factored Couplings AISTATS 2019 Style Transfer by Relaxed Optimal Transport and Self-Similarity CVPR 2019 Subspace Detours: Building Transport Plans that are Optimal on Subspace Projections NeurIPS 2019 Subspace Robust Wasserstein Distances ICML 2019 The Wasserstein Transform ICML 2019 Three-Player Wasserstein GAN via Amortised Duality IJCAI 2019 Towards Optimal Transport with Global Invariances AISTATS 2019 Tree-Sliced Variants of Wasserstein Distances NeurIPS 2019 Wasserstein Barycenter Model Ensembling ICLR 2019 Wasserstein GAN With Quadratic Transport Cost ICCV 2019 Wasserstein regularization for sparse multi-task regression AISTATS 2019 Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds AAAI 2019 Adversarial Text Generation via Feature-Mover's Distance NeurIPS 2018 An explicit analysis of the entropic penalty in linear programming COLT 2018 A Two-Step Computation of the Exact GAN Wasserstein Distance ICML 2018 Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm ICML 2018 Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs NeurIPS 2018