Unverified50% confidenceFactExact time
Beam Search maintains the K highest-scoring candidate sequences at each time step; K is called the beam width, and a larger beam width typically improves quality but increases computational overhead linearly.
1
Sources
50%
Confidence
Long-term
Relevance
10/4/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedMoE routers typically employ a Top-K mechanism that selects only the K highest-scoring experts for each token, with K=2 being a common configuration.56% similarUnverifiedThe value of K in Top-K should be determined through offline evaluation by measuring Recall@K at different K values on an annotated test set and finding the inflection point where the recall curve begins to flatten.54% similarUnverifiedUnder optimal move ordering, Alpha-Beta pruning can reduce the effective branching factor of the search from b to √b, which is equivalent to doubling the search depth in the same amount of time.54% similarUnverifiedThe K value for Top-K precomputation typically falls between 5 and 20, aligned with the number of suggestions displayed in the user interface, and the index size grows linearly with K.53% similarUnverifiedK折交叉验证的K通常取5或10，这在偏差-方差权衡上被实证为较优选择53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/971212API
curl https://kongchang.com/api/v1/knowledge/claims/971212MCP
get_claim(id=971212)