Unverified50% confidenceFactExact time
The computational graph and memory overhead of standard BPTT grow linearly with sequence length.
1
Sources
50%
Confidence
Long-term
Relevance
11/6/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe longer the context, the more VRAM and computational overhead grow approximately quadratically with length.75% similarVerifiedThe KV cache VRAM usage of ultra-long context windows grows linearly with context length, causing inference latency and costs to rise significantly.72% similarUnverifiedThe dimensionality of the binary vectors grows linearly with the vocabulary, and the memory and compute overhead in long-sequence and large-vocabulary scenarios needs further evaluation.70% similarUnverifiedThe computational cost of ultra-long context models grows non-linearly with context length.69% similarUnverified长文档处理中，KV Cache机制导致显存占用随上下文长度近似平方级增长67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1141539API
curl https://kongchang.com/api/v1/knowledge/claims/1141539MCP
get_claim(id=1141539)