Unverified50% confidenceBenchmarkExact time
For the balanced target, the number of rounds required as measured by output-law divergence drops sharply to (e^{-ε}+o(1))log_2 ln n, i.e., the double-logarithmic scale.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor a full-support Beta(1,1)-Bernoulli target, under the output-law criterion, the exact expected cost is (e^{-ε}/2+o(1))log_2 log_2 n, achieved through rare n-round executions.77% similarUnverifiedSimply changing the definitional order of the error metric causes the number of rounds required for sampling to collapse from (log n)^2 to the log ln n scale, constituting a large asymptotic separation.73% similarUnverifiedThe Douglas-Peucker algorithm simplifies polylines by iteratively removing intermediate points whose deviation is below a threshold, with a time complexity of O(n log n).70% similarUnverified正交变换保持向量的L2范数和向量间夹角不变，正交矩阵的条件数恒为166% similarUnverifiedEven when approximating only a single fixed affine function, at a sufficiently high confidence level, the cost of the output layer must reach ((1-p)/p)ε^{-2}log(1/δ).66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1002150API
curl https://kongchang.com/api/v1/knowledge/claims/1002150MCP
get_claim(id=1002150)