正在加载视频...
视频加载失败
Another Stanford interpretability guest lecture: Jack Merullo on "computational motifs" - the algorithmic primitives of transformers that show up again and again across circuits/tasks/models e.g. induction heads, binding vectors, helical representation comparisons, copy suppresion heads, etc. 00:53 - Intro: defining "computational motifs" 05:48 - Induction heads (a classic motif)... show more
16,634 次观看 • 7 个月前 •via X (Twitter)
0 条评论
暂无评论
原始帖子的评论将显示在这里
