[KongchangAI]
Unverified50% confidenceFactExact time

自回归生成阶段每生成一个新token需对所有历史token重新计算注意力,计算量随序列长度呈O(n²)增长,KV Cache可将复杂度降至O(n)的增量操作

1
Sources
50%
Confidence
Long-term
Relevance
7/7/2026
First Seen

Sources

Related Claims

Cite This Claim

Stable URI
https://kongchang.com/claim/202303
API
curl https://kongchang.com/api/v1/knowledge/claims/202303
MCP
get_claim(id=202303)