2019
NIPS
NeurIPS 2019
Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm
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.
🌉
Interdisciplinary Bridge
— Machine Learning and Mathematics & Optimization
🧭
Keyword Pioneer
— gradient lipschitz continuity
🐣
Hot Topic Early Bird
— probability distribution
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Security & Privacy, Speech & Audio
Authors
Topics
Machine Learning > Optimization & Theory > Optimization
Mathematics & Optimization > Mathematics > Numerical Analysis
Mathematics & Optimization > Mathematics > Probability
Mathematics & Optimization > Optimization > Continuous Optimization
Mathematics & Optimization > Optimization > Optimization
Mathematics & Optimization > Optimization > Optimal Transport