Pages that link to "Item:Q343818"
From MaRDI portal
The following pages link to Discrete Wasserstein barycenters: optimal transport for discrete data (Q343818):
Displaying 22 items.
- Metrics and barycenters for point pattern data (Q89375) (← links)
- Fréchet means and Procrustes analysis in Wasserstein space (Q1740514) (← links)
- Optimal transport and barycenters for dendritic measures (Q2020194) (← links)
- On the computational complexity of finding a sparse Wasserstein barycenter (Q2025065) (← links)
- Minimax estimation of smooth optimal transport maps (Q2039809) (← links)
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms (Q2096952) (← links)
- A GPM-based algorithm for solving regularized Wasserstein barycenter problems in some spaces of probability measures (Q2161086) (← links)
- On the computation of Wasserstein barycenters (Q2293547) (← links)
- Robust clustering tools based on optimal transportation (Q2329755) (← links)
- A column generation approach to the discrete barycenter problem (Q2691196) (← links)
- Simple approximative algorithms for free-support Wasserstein barycenters (Q2701424) (← links)
- (Q4558144) (← links)
- Good Clusterings Have Large Volume (Q4971590) (← links)
- (Q4998892) (← links)
- (Q4998935) (← links)
- Wasserstein Barycenters Are NP-Hard to Compute (Q5065469) (← links)
- Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees (Q5065473) (← links)
- (Q5159417) (← links)
- Geometric Averages of Partitioned Datasets (Q5886840) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- Generalized Wasserstein barycenters between probability measures living on different subspaces (Q6179329) (← links)