FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU
Not on the map. Why?
Abstract (arXiv)
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 IO-aware 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 .
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 37 of its 56 references that are in the map. First posted on arXiv 3 Feb 2026.
Builds on
37 of 56 references.
References · 37
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018Computational Optimal Transportcited by 765
- 2017How to Escape Saddle Points Efficientlycited by 284
- 2020Sparse Sinkhorn Attentioncited by 250
- 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
- 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2018Learning Latent Permutations with Gumbel-Sinkhorn Networkscited by 172
- 2020Geometric Dataset Distances via Optimal Transportcited by 157
25 more
- 2018Online normalizer calculation for softmaxcited by 154
- 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 136
- 2020Kernel Operations on the GPU, with Autodiff, without Memory Overflowscited by 101
- 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 96
- 2021Entropic estimation of optimal transport mapscited by 87
- 2016Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problemscited by 69
- 2018Escaping Saddles with Stochastic Gradientscited by 66
- 2022A Unified Framework for Implicit Sinkhorn Differentiationcited by 28
- 2020Dataset Dynamics via Gradient Flows in Probability Spacecited by 18
- 2025TritonForge: Profiling-Guided Framework for Automated Triton Kernel Optimizationcited by 15
- 2020Sinkhorn Natural Gradient for Generative Modelscited by 10
- 2025ESPFormer: Doubly-Stochastic Attention with Expected Sliced Transport Planscited by 10
- 2020A Hypergradient Approach to Robust Regression without Correspondencecited by 7
- 2025Scaled-Dot-Product Attention as One-Sided Entropic Optimal Transportcited by 7
- 2025A Truncated Newton Method for Optimal Transportcited by 5
- 2025LOTFormer: Doubly-Stochastic Linear Attention via Low-Rank Optimal Transportcited by 4
- 2014Scalable methods for nonnegative matrix factorizations of near-separable tall-and-skinny matricescited by 3
- 2018Stochastic EM for Shuffled Linear Regressioncited by 3
- 2023Bringing regularized optimal transport to lightspeed: a splitting method adapted for GPUscited by 3
- 2025Coreset selection for the Sinkhorn divergence and generic smooth divergencescited by 3
- 2025The Anatomy of a Triton Attention Kernelcited by 3
- 2017A Sinkhorn-Newton method for entropic optimal transportcited by 2
- 2026You Need Better Attention Priorscited by 2
- 2024Unsupervised Domain Adaptation within Deep Foundation Latent Spacescited by 1
- 2025Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Pointscited by 1
Built on by
Citing papers per year: 2026: 7.
7 papers.
- 2026Block-Wise Differentiable Sinkhorn Attention: Tail-Refinement Gradients with a Gap-Aware Dustbin Bridgecited by 0
- 2026ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projectioncited by 0
- 2026From Cone Geometry to Monge Structure: Local Defects and Global Regret in High-Dimensional Optimal Transportcited by 0
- 2026DrainSinkhorn: Safe Elimination for Batched Entropic Optimal Transportcited by 0
- 2026SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transportcited by 0
- 2026AI as a Compiler: Compiling Triton kernels without the Triton compilercited by 0
- 2026A Unified Dual Method for Matching Problemscited by 0
- 2026A Unified Dual Method for Matching Problems30 Sep 2026
- 2026AI as a Compiler: Compiling Triton kernels without the Triton compiler29 Sep 2026
- 2026SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transport28 Aug 2026
- 2026DrainSinkhorn: Safe Elimination for Batched Entropic Optimal Transport27 Jul 2026
- 2026From Cone Geometry to Monge Structure: Local Defects and Global Regret in High-Dimensional Optimal Transport3 Jun 2026
- 2026ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projection13 May 2026
- 2026Block-Wise Differentiable Sinkhorn Attention: Tail-Refinement Gradients with a Gap-Aware Dustbin Bridge28 Apr 2026