Unverified50% confidenceFactExact time
注意力机制计算当前 token 与所有历史 token 相关性的时间复杂度为 O(n²)，其中 n 为序列长度
1
Sources
50%
Confidence
Long-term
Relevance
7/12/2026
First Seen
Sources
Related Claims
Unverified注意力机制计算当前token与历史token相关性的时间复杂度为O(n²)84% similarUnverified短期记忆通过在提示词中拼接历史对话实现，受限于模型上下文长度，通常4K到200K tokens不等62% similarVerifiedKV Cache reduces latency and computing resource consumption in long-sequence generation by caching the attention key-value pairs of historical tokens, avoiding repeated computation over the entire historical sequence at each generation step.61% similarUnverifiedThe memory retrieval of Generative Agents extracts key memories based on importance, recency, and relevance scores.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/490175API
curl https://kongchang.com/api/v1/knowledge/claims/490175MCP
get_claim(id=490175)