ESPFormer: Doubly-Stochastic Attention with Expected Sliced Transport Plans
Not on the map. Why?
Abstract (arXiv)
While self-attention has been instrumental in the success of Transformers, it can lead to over-concentration on a few tokens during training, resulting in suboptimal information flow. Enforcing doubly-stochastic constraints in attention matrices has been shown to improve structure and balance in attention distributions. However, existing methods rely on iterative Sinkhorn normalization, which is computationally costly. In this paper, we introduce a novel, fully parallelizable doubly-stochastic attention mechanism based on sliced optimal transport, leveraging Expected Sliced Transport Plans (ESP). Unlike prior approaches, our method enforces doubly stochasticity without iterative Sinkhorn normalization, significantly enhancing efficiency. To ensure differentiability, we incorporate a temperature-based soft sorting technique, enabling seamless integration into deep learning models. Experiments across multiple benchmark datasets, including image classification, point cloud classification, sentiment analysis, and neural machine translation, demonstrate that our enhanced attention regularization consistently improves performance across diverse applications. Our implementation code can be found at https://github.com/dariansal/ESPFormer.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 37 of its 63 references that are in the map. First posted on arXiv 11 Feb 2025.
Builds on
37 of 63 references.
References · 37
- 2017Attention Is All You Needcited by 60,361
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
- 2020Rethinking Attention with Performerscited by 1,601
- 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,488
- 2020Point Transformercited by 1,470
- 2021Transformers in Vision: A Surveycited by 1,013
- 2021Going deeper with Image Transformerscited by 764
- 2020PCT: Point cloud transformercited by 732
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
25 more
- 2019Graph Transformer Networkscited by 523
- 2022DeiT III: Revenge of the ViTcited by 419
- 2020TweetEval: Unified Benchmark and Comparative Evaluation for Tweet Classificationcited by 417
- 2019Axial Attention in Multidimensional Transformerscited by 358
- 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 333
- 2019Cross Attention Network for Few-shot Classificationcited by 219
- 2019Generalized Sliced Wasserstein Distancescited by 208
- 2022Geometric Transformer for Fast and Robust Point Cloud Registrationcited by 202
- 2018Learning Latent Permutations with Gumbel-Sinkhorn Networkscited by 175
- 2023FLatten Transformer: Vision Transformer using Focused Linear Attentioncited by 171
- 2023Exphormer: Sparse Transformers for Graphscited by 170
- 2019Max-Sliced Wasserstein Distance and its use for GANscited by 119
- 2019Differentiable Ranks and Sorting using Optimal Transportcited by 113
- 2019Stochastic Optimization of Sorting Networks via Continuous Relaxationscited by 111
- 2023Multimodal Optimal Transport-based Co-Attention Transformer with Global Structure Consistency for Survival Predictioncited by 86
- 2020SoftSort: A Continuous Relaxation for the argsort Operatorcited by 66
- 2015Sliced Wasserstein Kernels for Probability Distributionscited by 65
- 2019FSPool: Learning Set Representations with Featurewise Sort Poolingcited by 53
- 2024Sparser is Faster and Less is More: Efficient Sparse Attention for Long-Range Transformerscited by 52
- 2023Energy-Based Sliced Wasserstein Distancecited by 39
- 2022Hierarchical Sliced Wasserstein Distancecited by 23
- 2020Linear Attention Mechanism: An Efficient Attention for Semantic Segmentationcited by 21
- 2024Expected Sliced Transport Planscited by 19
- 2023Unlocking Slot Attention by Changing Optimal Transport Costscited by 16
- 2021Alignment Attention by Matching Key and Query Distributionscited by 14
Built on by
Citing papers per year: 2025: 6; 2026: 4.
10 papers.
- 2026FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPUcited by 11
- 2025Quantum Doubly Stochastic Transformerscited by 6
- 2025LOTFormer: Doubly-Stochastic Linear Attention via Low-Rank Optimal Transportcited by 4
- 2025Constrained Sliced Wasserstein Embeddingcited by 2
- 2025Sliced ReLU attention: Quasi-linear contextual expressivity via sortingcited by 2
- 2026Sinkhorn doubly stochastic attention rank decay analysiscited by 2
- 2026Sliced Inner Product Gromov-Wasserstein Distancescited by 1
- 2025Streaming Sliced Optimal Transportcited by 0
- 2025LUNA: Linear Universal Neural Attention with Generalization Guaranteescited by 0
- 2026ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projectioncited by 0
- 2026ASAP: Amortized Doubly-Stochastic Attention via Sliced Dual Projection13 May 2026
- 2026Sliced Inner Product Gromov-Wasserstein Distances8 May 2026
- 2026Sinkhorn doubly stochastic attention rank decay analysis9 Apr 2026
- 2026FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU3 Feb 2026
- 2025Sliced ReLU attention: Quasi-linear contextual expressivity via sorting12 Dec 2025
- 2025LUNA: Linear Universal Neural Attention with Generalization Guarantees8 Dec 2025
- 2025LOTFormer: Doubly-Stochastic Linear Attention via Low-Rank Optimal Transport27 Sep 2025
- 2025Constrained Sliced Wasserstein Embedding2 Jun 2025
- 2025Streaming Sliced Optimal Transport11 May 2025
- 2025Quantum Doubly Stochastic Transformers22 Apr 2025