mlsanityData to 14 Oct 2026

ESPFormer: Doubly-Stochastic Attention with Expected Sliced Transport Plans

arXiv 2502.07962 ↗First posted 11 Feb 2025cs.LGcited by 10

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

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  4. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  5. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  6. 2020Rethinking Attention with Performerscited by 1,601
  7. 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,488
  8. 2020Point Transformercited by 1,470
  9. 2021Transformers in Vision: A Surveycited by 1,013
  10. 2021Going deeper with Image Transformerscited by 764
  11. 2020PCT: Point cloud transformercited by 732
  12. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
25 more
  1. 2019Graph Transformer Networkscited by 523
  2. 2022DeiT III: Revenge of the ViTcited by 419
  3. 2020TweetEval: Unified Benchmark and Comparative Evaluation for Tweet Classificationcited by 417
  4. 2019Axial Attention in Multidimensional Transformerscited by 358
  5. 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 333
  6. 2019Cross Attention Network for Few-shot Classificationcited by 219
  7. 2019Generalized Sliced Wasserstein Distancescited by 208
  8. 2022Geometric Transformer for Fast and Robust Point Cloud Registrationcited by 202
  9. 2018Learning Latent Permutations with Gumbel-Sinkhorn Networkscited by 175
  10. 2023FLatten Transformer: Vision Transformer using Focused Linear Attentioncited by 171
  11. 2023Exphormer: Sparse Transformers for Graphscited by 170
  12. 2019Max-Sliced Wasserstein Distance and its use for GANscited by 119
  13. 2019Differentiable Ranks and Sorting using Optimal Transportcited by 113
  14. 2019Stochastic Optimization of Sorting Networks via Continuous Relaxationscited by 111
  15. 2023Multimodal Optimal Transport-based Co-Attention Transformer with Global Structure Consistency for Survival Predictioncited by 86
  16. 2020SoftSort: A Continuous Relaxation for the argsort Operatorcited by 66
  17. 2015Sliced Wasserstein Kernels for Probability Distributionscited by 65
  18. 2019FSPool: Learning Set Representations with Featurewise Sort Poolingcited by 53
  19. 2024Sparser is Faster and Less is More: Efficient Sparse Attention for Long-Range Transformerscited by 52
  20. 2023Energy-Based Sliced Wasserstein Distancecited by 39
  21. 2022Hierarchical Sliced Wasserstein Distancecited by 23
  22. 2020Linear Attention Mechanism: An Efficient Attention for Semantic Segmentationcited by 21
  23. 2024Expected Sliced Transport Planscited by 19
  24. 2023Unlocking Slot Attention by Changing Optimal Transport Costscited by 16
  25. 2021Alignment Attention by Matching Key and Query Distributionscited by 14

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 4.

10 papers.