Rules and representations.
Knowledge is encoded in symbols, logic, search spaces, constraints and explicit procedures.
Side 13
A study of machines that perform tasks requiring representation, search, learning, prediction, generation, planning or control. The Side treats AI as a family of computational approaches rather than one technology or one historical moment.
Different paradigms solve different computational problems. Some encode knowledge explicitly; others learn patterns from examples; many modern systems combine multiple approaches.
Knowledge is encoded in symbols, logic, search spaces, constraints and explicit procedures.
Models represent uncertain states, observations and dependencies using probability.
Parameters or decision rules are inferred from examples rather than specified entirely by hand.
Multi-layer neural networks transform data through learned intermediate features.
An agent selects actions, receives feedback and learns policies that improve expected cumulative reward.
Search, rules, learned models, tools, memory and external verification can be composed into larger systems.
Two systems can solve the same task through very different representations, training procedures and computational pathways.
Learning problems differ primarily in the information available during training and the objective being optimized.
| Learning setup | Training signal | Typical objective | Example |
|---|---|---|---|
| Supervised | Inputs paired with target labels or values. | Predict the target on unseen examples. | Classifying images or estimating prices. |
| Unsupervised | Unlabeled observations. | Discover structure, density or compact representations. | Clustering or dimensionality reduction. |
| Self-supervised | Targets generated from the data itself. | Learn representations by predicting hidden or future parts. | Next-token or masked-token prediction. |
| Reinforcement | Rewards generated through interaction. | Maximize expected cumulative reward. | Game play, control and sequential decision problems. |
| Preference learning | Comparisons, rankings or evaluative feedback. | Align behavior with a learned preference signal. | Ranking responses or actions. |
Neural networks transform inputs through parameterized functions whose weights are adjusted to reduce an objective function.
What numerical representation enters?
Tokens, pixels, sensor readings or structured features must first become model-readable values.
What activations result?
Each layer combines learned weights with prior activations to produce a new representation.
How wrong was the output?
The loss function converts model behavior into an optimization signal.
Which direction reduces error?
Backpropagation efficiently propagates derivative information through the computation graph.
How large a step?
An optimizer adjusts parameters, then the process repeats across many examples.
Convolutional networks exploit locality and shared filters, especially in image-like data.
Recurrent networks carry information through a sequence using evolving hidden state.
Attention mechanisms allow elements in a sequence to condition on other elements with learned relevance weights.
Foundation models are trained broadly enough that the same underlying model can support many tasks through prompting, fine-tuning, retrieval, tools or other adaptation.
Large-scale training learns statistical structure from broad data using a generic predictive or generative objective.
The model develops internal features that can support multiple tasks without being manually specified one by one.
Additional training can make behavior more responsive to task descriptions and preferred response formats.
External information can be supplied at inference time so responses need not rely solely on parameters learned during training.
A model can call calculators, code interpreters, databases, browsers or other systems when the task benefits from external capability.
Models can be trained across text, images, audio, video or other signals, allowing information to move between modalities.
A model can produce well-formed output even when its internal prediction is unsupported. Verification and source grounding remain separate system functions.
An agentic system repeatedly observes state, chooses an action, changes the environment and evaluates what happened.
Large goals can be converted into smaller steps whose dependencies are easier to manage.
Working, episodic or external memory can preserve information that would otherwise disappear between steps.
External actions can retrieve facts, perform exact calculations or modify real systems.
A system can test outputs against constraints or evidence before proceeding.
Read, write and irreversible actions require different levels of control and verification.
Agent performance depends on external state, latency, interfaces, failures and the observability of consequences.
AI evaluation is multidimensional. A system can be strong on average while failing catastrophically on the exact cases that matter.
Measure success on representative tasks, not only polished examples.
Test outside memorized or highly similar training examples.
Useful systems should distinguish what they know reliably from what remains uncertain.
Small changes in wording, data quality or environment should not cause uncontrolled failure.
The objective used in training or prompting can diverge from what operators actually want.
Human adaptation, incentives, misuse, distribution shift and workflow changes belong to evaluation too.