Data-driven regularization of Wasserstein barycenters with an application to multivariate density registration
Not on the map. Why?
Abstract (arXiv)
We present a framework to simultaneously align and smooth data in the form of multiple point clouds sampled from unknown densities with support in a d-dimensional Euclidean space. This work is motivated by applications in bioinformatics where researchers aim to automatically homogenize large datasets to compare and analyze characteristics within a same cell population. Inconveniently, the information acquired is most certainly noisy due to mis-alignment caused by technical variations of the environment. To overcome this problem, we propose to register multiple point clouds by using the notion of regularized barycenters (or Fr'echet mean) of a set of probability measures with respect to the Wasserstein metric. A first approach consists in penalizing a Wasserstein barycenter with a convex functional as recently proposed in Bigot and al. (2018). A second strategy is to transform the Wasserstein metric itself into an entropy regularized transportation cost between probability measures as introduced in Cuturi (2013). The main contribution of this work is to propose data-driven choices for the regularization parameters involved in each approach using the Goldenshluger-Lepski's principle. Simulated data sampled from Gaussian mixtures are used to illustrate each method, and an application to the analysis of flow cytometry data is finally proposed. This way of choosing of the regularization parameter for the Sinkhorn barycenter is also analyzed through the prism of an oracle inequality that relates the error made by such data-driven estimators to the one of an ideal estimator.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Apr 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 2.
8 papers.
- 2022Wasserstein Iterative Networks for Barycenter Estimationcited by 23
- 2023Doubly Regularized Entropic Wasserstein Barycenterscited by 10
- 2021A novel notion of barycenter for probability distributions based on optimal weak mass transportcited by 5
- 2022Mirror Sinkhorn: Fast Online Optimization on Transport Polytopescited by 5
- 2021A Stochastic Bregman Primal-Dual Splitting Algorithm for Composite Optimizationcited by 4
- 2022Wasserstein Distributionally Robust Optimization with Wasserstein Barycenterscited by 3
- 2022On the potential benefits of entropic regularization for smoothing Wasserstein estimatorscited by 1
- 2023Computational Guarantees for Doubly Entropic Wasserstein Barycenters via Damped Sinkhorn Iterationscited by 0
- 2023Computational Guarantees for Doubly Entropic Wasserstein Barycenters via Damped Sinkhorn Iterations25 Jul 2023
- 2023Doubly Regularized Entropic Wasserstein Barycenters21 Mar 2023
- 2022Mirror Sinkhorn: Fast Online Optimization on Transport Polytopes18 Nov 2022
- 2022On the potential benefits of entropic regularization for smoothing Wasserstein estimators13 Oct 2022
- 2022Wasserstein Distributionally Robust Optimization with Wasserstein Barycenters23 Mar 2022
- 2022Wasserstein Iterative Networks for Barycenter Estimation28 Jan 2022
- 2021A Stochastic Bregman Primal-Dual Splitting Algorithm for Composite Optimization22 Dec 2021
- 2021A novel notion of barycenter for probability distributions based on optimal weak mass transport26 Feb 2021