# FlashSinkhorn 2: Block-Sparse Entropic Optimal Transport

**Published:** October 5, 2026
**Author:** Felix X. -F. Ye, Yu Chin Fabian Lim, Naigang Wang, Davis Wertheimer
**Source:** arXiv — cs.AI
**Language:** en-US
**HTML:** https://aiqazaqstan.com/en/articles/flashsinkhorn-2-block-sparse-entropic-optimal-transport

Streaming GPU solvers for entropic optimal transport (EOT), such as FlashSinkhorn, avoid storing the dense kernel but still evaluate all $n\times m$ point pairs in every Sinkhorn iteration. We present \textbf{FlashSinkhorn~2} (FS2), a solver for squared-Euclidean cost on…

> From the original source: **arXiv — cs.AI**
> [Read full article at arXiv — cs.AI](https://arxiv.org/abs/2610.02395)

**Tags:** #arXiv #GPU & Суперкомпьютеры

---

*AI Qazaqstan — non-commercial informational portal about AI in Kazakhstan. Machine translations and summaries are AI-generated.*