Verified70% confidenceFactExact time
Informer reduces the self-attention computation complexity from O(n²) to O(n log n) through ProbSparse sparse attention.
4
Sources
70%
Confidence
Long-term
Relevance
7/24/2026
First Seen
Sources
Kronos金融基础模型：用AI读懂K线市场语言
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.84% 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.80% similarUnverifiedLongformer、BigBird通过局部滑动窗口注意力加少量全局token的混合注意力策略，将计算复杂度从O(n²)降至O(n)79% similarUnverifiedDeformable DETR replaces global self-attention with deformable attention, sampling only about 4 reference points per head per layer, reducing the attention computation complexity from O(N²) to O(NK).78% similarUnverified注意力机制的计算复杂度为O(n²)，其中n为上下文长度，Claude具有200K token上下文窗口77% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/607220API
curl https://kongchang.com/api/v1/knowledge/claims/607220MCP
get_claim(id=607220)