Unverified50% confidenceBenchmarkExact time
For the balanced target (the uniform distribution over binary strings of even length n containing exactly n/2 ones), the minimum expected number of rounds required as measured by scheduling-averaged divergence is Θ_ε((log n)^2).
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedBalanced accuracy is calculated as the arithmetic mean of per-class recall rates and is used to address class imbalance problems.72% similarUnverifiedLLM每次调用可建模为伯努利试验，N次调用通过次数服从二项分布B(N, p)，通过率95%置信区间约为p̂ ± 1.96×√(p̂(1-p̂)/N)66% similarUnverifiedThe answer to this problem is logarithmic rather than n or n/2, reflecting the information-theoretic principle that the minimum amount of information needed to distinguish among n objects is log₂(n).66% similarUnverifiedThe repunit sequence R₁=1, R₂=11, R₃=111... produces remainders modulo an integer N that fall within only N possible values from 0 to N-1; examining the first N+1 terms guarantees two remainders are equal, and their difference is divisible by N.65% similarUnverifiedUnder the assumption of smooth conditional density models, for any β>0, selecting an appropriate sampling grid allows the average conditional KL divergence to achieve a convergence rate of Õ_p(n^(−2β/(d_x+d_y+2β))).65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1002148API
curl https://kongchang.com/api/v1/knowledge/claims/1002148MCP
get_claim(id=1002148)