The following pages link to (Q4998935):
Displaying 13 items.
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms (Q2096952) (← links)
- Simple approximative algorithms for free-support Wasserstein barycenters (Q2701424) (← links)
- Wasserstein Barycenters Are NP-Hard to Compute (Q5065469) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- Hierarchical optimal transport for unsupervised domain adaptation (Q6097101) (← links)
- Quantitative stability of barycenters in the Wasserstein space (Q6193773) (← links)
- Wasserstein barycenters can be computed in polynomial time in fixed dimension (Q6342886) (← links)
- Dynamic programming in probability spaces via optimal transport (Q6490242) (← links)
- Proxying credit curves via Wasserstein distances (Q6549633) (← links)
- Computing Wasserstein barycenters via operator splitting: the method of averaged marginals (Q6633048) (← links)
- The Wasserstein mean of unipotent matrices (Q6638367) (← links)
- Sparse Wasserstein barycenters and application to reduced order modeling (Q6671873) (← links)