Verified65% confidenceFactExact time
In 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).
3
Sources
65%
Confidence
Long-term
Relevance
7/11/2026
First Seen
Sources
Related Claims
VerifiedThe 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²)85% similarUnverified标准 Scaled Dot-Product Attention 中 Q 与 K 做矩阵乘法得到 n×n 注意力分数矩阵，计算量为 O(n²·d)84% similarVerified自注意力机制的计算复杂度随序列长度呈近似二次方增长，序列长度为n时注意力矩阵计算量正比于n²84% similarVerifiedThe self-attention mechanism allows each position to interact directly with any other position in the sequence, with a computational complexity of O(n²).78% similarVerifiedThe computational complexity of the standard Self-Attention mechanism has a quadratic relationship with sequence length (O(n²)).77% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/488589API
curl https://kongchang.com/api/v1/knowledge/claims/488589MCP
get_claim(id=488589)