arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.04483stat.MLcs.LG
收藏

Tree-Wasserstein Barycenter for Large-Scale Multilevel Clustering and Scalable Bayes

RIKEN AIP(理化学研究所先进工业科学与技术研究所);Monash University(莫纳什大学);UC Berkeley(加州大学伯克利分校);Kyoto University(京都大学)

Tam Le, Viet Huynh, Nhat Ho, Dinh Phung, Makoto Yamada

英文摘要:

We study in this paper a variant of Wasserstein barycenter problem, which we refer to as tree-Wasserstein barycenter, by leveraging a specific class of ground metrics, namely tree metrics, for Wasserstein distance. Drawing on the tree structure, we propose an efficient algorithmic approach to solve the tree-Wasserstein barycenter and its variants. The proposed approach is not only fast for computation but also efficient for memory usage. Exploiting the tree-Wasserstein barycenter and its variants, we scale up multi-level clustering and scalable Bayes, especially for large-scale applications where the number of supports in probability measures is large. Empirically, we test our proposed approach against other baselines on large-scale synthetic and real datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑