知识卡片
令牌级早退要补齐层间依赖
同一序列不同token可在不同深度停止,但后续位置仍需要相应层的历史表示或K/V。复制浅层表示只是近似处理之一,须匹配具体架构;减少理论层数不保证实际内核调度更快。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 推理优化
原书出处 · 1 处
- · 查看原书依据
Token-level early exit In this approach, different tokens from the same sequence can exit at different layers. This is more complex to implement than sequence-level early exit. Similar to sequence-level early exit techniques, you can implement binary classifiers to decide whether to exit at a particular layer, but this happens at each token at each layer, instead of the entire sequence. For more details on
参考来源
- 位置:《Designing Large Language Model Applications》第09章《推理优化》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Designing Large Language Model Applications/_epub-src/OEBPS/ch09.html)
- 结论依据:摘录中关于令牌级早退要补齐层间依赖的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:Token-level early exit In this approach, different tokens from the same sequence can exit at different layers. This is more complex to implement than sequence-level early exit. Similar to sequence-level early exit techniques, you can implement binary classifiers to decide whether to exit at a particular layer, but this happens at each token at each layer, instead of the entire sequence. For more details on