Abstract:Discrete optimal transport (OT) typically relies on pointwise matching between empirical measures, incurring computational costs that scale at least quadratically with the sample size. To circumvent this limitation, we introduce a mathematical framework for OT between finite location-scale mixture models. By defining a specific function class grounded in generalized Minkowski inequalities and characterizing OT maps between multivariate location-scale families, we extend Wasserstein-type metrics and barycenters to these mixture models under the assumption of identifiability. Furthermore, we prove that restricting joint couplings to a specific mixture structure reduces the continuous multimarginal OT problem to a discrete transport problem over mixture components. Computing transport plans between these components rather than individual samples reduces the computational complexity to linear scaling with respect to the sample size. Empirical evaluations on the VisDA-C benchmark confirm that this strategy achieves competitive accuracy compared to existing empirical OT approaches, while substantially reducing the computational cost and memory footprint.
From: Yunxin Zhang [view email]
[v1]
Thu, 25 Jun 2026 00:42:28 UTC (60 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。