Unverified50% confidenceFactExact time
根据率失真理论，若序列包含O(N)比特相关信息而隐状态只有O(d)比特容量，当N远大于d时必然产生信息丢失
1
Sources
50%
Confidence
Long-term
Relevance
8/12/2026
First Seen
Sources
Related Claims
UnverifiedSSM用固定维度d的隐状态压缩长度为N的历史序列时，根据率失真理论存在信息保留能力的理论上限，当N远大于d时必然产生信息丢失76% similarUnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).75% similarUnverified精确的 K 近邻搜索（KNN）时间复杂度为 O(n×d)，在数百万级别记忆条目下延迟不可接受，ANN 算法通过牺牲极小精度换取数量级速度提升70% similarUnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/735120API
curl https://kongchang.com/api/v1/knowledge/claims/735120MCP
get_claim(id=735120)