Unverified50% confidenceFactExact time
滑动窗口注意力由 Beltagy 等人在 Longformer（2020）中提出，将复杂度从 O(n²) 降至 O(n×w)
1
Sources
50%
Confidence
Long-term
Relevance
7/25/2026
First Seen
Sources
Related Claims
UnverifiedGated Delta Net将状态空间复杂度从标准注意力的O(N²)降到O(N)量级68% similarUnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.65% similarUnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).64% similarUnverifiedDuring the autoregressive generation phase, generating each new token requires recalculating attention over all historical tokens, with computational complexity growing as O(n²) with sequence length; KV Cache can reduce this to O(n) incremental operations.62% similarUnverifiedUkkonen 的对角线剪枝可将编辑距离计算的平均复杂度降至 O(k×min(m,n))，其中 k 为编辑距离阈值62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/615546API
curl https://kongchang.com/api/v1/knowledge/claims/615546MCP
get_claim(id=615546)