Abstract
This contribution features an accelerated computation of Sinkhorn\'s algorithm, which approximates the Wasserstein transportation distance, by employing nonequispaced fast Fourier transforms (NFFT).The proposed algorithm allows approximations of the Wasserstein distance by involving not more than $\mathcal O(n\log n)$ operations for probability measures supported by $n$ points.Furthermore, the proposed method avoids expensive allocations of the characterizing matrices.With this numerical acceleration, the transportation distance is accessible to probability measures out of reach so far.Numerical experiments using synthetic and real data affirm the computational advantage and superiority.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: ETNA - Electronic Transactions on Numerical Analysis
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
