Abstract
Wi present a stochastic algorithm to compute the baryccntcr of a set of probability distributions under the Wasscrstcin metric from optimal transport Unlike previous approaches,our method extends to continuous input distributions and allows the support of the baryccntcr to be adjusted in each iteration. VVc tacklc the problem without rcgu- larization, allowing us to rccovcr a much sharper output; We give examples where our algorithm recovers a more meaningful baryccntcr than previous work. Our method is versatile and can be extended to applications such as generating super samples from a given distribution and recovering blue noise approximations.
Original language | English |
---|---|
Title of host publication | 35th International Conference on Machine Learning, ICML 2018 |
Editors | Andreas Krause, Jennifer Dy |
Publisher | International Machine Learning Society (IMLS) |
Pages | 1627-1636 |
Number of pages | 10 |
ISBN (Electronic) | 9781510867963 |
State | Published - 2018 |
Externally published | Yes |
Event | 35th International Conference on Machine Learning, ICML 2018 - Stockholm, Sweden Duration: 10 Jul 2018 → 15 Jul 2018 |
Publication series
Name | 35th International Conference on Machine Learning, ICML 2018 |
---|---|
Volume | 3 |
Conference
Conference | 35th International Conference on Machine Learning, ICML 2018 |
---|---|
Country/Territory | Sweden |
City | Stockholm |
Period | 10/07/18 → 15/07/18 |
Bibliographical note
Publisher Copyright:© 2018 35th International Conference on Machine Learning, ICML 2018. All rights reserved.
Funding
The authors thank Fernando de Goes, Marco Cuturi, Gabriel Peyre, and Matthew Staib for input and early discussions. The authors acknowledge the generous support of Army Research Office grant W911NF-12-R0011 (Smooth Modeling of Flows on Graphs), from the MIT Research Support Committee, from the MIT-IBM Watson AI Lab, from the Skoltech-MIT Next Generation Program, and from an Amazon Research Award.
Funders | Funder number |
---|---|
Army Research Office | W911NF-12-R0011 |
Massachusetts Institute of Technology |