Unverified50% confidenceFactExact time
Gated Linear Attention (GLA) reduces computational complexity from O(N²) to O(N) through a linearized attention mechanism.
1
Sources
50%
Confidence
Long-term
Relevance
10/4/2026
First Seen
Sources
Related Entities
Related Claims
VerifiedSliding window attention reduces the complexity of attention computation from O(n²) to O(n·w), linearizing GPU memory overhead for long texts.78% similarVerifiedInformer reduces the self-attention computation complexity from O(n²) to O(n log n) through ProbSparse sparse attention.76% similarVerifiedThe computational complexity of the standard Self-Attention mechanism has a quadratic relationship with sequence length (O(n²)).76% similarVerifiedStandard self-attention has a computational complexity of O(n²); SSA reduces complexity by having each token attend only to the most relevant subset, theoretically compressible to O(n·log n) or even O(n) level.76% similarVerifiedThe self-attention mechanism of the standard Transformer architecture has a computational complexity of O(n²).75% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/971172API
curl https://kongchang.com/api/v1/knowledge/claims/971172MCP
get_claim(id=971172)