Improved Complexity Bounds in Wasserstein Barycenter Problem

Darina Dvinskikh, Daniil Tiapkin. Improved Complexity Bounds in Wasserstein Barycenter Problem. In Arindam Banerjee 0001, Kenji Fukumizu, editors, The 24th International Conference on Artificial Intelligence and Statistics, AISTATS 2021, April 13-15, 2021, Virtual Event. Volume 130 of Proceedings of Machine Learning Research, pages 1738-1746, PMLR, 2021. [doi]

Authors

Darina Dvinskikh

This author has not been identified. Look up 'Darina Dvinskikh' in Google

Daniil Tiapkin

This author has not been identified. Look up 'Daniil Tiapkin' in Google