LOTFormer: Doubly-Stochastic Linear Attention via Low-Rank Optimal Transport

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Shahbazi, Ashkan, Thrash, Chayne, Bai, Yikun, Hamm, Keaton, NaderiAlizadeh, Navid, Kolouri, Soheil
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912886379511808
author Shahbazi, Ashkan
Thrash, Chayne
Bai, Yikun
Hamm, Keaton
NaderiAlizadeh, Navid
Kolouri, Soheil
author_facet Shahbazi, Ashkan
Thrash, Chayne
Bai, Yikun
Hamm, Keaton
NaderiAlizadeh, Navid
Kolouri, Soheil
contents Transformers have proven highly effective across modalities, but standard softmax attention scales quadratically with sequence length, limiting long context modeling. Linear attention mitigates this by approximating attention with kernel feature maps, yet most attention mechanisms remain row normalized and can over concentrate mass on a few tokens, harming robustness and information flow. Doubly stochastic attention counteracts this by balancing token participation across both rows and columns, but existing approaches often add significant overhead. We propose LOTFormer, a linear time doubly stochastic attention mechanism derived from an optimal transport view of attention as a coupling between query and key measures. LOTFormer enforces a low rank transport plan by conditioning on a learnable pivot measure with small support. We solve two entropic transport problems, queries to pivot and pivot to keys, and compose them into a conditional coupling that is provably doubly stochastic, has rank at most $r \ll n$, and applies to values in $O(nr)$ time without forming the full $n \times n$ matrix. The pivot locations and masses are learned end-to-end. Across vision and text benchmarks, LOTFormer delivers strong accuracy efficiency tradeoffs when plugged into standard backbones including Swin, DeiT, and BERT.
format Preprint
id arxiv_https___arxiv_org_abs_2509_23436
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle LOTFormer: Doubly-Stochastic Linear Attention via Low-Rank Optimal Transport
Shahbazi, Ashkan
Thrash, Chayne
Bai, Yikun
Hamm, Keaton
NaderiAlizadeh, Navid
Kolouri, Soheil
Machine Learning
Transformers have proven highly effective across modalities, but standard softmax attention scales quadratically with sequence length, limiting long context modeling. Linear attention mitigates this by approximating attention with kernel feature maps, yet most attention mechanisms remain row normalized and can over concentrate mass on a few tokens, harming robustness and information flow. Doubly stochastic attention counteracts this by balancing token participation across both rows and columns, but existing approaches often add significant overhead. We propose LOTFormer, a linear time doubly stochastic attention mechanism derived from an optimal transport view of attention as a coupling between query and key measures. LOTFormer enforces a low rank transport plan by conditioning on a learnable pivot measure with small support. We solve two entropic transport problems, queries to pivot and pivot to keys, and compose them into a conditional coupling that is provably doubly stochastic, has rank at most $r \ll n$, and applies to values in $O(nr)$ time without forming the full $n \times n$ matrix. The pivot locations and masses are learned end-to-end. Across vision and text benchmarks, LOTFormer delivers strong accuracy efficiency tradeoffs when plugged into standard backbones including Swin, DeiT, and BERT.
title LOTFormer: Doubly-Stochastic Linear Attention via Low-Rank Optimal Transport
topic Machine Learning
url https://arxiv.org/abs/2509.23436