PaperScope
LIVE · 2026-10-06 05:40 UTC

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

Yifan Xu, Shiqian Ma

Latestcs.CLcs.LGcs.AIcs.CV
arXiv ID
2610.04715 v1
Category
Submitted
2026-10-03

Abstract

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.

Comment: 40 pages, 7 figures, 3 tables

arXiv abs page · PDF · same-day batch