Encode
Text, images or sound are converted into numbers. A language model divides text into tokens; each token becomes a vector—an ordered list of numerical features.
A rigorous guide to learning machines—and to the precise sense in which even their creators cannot fully explain what happens inside them.
00 / THESIS
Modern AI is not supernatural, sentient by default, or literally a digital brain. It is a family of mathematical systems that use data to adjust parameters so that inputs are mapped to useful outputs. Every multiplication can be recorded. Yet the resulting computation is distributed across billions of interacting numerical parameters, making a faithful human-scale explanation extraordinarily difficult.
01 / THE MECHANISM
Text, images or sound are converted into numbers. A language model divides text into tokens; each token becomes a vector—an ordered list of numerical features.
A neural network transforms those vectors layer by layer. During pretraining, a language model commonly estimates a probability distribution for the next token: P(xₜ | x₁…xₜ₋₁).
A loss function quantifies prediction error. Cross-entropy penalizes low probability assigned to the observed answer. The objective is not “understanding” directly; it is minimizing this measurable error.
Backpropagation applies the chain rule to compute how each parameter affected the loss. An optimizer nudges parameters in directions expected to reduce future error.
θ parameters · η learning rate · ∇L loss gradient
02 / INSIDE A TRANSFORMER
The Transformer, introduced by Vaswani and colleagues in 2017, lets each token calculate which other tokens are relevant to its current representation.
What information is this position seeking?
What information does each position advertise?
What content should be retrieved if relevant?
Multi-head attention repeats this operation in parallel, while feed-forward layers transform each position. Residual connections and normalization stabilize information flow. Repetition across many layers yields context-sensitive representations.
03 / THREE PHASES
Exposure to large corpora teaches statistical regularities: syntax, associations, styles, facts and some reusable procedures. Knowledge is compressed into parameters rather than stored as a conventional database.
Instruction examples, preference feedback and reinforcement learning shape behavior: following requests, refusing unsafe ones and presenting answers more helpfully.
Given a prompt, the trained parameters are usually fixed. The model repeatedly computes token probabilities and selects a continuation. Temperature and sampling rules affect variability.
04 / THE INTERPRETABILITY GAP
Because “knowing how a system works” has several levels—and neural networks are transparent at some levels but opaque at others.
A concept is rarely located in one neuron. It can be encoded as a pattern across many units; one unit may also participate in many concepts. This “superposition” makes clean decomposition difficult.
Billions of parameters interact through repeated nonlinear transformations. Local inspection does not readily reveal global function—just as listing every synaptic weight would not explain a human belief.
Engineers specify the architecture and objective, but do not hand-code the internal abstractions. Optimization finds representations that work, without requiring them to match human categories.
“Interpretability” can mean simulating a model, identifying influential inputs, finding internal circuits, or giving a causal account. These goals differ, and a plausible story is not necessarily a faithful explanation.
05 / CONSEQUENCES
A language model is optimized to produce probable or preferred continuations—not to maintain a guaranteed, continuously verified world model. It may therefore generate a fluent falsehood, inherit bias from data, fail under unfamiliar conditions, or offer a persuasive post-hoc rationale.
06 / HOW SCIENCE INVESTIGATES THE BLACK BOX
Estimates which input components most affected a prediction. Useful, but often local and method-dependent.
Tests whether information—such as syntax or geography—can be decoded from internal activations.
Searches for features and circuits that causally implement computations inside a network.
Changes inputs or activations and observes the effect, moving from correlation toward causal evidence.
Attempt to decompose dense activations into more interpretable features; promising, but incomplete.
Maps capabilities and failure modes through controlled tests, red-teaming and out-of-distribution trials.
07 / SYNTHESIS
AI is engineered mathematics whose detailed computation is visible, but whose learned conceptual organization is only partially understood.
It learns
by adjusting parameters to reduce error over examples.
It represents
information as distributed, context-sensitive numerical patterns.
It generates
by iteratively predicting outputs conditional on prior context.
It remains opaque
because scale, nonlinearity and emergent features resist compact causal explanation.
08 / ESSENTIAL VOCABULARY
A parameterized mathematical function that maps inputs to outputs.
A learned numerical value—often called a weight—that shapes the model’s computation.
A vector representation in which geometrical relations can encode useful similarities and distinctions.
The appearance of system-level behavior not transparently described by inspecting individual components. The term does not imply the behavior is inexplicable or supernatural.
Usage varies. Interpretability often concerns understanding internal mechanisms; explainability often includes post-hoc accounts of individual outputs. Neither guarantees causal faithfulness.
09 / SELECTED REFERENCES
This explainer distinguishes settled mechanisms from active research questions. It uses “AI” primarily for contemporary machine-learning systems and language models; symbolic AI, robotics and other paradigms operate differently.