DOTmark - A Benchmark for Discrete Optimal Transport
Not on the map. Why?
Abstract (arXiv)
The Wasserstein metric or earth mover's distance (EMD) is a useful tool in statistics, machine learning and computer science with many applications to biological or medical imaging, among others. Especially in the light of increasingly complex data, the computation of these distances via optimal transport is often the limiting factor. Inspired by this challenge, a variety of new approaches to optimal transport has been proposed in recent years and along with these new methods comes the need for a meaningful comparison. In this paper, we introduce a benchmark for discrete optimal transport, called DOTmark, which is designed to serve as a neutral collection of problems, where discrete optimal transport methods can be tested, compared to one another, and brought to their limits on large-scale instances. It consists of a variety of grayscale images, in various resolutions and classes, such as several types of randomly generated images, classical test images and real data from microscopy. Along with the DOTmark we present a survey and a performance test for a cross section of established methods ranging from more traditional algorithms, such as the transportation simplex, to recently developed approaches, such as the shielding neighborhood method, and including also a comparison with commercial solvers.
Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Oct 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 1; 2025: 4; 2026: 4.
16 papers.
Sort:
By area:
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 96
- 2023Scalable Optimal Transport Methods in Machine Learning: A Contemporary Surveycited by 27
- 2023Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradientscited by 7
- 2026Faster Inference of Flow-Based Generative Models via Improved Data-Noise Couplingcited by 7
- 2022An Accelerated Stochastic Variance-Reduced Algorithm for Entropic Wasserstein Barycenterscited by 6
- 2025A Truncated Newton Method for Optimal Transportcited by 6
- 2021Improving Approximate Optimal Transport Distances using Quantizationcited by 5
- 2025PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transportcited by 5
- 2022Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithmcited by 3
- 2024Efficient approximation of Earth Mover's Distance Based on Nearest Neighbor Searchcited by 3
- 2023Computing the Distance between unbalanced Distributions -- The flat Metriccited by 1
- 2025Quantization-based Bounds on the Wasserstein Metriccited by 0
4 more
- 2025Quantifying the noise sensitivity of the Wasserstein metric for imagescited by 0
- 2026Field Codes for Distributed Coupling Samplers and Certified Empirical Transportcited by 0
- 2026Annealed Sinkhorn with Momentum: Certified Unregularized Optimal Transport in Linear Memorycited by 0
- 2026GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transportcited by 0
- 2026GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport3 Oct 2026
- 2026Annealed Sinkhorn with Momentum: Certified Unregularized Optimal Transport in Linear Memory27 Sep 2026
- 2026Field Codes for Distributed Coupling Samplers and Certified Empirical Transport29 Jul 2026
- 2026Faster Inference of Flow-Based Generative Models via Improved Data-Noise Coupling16 Mar 2026
- 2025Quantifying the noise sensitivity of the Wasserstein metric for images1 Oct 2025
- 2025Quantization-based Bounds on the Wasserstein Metric1 Jun 2025
- 2025A Truncated Newton Method for Optimal Transport2 Apr 2025
- 2025PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport6 Feb 2025
- 2024Efficient approximation of Earth Mover's Distance Based on Nearest Neighbor Search14 Jan 2024
- 2023Computing the Distance between unbalanced Distributions -- The flat Metric2 Aug 2023
- 2023Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients17 Jul 2023
- 2023Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey8 May 2023
4 more
- 2022Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithm29 Oct 2022
- 2022An Accelerated Stochastic Variance-Reduced Algorithm for Entropic Wasserstein Barycenters2 Mar 2022
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark3 Jun 2021
- 2021Improving Approximate Optimal Transport Distances using Quantization25 Feb 2021
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 96
- 2023Scalable Optimal Transport Methods in Machine Learning: A Contemporary Surveycited by 27
- 2023Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradientscited by 7
- 2022An Accelerated Stochastic Variance-Reduced Algorithm for Entropic Wasserstein Barycenterscited by 6
- 2025A Truncated Newton Method for Optimal Transportcited by 6
- 2021Improving Approximate Optimal Transport Distances using Quantizationcited by 5
- 2025PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transportcited by 5
- 2022Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithmcited by 3
- 2024Efficient approximation of Earth Mover's Distance Based on Nearest Neighbor Searchcited by 3
- 2023Computing the Distance between unbalanced Distributions -- The flat Metriccited by 1
- 2025Quantization-based Bounds on the Wasserstein Metriccited by 0
- 2025Quantifying the noise sensitivity of the Wasserstein metric for imagescited by 0
12 most cited of 15 All 15 (JSON)
- 2026GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport3 Oct 2026
- 2026Annealed Sinkhorn with Momentum: Certified Unregularized Optimal Transport in Linear Memory27 Sep 2026
- 2026Field Codes for Distributed Coupling Samplers and Certified Empirical Transport29 Jul 2026
- 2025Quantifying the noise sensitivity of the Wasserstein metric for images1 Oct 2025
- 2025Quantization-based Bounds on the Wasserstein Metric1 Jun 2025
- 2025A Truncated Newton Method for Optimal Transport2 Apr 2025
- 2025PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport6 Feb 2025
- 2024Efficient approximation of Earth Mover's Distance Based on Nearest Neighbor Search14 Jan 2024
- 2023Computing the Distance between unbalanced Distributions -- The flat Metric2 Aug 2023
- 2023Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients17 Jul 2023
- 2023Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey8 May 2023
- 2022Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithm29 Oct 2022
12 newest of 15 All 15 (JSON)