Unverified60% confidenceFactExact time
The Johnson-Lindenstrauss lemma guarantees that for any ε∈(0,1), as long as the target dimension k≥O(log(n)/ε²), there exists a mapping from high dimensions to k dimensions that preserves all pairwise distances within a factor of (1±ε).
2
Sources
60%
Confidence
Long-term
Relevance
7/9/2026
First Seen
Sources
Block-Sparse Featurizers: Opening the Black Box of Vision Model Neural Geometry
hackernewshackernews7/7/2026
Related Claims
Unverified一维情况下Wasserstein距离有闭式解,只需排序即可,复杂度为O(n log n)73% similarUnverifiedJohnson-Lindenstrauss引理指出在n维空间中可以找到指数级于n的近似正交向量集合72% similarUnverified一维Wasserstein-1距离等于两个累积分布函数之间面积的积分 W₁ = ∫|F_A(x) - F_B(x)|dx72% similarUnverified在n维空间中一个临界点成为局部极小值的概率约为(1/2)^n,因为要求Hessian矩阵的所有n个特征值都为正69% similarUnverified火腿三明治定理断言:在n维空间中,对于任意n个可测的物体,总存在一个(n-1)维的超平面能同时将它们逐一二等分65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/365166API
curl https://kongchang.com/api/v1/knowledge/claims/365166MCP
get_claim(id=365166)