Optimal Transport
474 papers
Papers per year
1
1
4
2
2
6
8
16
37
34
46
69
67
83
72
26
'5
'15
'20
'25
Papers
Riemannian Convex Potential Maps
ICML 2021
Run-Sort-ReRun: Escaping Batch Size Limitations in Sliced Wasserstein Generative Models
ICML 2021
Sliced Iterative Normalizing Flows
ICML 2021
Supervised Tree-Wasserstein Distance
ICML 2021
Testing Group Fairness via Optimal Transport Projections
ICML 2021
TIDOT: A Teacher Imitation Learning Approach for Domain Adaptation with Optimal Transport
IJCAI 2021
Timeline Summarization based on Event Graph Compression via Time-Aware Optimal Transport
EMNLP 2021
Topological Machine Learning Methods for Power System Responses to Contingencies
AAAI 2021
Unbalanced minibatch Optimal Transport; applications to Domain Adaptation
ICML 2021
Unbalanced Optimal Transport through Non-negative Penalized Linear Regression
NeurIPS 2021
Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
AAAI 2021
Using Optimal Transport as Alignment Objective for fine-tuning Multilingual Contextualized Embeddings
EMNLP 2021
Wasserstein Barycenter for Multi-Source Domain Adaptation
CVPR 2021
Adversarial Risk via Optimal Transport and Optimal Couplings
ICML 2020
A General Approach to Fairness with Optimal Transport
AAAI 2020
A mathematical theory of cooperative communication
NeurIPS 2020
Continuous Regularized Wasserstein Barycenters
NeurIPS 2020
CO-Optimal Transport
NeurIPS 2020
COT-GAN: Generating Sequential Data via Causal Optimal Transport
NeurIPS 2020
DeepEMD: Few-Shot Image Classification With Differentiable Earth Mover's Distance and Structured Classifiers
CVPR 2020
Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization
NeurIPS 2020
Entropic Optimal Transport between Unbalanced Gaussian Measures has a Closed Form
NeurIPS 2020
Evaluating Natural Language Generation via Unbalanced Optimal Transport
IJCAI 2020
Fair regression with Wasserstein barycenters
NeurIPS 2020
Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm
NeurIPS 2020