Loading video...
Video Failed to Load
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 views • 7 months ago •via X (Twitter)
0 Comments
No comments available
Comments from the original post will appear here
