English

Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm

Machine Learning 2019-06-04 v1 Machine Learning Statistics Theory Statistics Theory

Abstract

We present a novel algorithm to estimate the barycenter of arbitrary probability distributions with respect to the Sinkhorn divergence. Based on a Frank-Wolfe optimization strategy, our approach proceeds by populating the support of the barycenter incrementally, without requiring any pre-allocation. We consider discrete as well as continuous distributions, proving convergence rates of the proposed algorithm in both settings. Key elements of our analysis are a new result showing that the Sinkhorn divergence on compact domains has Lipschitz continuous gradient with respect to the Total Variation and a characterization of the sample complexity of Sinkhorn potentials. Experiments validate the effectiveness of our method in practice.

Keywords

Cite

@article{arxiv.1905.13194,
  title  = {Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm},
  author = {Giulia Luise and Saverio Salzo and Massimiliano Pontil and Carlo Ciliberto},
  journal= {arXiv preprint arXiv:1905.13194},
  year   = {2019}
}

Comments

46 pages, 8 figures

R2 v1 2026-06-23T09:33:39.516Z