Towards Universal Wasserstein Barycenters through Flow Matching
Quick summary
arXiv:2609.38547v1 Announce Type: cross Abstract: Defining a weighted mean over probability measures under probability metrics is a central tool in probabilistic machine learning. Under the Wasserstein metric, these are called \emph{Wasserstein barycenters}. While most approaches compute barycenters for a fixed weight vector, approximating the whole family of barycenters over the simplex, which we call the \emph{Wasserstein simplex}, remains underexplored. We refer to this problem as \emph{Universal Barycenter Approximation}, and propose \texttt{BaryFM}, a flow matching model transporting the
Key takeaways
- arXiv:2609.38547v1 Announce Type: cross Abstract: Defining a weighted mean over probability measures under probability metrics is a central tool in probabilistic machine learning.
- Under the Wasserstein metric, these are called \emph{Wasserstein barycenters}.
- While most approaches compute barycenters for a fixed weight vector, approximating the whole family of barycenters over the simplex, which we call the \emph{Wasserstein simplex}, remains underexplored.
Why it matters
“Towards Universal Wasserstein Barycenters through Flow Matching” should be evaluated beyond branding and benchmark scores. Its practical importance will emerge in task accuracy, latency, unit cost, safety and integration with real workflows.
Member comments