Skip to content
Preprint

Huber-Wasserstein barycenters for robust distribution-valued data

Aug 2026 · 0 citations
Mathematics

TL;DR

This work proposes a robust barycenter for distribution-valued data by incorporating the Huber loss directly into the optimal transport cost, and proves regularity and uniqueness properties of dual potentials, existence of optimal transport maps, and stability as the Huber parameter varies.

Abstract

We propose a robust barycenter for distribution-valued data by incorporating the Huber loss directly into the optimal transport cost. In contrast to metric-space Huber means, which apply the Huber loss to the Wasserstein distance after optimization, our construction acts on individual transport displacements, preserving quadratic behavior locally while limiting the influence of large displacements. The resulting Huber-Wasserstein barycenters form a natural interpolation between Wasserstein means and $L^1$-type Wasserstein medians. We establish the analytical and statistical foundations of this construction. For optimal transport with Huber loss, we prove regularity and uniqueness properties of dual potentials, existence of optimal transport maps, and stability as the Huber parameter varies. For the associated barycenter problem, we prove existence and characterization results, consistency of empirical plug-in estimators, and a finite-sample breakdown point essentially equal to $1/2$. In dimension one, we further derive the pointwise influence function and asymptotic distribution, quantify the associated robustness-efficiency trade-off, and show that displacement-wise Huberization can retain first-order information that is lost by distance-based Huberization under localized shape contamination. Numerical experiments on contaminated distribution-valued data demonstrate the robustness of the proposed barycenters and illustrate their interpolation between mean- and median-like behavior.

View source

Similar papers

Preprint Oct 2026

Sliced Wasserstein Barycenters: The Analysis Approach within the Barycentric Coding Model in the Wasserstein Space

We study sliced Wasserstein barycenters from a variational perspective in Wasserstein space, with emphasis on the analysis problem in the barycentric coding model: given a query measure and a finite dictionary of probability measures, recover simplex-constrained barycentric coordinates. We derive an explicit first-vari...

Rocio Diaz Martin, James M. Murphy · 1 citation
Preprint Nov 2026

Robust distortion riskmetrics over Bregman--Wasserstein balls and their intersections

We study the worst-case values of distortion riskmetrics over Bregman--Wasserstein balls around a reference distribution. Unlike the squared $2$-Wasserstein distance, Bregman--Wasserstein divergences can penalize upward and downward deviations differently. Our main result applies to generalized distortion functions $g:...

Peng Liu, S. Vanduffel, C. Bernard · 0 citations

Towards Universal Wasserstein Barycenters through Flow Matching

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 barycent...

Eduardo Fernandes Montesuma · 0 citations
Preprint Oct 2026

Schr\"odinger-Bass Bridge Barycenter Models for Measure-Valued Data

Barycenter models, based on stochastic and deterministic optimal transport bridges between probability measures, have proven to be useful for supervised and unsupervised learning for (probability) measure-valued data. In this paper, we utilize the directional asymmetry and dual drift-diffusion control arising in the re...

Ngoc-Hai Nguyen, Thuan Nguyen, Prakash Ishwar et al. · 0 citations
Preprint Nov 2026

An Accelerated Proximal Gradient Method for Bures-Wasserstein Space

We study composite optimization over the Bures--Wasserstein (BW) space of Gaussian measures. Our main observation is that a useful class of BW problems can be lifted into the Euclidean space of affine transport maps, such that the lifted problems can be solved efficiently using accelerated proximal gradient methods. Fo...

Jakob Nylof, Sloan Nietert, Julien Pallage et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.