Unverified50% confidenceFactExact time
Simply 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.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedQuicksort has an average time complexity of n log n and degrades to O(n²) in the worst case.77% similarUnverifiedFor 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.73% similarUnverifiedRNNs face the vanishing gradient problem: the longer the sequence, the longer the chain of multiplications the gradient must pass through, causing values to shrink exponentially.70% similarVerifiedRNNs process sequences in a serial manner and suffer from two major problems: vanishing gradients on long sequences and the inability to perform parallel computation.68% similarUnverifiedTo reduce prediction error to level τ, the required number of states or modes is r=Θ(log²(1/τ)), i.e., the square-logarithmic state complexity law.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1002152API
curl https://kongchang.com/api/v1/knowledge/claims/1002152MCP
get_claim(id=1002152)