
Tech • AI • Robotics • Game
Transformer language models generate text by predicting the next token from context, using embeddings, self-attention, layered neural blocks, large-scale pre-training, instruction-focused post-training, and KV cache for efficient inference.
Modern language models do not compose an answer all at once. They generate text one token at a time, repeatedly using the text already produced to predict what should come next. This is an advanced form of autocomplete: each step produces a probability distribution over possible next tokens, then one token is selected and appended.
Text must first be split into pieces called tokens. In the simplest setup, each character is a token, producing a small vocabulary of about 65 unique symbols for English text with punctuation and spaces. Real systems usually use subword tokenization, often through BPE, allowing common words to remain whole while rarer words are split into reusable parts.
A primitive language model can be built by counting which token tends to follow another token, then converting those counts into probabilities. It can also use sampling rather than always choosing the most likely result, and temperature can make output more predictable or more random. But this approach fails when longer context is needed because the number of possible histories explodes: with 65 possible characters and 10 positions of history, there are roughly 1.3 quintillion combinations.
Instead of treating tokens only as IDs, transformer models map each token to a vector called an embedding. These vectors are learned parameters, stored in an embedding matrix, and allow tokens used in similar ways to end up near one another in a latent space. Training adjusts these vectors by minimizing loss through gradient descent, so the model gradually becomes better at predicting the next token.
A fixed embedding cannot capture that a word such as bank means different things in different sentences. Self-attention solves this by letting each token look at other tokens in the same sequence and decide which ones matter most. Each token produces a query, key, and value; query-key comparisons create attention scores, softmax turns them into weights, and the weighted values are combined into a context-aware representation.
During training and generation, a model must not look ahead at future tokens, so causal masking blocks attention to later positions. Transformers also use multi-head attention, meaning several attention mechanisms run in parallel with different learned weights. That lets one head focus on one relationship while another tracks something else, improving the model’s ability to represent grammar, reference, and meaning at the same time.
Attention alone does not know token order, so models add positional encoding to embeddings. The resulting vectors pass through repeated transformer blocks combining attention, a feed-forward network, residual connections, and layer normalization. Stacking these blocks allows information to be refined over many rounds, turning local token vectors into rich contextual representations.
Large models are first built through pre-training on massive corpora of text and code, where they learn broad statistical patterns of language, facts, and style by next-token prediction. That alone does not make them useful assistants. Post-training, including supervised fine-tuning and preference-based methods, teaches the model to follow instructions, produce helpful responses, and behave more consistently in interactive settings.
At inference time, the model’s weights no longer change. It tokenizes the prompt, computes probabilities for the next token, chooses one, and repeats. To avoid recomputing old attention information for every new token, systems store prior keys and values in a KV cache, which greatly speeds generation for long prompts and long outputs.
A model with 7 billion parameters contains about 7 billion learned numbers. At 16-bit precision, that is roughly 14 GB just for weights; 70 billion parameters require about 140 GB. Quantization reduces this by storing weights in 8-bit or 4-bit form, while context window measures how many tokens can be considered at once. Because standard attention scales roughly with the square of sequence length, long contexts are expensive, which is why techniques such as sparse attention and mixture of experts are used to improve efficiency.
Transformers are built from a simple objective, predicting the next token, but achieve their power through learned representations, attention over context, layered computation, and massive training. The practical performance of modern systems depends as much on engineering choices such as tokenization, caching, quantization, and architecture as on the basic prediction loop itself.
Ask a question