Unverified50% confidenceFactExact time
Random features approximate kernel functions through a finite-dimensional feature map and are a method for solving the large-scale computational bottleneck of kernel methods.
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedPerformer（2020）用随机正交特征将核函数分解为低秩形式实现 O(n) 复杂度73% similarUnverifiedWhen one component of a system already has randomness, stacking a probabilistic component on top of it exponentially amplifies debugging difficulty.68% similarUnverifiedThe experiments show that even when the model is not entirely correct and the noise is not perfect, random feature methods remain a reliable acceleration scheme for kernel methods, without needing to sacrifice much efficiency for robustness.66% similarUnverifiedRANSAC repeatedly samples minimal point sets at random to estimate a transformation model, classifying points consistent with the model as inliers, and can still reliably estimate a homography matrix when a large number of mismatches are present65% similarUnverified支持向量机的对偶问题通过拉格朗日对偶性转化后，计算复杂度只依赖于样本数而非特征维度，且数据仅以内积形式出现，为核技巧提供理论基础64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1022939API
curl https://kongchang.com/api/v1/knowledge/claims/1022939MCP
get_claim(id=1022939)