podcasts / The attention family / episode / question
Question

How does simplified self-attention compute context vectors without trainable weights, according to Vizuara?

Answered from Simplified self attention | The attention family series - Lecture 5 · The attention family · 2026-09-16

In Vizuara's Lecture 5, Sreedath Panat computes a context vector for one token in three steps. First he takes the dot product of that token's embedding with every embedding in the sentence, itself included, to get raw scores. He divides the scores by the square root of the embedding dimension and applies softmax so they become positive weights that sum to 1. Finally he multiplies each embedding by its weight and adds them up. No learned matrices are involved; the input embeddings do all the work.

▸In their words

“It's simple dot product.” Sreedath Panat · at 17:58 — open in the transcript →

Source: our own transcription of the episode. The full conversation is on The attention family (2026-09-16). Read the whole episode summary →

▸More from this episode

Q2What is the matrix formula for simplified self-attention, and how does it relate to Attention Is All You Need?Q3What is the difference between self-attention and Bahdanau attention?Q4Why does a word need a context vector instead of its embedding, according to Vizuara?Q5Why doesn't a token always get its highest attention score against itself?Q6Why does self-attention use softmax instead of dividing attention scores by their sum?Q7Are self-attention scores and attention weights symmetric?
Transcribe your links. Paste a YouTube, Google Drive or podcast link and WhipScribe gives you the transcript. Transcribe a link →