Unverified50% confidenceFactExact time
Performer（2020）用随机正交特征将核函数分解为低秩形式实现 O(n) 复杂度
1
Sources
50%
Confidence
Long-term
Relevance
7/19/2026
First Seen
Sources
变长矩阵分类：如何为无序集合数据选择神经网络架构
Related Claims
UnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.73% similarUnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).67% similarUnverified支持向量机的对偶问题通过拉格朗日对偶性转化后，计算复杂度只依赖于样本数而非特征维度，且数据仅以内积形式出现，为核技巧提供理论基础65% similarUnverifiedNTT (Number Theoretic Transform) can reduce the complexity of polynomial multiplication from O(n²) to O(n log n).65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/558238API
curl https://kongchang.com/api/v1/knowledge/claims/558238MCP
get_claim(id=558238)