Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs

Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni. Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs. In Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicolò Cesa-Bianchi, Roman Garnett, editors, Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December 2018, Montréal, Canada. pages 5798-5808, 2018. [doi]

Abstract

Abstract is missing.