Pages that link to "Item:Q5065469"
From MaRDI portal
The following pages link to Wasserstein Barycenters Are NP-Hard to Compute (Q5065469):
Displaying 10 items.
- A column generation approach to the discrete barycenter problem (Q2691196) (← links)
- Simple approximative algorithms for free-support Wasserstein barycenters (Q2701424) (← links)
- (Q4998935) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)
- Bayesian learning with Wasserstein barycenters (Q6175889) (← links)
- Proxying credit curves via Wasserstein distances (Q6549633) (← links)
- Wasserstein medians: robustness, PDE characterization, and numerics (Q6612263) (← links)
- Computing Wasserstein barycenters via operator splitting: the method of averaged marginals (Q6633048) (← links)
- Sparse Wasserstein barycenters and application to reduced order modeling (Q6671873) (← links)