Unverified50% confidenceFactExact time
Nyström sketching approximates the full kernel matrix by generating a low-rank matrix through randomly selecting m anchor points from n training samples, reducing the bottleneck from O(n^2) to O(nm).
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedPerformer（2020）用随机正交特征将核函数分解为低秩形式实现 O(n) 复杂度66% similarUnverifiedLow-rank parameterization decomposes the covariance matrix into a low-rank factor plus a diagonal matrix form, reducing the parameter count from O(d²) to O(dr).63% similarUnverifiedBarnes-Hut 优化通过空间八叉树将远距离节点群近似为单一质心，将计算复杂度从 O(N²) 降低到 O(N log N)62% similarUnverifiedThe time complexity of performing eigendecomposition on the Laplacian matrix in spectral clustering is typically O(n³), making it the most time-consuming step in the entire process.62% similarUnverifiedA complete ablation of N independent modules requires 2^N combinations; in practice, engineering commonly uses a greedy strategy of first validating each module individually before conducting higher-order combinations.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1001431API
curl https://kongchang.com/api/v1/knowledge/claims/1001431MCP
get_claim(id=1001431)