Unverified50% confidenceFactExact time
Beam Search maintains k candidate sequences with the highest scores at each decoding step, striking a balance between greedy decoding and exhaustive search, and can avoid local optima traps.
1
Sources
50%
Confidence
Long-term
Relevance
10/7/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedBeam search maintains k candidate paths simultaneously and can find globally better sequences, but computational overhead grows linearly with beam width.74% similarUnverifiedBeam search is a decoding algorithm commonly used in natural language generation that retains the k highest-probability candidate sequences at each step.70% similarUnverifiedFocal Search maintains a FOCAL candidate set containing all frontier nodes that satisfy the threshold w·f_min, and uses a heuristic function within this set for guided selection.70% similarUnverifiedAlpha-Beta pruning can reduce the effective branching factor of a search from b to √b under optimal ordering conditions, which is equivalent to doubling the search depth.69% similarUnverifiedTop-K检索是从向量数据库中取相似度最高的前K个片段作为候选内容67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/982823API
curl https://kongchang.com/api/v1/knowledge/claims/982823MCP
get_claim(id=982823)