Unverified50% confidenceFactExact time
标准 Scaled Dot-Product Attention 中 Q 与 K 做矩阵乘法得到 n×n 注意力分数矩阵，计算量为 O(n²·d)
1
Sources
50%
Confidence
Long-term
Relevance
7/12/2026
First Seen
Sources
Related Claims
UnverifiedIn the standard attention mechanism, the Query matrix and Key matrix perform matrix multiplication to obtain an n×n attention score matrix, with a computational complexity of O(n²·d).84% similarUnverified标准的Scaled Dot-Product Attention随着序列长度N增加，每个位置能分配到的平均注意力权重以1/N的速率稀释83% similarUnverified自注意力机制的计算复杂度随序列长度呈近似二次方增长，序列长度为n时注意力矩阵计算量正比于n²80% similarUnverifiedThe standard attention mechanism has O(n²) memory overhead, requiring computation of an approximately 2000×2000 attention matrix when there are 2,000 rows.79% similarVerifiedThe self-attention mechanism allows the model to simultaneously see the information of all other tokens in the input sequence when processing each token, and the computational complexity of the attention matrix is O(n²)78% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/490176API
curl https://kongchang.com/api/v1/knowledge/claims/490176MCP
get_claim(id=490176)