Unverified50% confidenceFactExact time
The separation result generalizes to weighted fixed-count targets, as long as the weight ratios are bounded and the quota proportions are bounded away from 0 and 1, the separation holds even without permutation symmetry.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor fixed p∈(0,1) and δ<min{1/2,1-p}, under a fixed or logarithmic depth budget, the upper bound and lower bound match exactly in the accuracy exponent.68% similarUnverifiedIn zero-shot classification, the scores of all candidates sum to 1; the fewer the candidates, the larger the probability space available to each, so the threshold parameter needs to be calibrated individually based on the specific number of categories.68% similarUnverifiedWasserstein distance bypasses the label permutation problem by representing clustering partitions as probability measures and solving an optimal transport problem, measuring the minimum total cost required to transport one partition into another.67% similarUnverifiedThe residual structure makes F=0 the default option—as long as the F(x) weights are close to zero, the residual block degenerates into an identity mapping, thereby resolving the optimization difficulty of SGD in learning identity mappings.67% similarUnverifiedThe authors constructed a counting-state recursion for the balanced target that can precisely determine the minimum output divergence achievable by all causal randomized strategies under any round limit.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1002158API
curl https://kongchang.com/api/v1/knowledge/claims/1002158MCP
get_claim(id=1002158)