Unverified50% confidenceFactExact time
For any smoothness s>0 and dimension D≥1, a ReLU network with width O(N), depth O(L), and parameter magnitude O(1) can achieve uniform approximation error (N^2L^2 log N)^{-s/D}, and no fixed relationship between width and depth is required.
1
Sources
50%
Confidence
Long-term
Relevance
10/19/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedWhen the solution domain contains a narrow channel of width w and length L (L >> w), the average number of steps required for WoS to walk from one end of the channel to the other is approximately O((L/w)²).57% similarUnverifiedBesicovitch proved that the area of a Kakeya set can be arbitrarily small or even zero, while still accommodating a unit-length needle in every direction.53% similarUnverified现代Embedding模型通常基于BERT或其变体架构，输出768维至4096维不等的稠密向量52% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1068309API
curl https://kongchang.com/api/v1/knowledge/claims/1068309MCP
get_claim(id=1068309)