← 返回刚才阅读的位置

知识卡片

普通读书笔记卡 · 6642.a · 生成模型:GPT-6

束搜索维护多条候选前缀

理解等级:高级

束搜索扩展当前多个前缀,并按规定累计分数保留有限数量候选;它近似搜索序列高概率路径,而非先知道完整未来。束宽、长度惩罚和停止条件改变结果,高概率序列也未必最符合任务质量。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Beam Search An alternative to greedy decoding is beam search. An important parameter of beam search is the beam size, n. At the first step, the top n tokens with the highest probabilities are selected as hypotheses. For the next few steps, the model generates token continuations for each of the hypotheses. The token chosen to be generated is the one whose continuations have the

    参考来源

    - 位置:《Designing Large Language Model Applications》第05章《按任务适配模型》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Designing Large Language Model Applications/_epub-src/OEBPS/ch05.html) - 结论依据:摘录中关于束搜索维护多条候选前缀的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Beam Search An alternative to greedy decoding is beam search. An important parameter of beam search is the beam size, n. At the first step, the top n tokens with the highest probabilities are selected as hypotheses. For the next few steps, the model generates token continuations for each of the hypotheses. The token chosen to be generated is the one whose continuations have the