FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU
Felix X.-F. Ye, Xingjie Li, An Yu, Ming-Ching Chang, LINSONG CHU, Davis Wertheimer
Abstract
Entropic optimal transport (EOT) via Sinkhorn iterations is widely used in modern machine learning, yet GPU solvers remain inefficient at scale. Tensorized implementations suffer quadratic HBM traffic from dense n × m interactions, while existing online backends avoid storing dense matrices but still rely on generic tiled map-reduce reduction kernels with limited fusion. We present FlashSinkhorn, an IOaware EOT solver for squared Euclidean cost that rewrites stabilized log-domain Sinkhorn updates as row-wise LogSumExp reductions of biased dot-product scores, the same normalization as transformer attention. This enables FlashAttention-style fusion and tiling: fused Triton kernels stream tiles through on-chip SRAM and update dual potentials in a single pass, substantially reducing HBM IO per iteration while retaining linear-memory operations. We further provide streaming kernels for transport application, enabling scalable first-and second-order optimization. On A100 GPUs, FlashSinkhorn achieves up to 32× forward-pass and 161× end-to-end speedups over state-of-the-art online baselines on point-cloud OT, improves scalability on OT-based downstream tasks. For reproducibility, we release an open-source implementation at https://github.com/ ot-triton-lab/flash-sinkhorn .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on10
- FlashAttention: Fast and Memory-Efficient Exact Attention with IO-AwarenessTri Dao, Daniel Y. Fu, Stefano Ermon, Atri Rudra et al.NeurIPS 2022 · 5,493 citations
- FlashAttention-2: Faster Attention with Better Parallelism and Work PartitioningTri DaoICLR 2024 · 2,600 citations
- Geometric Dataset Distances via Optimal TransportDavid Alvarez-Melis, Nicolò FusiNeurIPS 2020 · 267 citations
- Online Sinkhorn: Optimal Transport distances from sample streamsArthur Mensch, Gabriel PeyréNeurIPS 2020 · 35 citations
- Dataset Dynamics via Gradient Flows in Probability SpaceDavid Alvarez-Melis, Nicolò FusiICML 2021 · 24 citations
Related papers
- A fast and accurate splitting method for optimal transport: analysis and implementationVien V. Mai, Jacob Lindbäck, Mikael JohanssonICLR 2022 · 15 citations
- cuRegOT: A GPU-Accelerated Solver for Entropic-Regularized Optimal TransportYixuan QiuICML 2026
- Optimal Flow Transport and its Entropic Regularization: a GPU-friendly Matrix Iterative Algorithm for Flow Balance SatisfactionLiangliang Shi, Yufeng Li, Kaipeng Zeng, Yihui Tu et al.ICLR 2025
- You Need Better Attention PriorsElon Litman, Gabe GuoICML 2026 · 1 citation
- Debiased Sinkhorn barycentersHicham Janati, Marco Cuturi, Alexandre GramfortICML 2020 · 62 citations
