Unverified50% confidenceFactExact time
Linear attention methods (such as Performer and RWKV) compress complexity to O(N) via kernel function approximation, but their precise recall capability is typically significantly weaker than full attention.
1
Sources
50%
Confidence
Long-term
Relevance
10/10/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedGated Linear Attention (GLA) reduces computational complexity from O(N²) to O(N) through a linearized attention mechanism.80% similarVerified自注意力机制的计算复杂度随序列长度呈近似二次方增长，序列长度为n时注意力矩阵计算量正比于n²75% similarVerifiedInformer reduces the self-attention computation complexity from O(n²) to O(n log n) through ProbSparse sparse attention.75% similarUnverifiedLinear attention is better suited to NPU chips due to the static graph characteristics of its fixed computation, whereas traditional attention uses dynamic graphs that require chips to frequently switch scheduling.74% similarVerifiedThe self-attention mechanism of the standard Transformer architecture has a computational complexity of O(n²).72% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/995074API
curl https://kongchang.com/api/v1/knowledge/claims/995074MCP
get_claim(id=995074)