mlsanityData to 14 Oct 2026

GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport

arXiv 2610.04715 ↗First posted 3 Oct 2026math.OC cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We present GPU-accelerated Bregman Douglas--Rachford splitting algorithm (BDRS) for discrete optimal transport problem in three input formats: an explicit cost matrix, a point cloud with a ground cost between them, and a separable cost on a regular grid. For each input format, we propose hardware-aware designs of mathematically equivalent representations for the BDRS iterations to enhance numerical stability and empirical runtime. We benchmark the three proposed implementations against eight GPU baseline solvers from the literature on the same device. We demonstrate that our implementations of BDRS achieve state-of-the-art performance on their respective input formats. To the best of our knowledge, this is the first cross-solver study of GPU DOT solvers with a unified measure of optimality.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 51 references that are in the map. First posted on arXiv 3 Oct 2026.

Builds on

19 of 51 references.

References · 19

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  3. 2015Optimal Transport for Domain Adaptationcited by 463
  4. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
  5. 2018Online normalizer calculation for softmaxcited by 162
  6. 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 101
  7. 2016Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problemscited by 73
  8. 2021Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradientcited by 32
  9. 2019Screening Sinkhorn Algorithm for Regularized Optimal Transportcited by 20
  10. 2016DOTmark - A Benchmark for Discrete Optimal Transportcited by 16
  11. 2021A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementationcited by 9
  12. 2018Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphscited by 5
7 more
  1. 2025cuPDLPx: A Further Enhanced GPU-Based First-Order Solver for Linear Programmingcited by 5
  2. 2024PDOT: a Practical Primal-Dual Algorithm and a GPU-Based Solver for Optimal Transportcited by 4
  3. 2024HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problemscited by 3
  4. 2025Bregman Douglas-Rachford Splitting Methodcited by 2
  5. 2023ITERATED INSIDE OUT: a new exact algorithm for the transportation problemcited by 1
  6. 2026D-PDLP: Scaling PDLP to Distributed Multi-GPU Systemscited by 1
  7. 2026Distributed Linear Programming on GPU Clusters at Extreme Scalecited by 1

Built on by

Not cited yet.