Overview

AI Evolution Timeline

Start with the chapter spine for an era-level frame, then use papers, systems, data, compute, and standards to explain why the field changed direction. The selection is representative, not exhaustive.

Chapter Spine

12 Stages Form The Learning Path

Symbolic AI And Search

Early AI treated intelligence as searching for solutions in spaces governed by explicit rules, laying foundations for planning, games, and pathfinding.

View Demo 01: Search Trees / A*

Expert Systems

Expert knowledge was written as if-then rules. The systems were explainable, but acquiring knowledge and maintaining exceptions became bottlenecks.

View Demo 02: Expert System Rule Reasoning

Bayes And Statistical Learning

AI moved from deterministic rules toward uncertainty modeling, updating beliefs with evidence and gradually adopting data-driven learning.

View Demo 03: Bayesian Updating

Classical Machine Learning And Decision Boundaries

Support vector machines, tree models, and ensembles learned decision boundaries from examples, moving AI further from hand-written rules toward data-driven methods.

View Demo 04: Decision Boundaries

CNNs And Deep Vision

Convolutional networks combine visual features layer by layer, from edges and textures to shapes, using local receptive fields and shared parameters.

View Demo 05: CNN Kernels

Reinforcement Learning And Action Feedback

Systems use observations, rewards, and returns after actions to change value estimates or policies, often in combination with search and deep representations.

View Demo 06: Reinforcement Learning And Feedback

Transformer

Attention creates direct connections between tokens and became a key architecture for large language and multimodal models.

View Demo 07: Attention

Pretraining And Post-Training

Scaled pretraining produces a general base model, while instruction tuning and preference feedback further shape user-facing behavior.

View Demo 08: Foundation Model Lifecycle

LLM Systems

Large language models have powerful generation capabilities, but modern applications usually organize them with context, tools, memory, and evaluation.

View Demo 09: LLM System Map

RAG

RAG retrieves external knowledge into the context, improving factuality, freshness, and citation value.

View Demo 10: RAG Pipeline

Agent

An LLM enters a loop of planning, tool calls, observation, and revision, allowing it to execute multi-step tasks instead of only answering once.

View Demo 11: Agent Loop

Safety / Eval Feedback Loops

Red-team cases, guardrails, least privilege, human review, and regression evaluation turn a failure into a repeatable test that constrains later releases.

View Demo 12: Safety / Eval

Source-backed Milestones

27 Events Explain The Turning Points

Every event links to chapters, lineage nodes, and at least one primary paper, book, official record, or standard. Impact notes focus on downstream mechanisms without treating one event as the sole cause.

Paper

Turing Reframed Machine Intelligence as a Testable Question

Computing Machinery and Intelligence used the imitation game to discuss machine intelligence, shifting an abstract argument toward observable behavioral evidence.

Why It Matters

It did not define intelligence completely, but established a recurring AI pattern: specify the task first, then debate the evidence.

Related Lineage
Primary Sources
Turning Point

The Dartmouth Proposal Set a Shared Agenda for Artificial Intelligence

The 1955 proposal for the 1956 summer project named language, abstraction, problem solving, self-improvement, and neural nets as research problems.

Why It Matters

It gathered computing, logic, and neural research under one label while exposing the lasting tension between ambitious goals and available capability.

Related Lineage
Paper

The Perceptron Made a Classification Boundary Learnable

Rosenblatt described a probabilistic model of a hypothetical nervous system that could adjust connections from input and perform recognition.

Why It Matters

Learned weights replaced some hand-written rules, while the limits of a single layer later motivated work on multilayer representations.

Primary Sources
System

A Checkers Program Showed That Experience Could Improve Strategy

Samuel combined search, position evaluation, and learning, reporting a program that could play better checkers than its author.

Why It Matters

Machine learning became an implemented mechanism: experience could update an evaluation function and alter later search choices. This atlas does not retroactively label the early combination as the complete reinforcement-learning paradigm later formalized.

System

Shakey Connected Perception, Planning, and Action

SRI's mobile robot, researched from 1966 to 1972, could perceive its surroundings, plan routes, and rearrange simple objects.

Why It Matters

It moved graph search and planning into a constrained physical world and exposed the engineering cost of real perception and action.

Related Lineage
Primary Sources
Paper

A* Put Heuristic Minimum-Cost Search on a Formal Basis

Hart, Nilsson, and Raphael showed how domain heuristics could enter graph search and established an optimality property for a class of strategies.

Why It Matters

Search no longer meant only blind enumeration: path cost and an estimate could jointly guide expansion under explicit conditions.

Related Chapters
Related Lineage
Turning Point

The Lighthill Report Recorded Early AI Disappointment and Funding Doubt

The report argued that many early promises had not been met and highlighted combinatorial explosion as a barrier to scaling general systems.

Why It Matters

It is representative primary evidence for the first AI-winter context; this atlas treats it as one UK review, not the single cause of a global downturn.

Primary Sources
System

MYCIN Organized Domain Knowledge as Explainable Consultation Rules

MYCIN used rules, certainty factors, and explanation mechanisms for a constrained infectious-disease consultation problem.

Why It Matters

Expert systems showed the power of narrow domain knowledge while turning knowledge acquisition, exceptions, and accountability into new bottlenecks.

Related Lineage
Paper

Backpropagation Let Hidden Layers Learn Task-Relevant Representations

Rumelhart, Hinton, and Williams described repeatedly adjusting connection weights from output error.

Why It Matters

Multilayer networks could form intermediate features instead of relying only on hand-designed inputs, providing a key mechanism for the later deep-learning revival.

Related Chapters
Related Lineage
Book

Bayesian Networks Organized Uncertain Relationships as Graphs

Pearl systematized directed graphs for conditional dependence, evidence propagation, and probabilistic reasoning.

Why It Matters

Probability updating grew from an isolated formula into a structured framework combining knowledge, dependencies, and uncertainty.

Related Chapters
Related Lineage
Paper

Q-learning Gave Action-Value Learning an Incremental Update Rule

Watkins and Dayan described an incremental method for learning optimal action values and established convergence under the repeated-sampling and representation conditions stated in the paper.

Why It Matters

Outcome feedback can update state-action values without a target action at every step. The theorem does not make every reinforcement-learning method or finite teaching demo converge.

Primary Sources
Paper

SVMs Used Maximum Margins to Build Generalizable Boundaries

Cortes and Vapnik mapped inputs into high-dimensional feature spaces and used support vectors to determine a classification boundary.

Why It Matters

Classical machine learning linked optimization, boundary capacity, and generalization, becoming a major high-performance route before deep learning.

Related Chapters
Related Lineage
Primary Sources
System

Deep Blue Defeated the World Chess Champion Under Standard Match Controls

IBM's system combined specialized search, evaluation, and massive parallel computation to defeat Garry Kasparov in a six-game match in 1997.

Why It Matters

The win showed that search and compute could exceed humans in a narrow task, not that the system had acquired general intelligence.

Related Chapters
Related Lineage
Primary Sources
Paper

LeNet Brought Convolutional Networks into Real Document Pipelines

The paper compared handwriting-recognition methods and described convolutional networks plus global training in cheque-reading systems.

Why It Matters

Local connectivity and shared parameters moved from mechanisms into deployed engineering, providing reusable structure for larger vision networks.

Related Chapters
Related Lineage
Dataset

ImageNet Made Large Labeled Image Collections a Shared Data Base

ImageNet organized large-scale image data with the WordNet hierarchy, supporting object-recognition training and comparable evaluation.

Why It Matters

Data scale and a common task made progress measurable and prepared the conditions for a compute-intensive deep-vision race.

Related Chapters
Related Lineage
Compute Shift

AlexNet Combined Deep CNNs, ImageNet, and GPU Scale

The 2012 system trained a deep convolutional network on about 1.2 million images with an efficient GPU implementation and sharply reduced ImageNet error.

Why It Matters

When algorithm, data, and compute arrived together, deep learning shifted from a long-running research route to mainstream vision engineering.

Related Chapters
Related Lineage
Paper

DQN Connected Deep Visual Representations to Q-learning Control

The paper used a deep convolutional network, experience replay, and Q-learning to learn control policies for multiple Atari games from pixel input.

Why It Matters

Deep representations let value learning handle high-dimensional sensory input, while Atari results did not establish general intelligence or reliable real-world control.

System

AlphaGo Combined Deep Networks, Self-Play, and Tree Search

The system combined policy networks trained with supervised and reinforcement learning, value networks, and Monte Carlo tree search.

Why It Matters

It showed that learned representations and classical search can cooperate rather than replace one another; reinforcement learning did not produce the result in isolation from supervised learning and search.

Paper

The Transformer Replaced the Recurrent Sequence Backbone with Attention

The paper proposed a sequence-transduction architecture based only on attention, removing recurrence and convolution while improving training parallelism.

Why It Matters

Direct token connections and parallel training became key structural preconditions for scaling foundation models.

Primary Sources
Paper

Language-Model Scaling Laws Quantified Scale Against Training Loss

Within the study's scope, cross-entropy loss followed power-law relationships with model size, dataset size, and training compute.

Why It Matters

Scaling became a measurable engineering direction, while lower training loss alone did not establish reliability, safety, or alignment with user intent.

Related Lineage
Primary Sources
Paper

GPT-3 Showed In-Text Task Adaptation at Language-Model Scale

The 175-billion-parameter model performed many tasks from instructions and examples in its prompt without updating its weights.

Why It Matters

The capability interface shifted partly from task-specific fine-tuning to general text interaction, increasing the importance of data, evaluation, and system constraints.

Primary Sources
Paper

RAG Combined Parametric and Retrievable External Memory

RAG used a neural retriever over a dense Wikipedia index and conditioned generation on retrieved passages.

Why It Matters

Knowledge updates, provenance, and generation could become separate system components instead of putting every fact into model parameters.

Related Chapters
Related Lineage
Paper

FLAN Showed Zero-Shot Transfer from Cross-Task Instruction Tuning

The study further tuned a pretrained language model on tasks described by natural-language instructions and evaluated zero-shot performance on unseen tasks.

Why It Matters

Post-training began to shape behavior around recognizing requests and following task formats instead of only enlarging the pretrained model.

Related Lineage
Paper

InstructGPT Used Demonstrations, Rankings, and Human Feedback to Shape Assistant Behavior

The study first used labeler demonstrations for supervised fine-tuning, then used candidate-output rankings to train a reward model and optimized the policy further with PPO.

Why It Matters

Preferences under specific tasks, labeling instructions, and evaluation distributions shaped behavior, while the paper documented simple mistakes and unresolved limits. Preferences are not universal truth, and RLHF is not all post-training.

Paper

ReAct Interleaved Reasoning Traces with Environment Actions

The method alternated language-model reasoning, calls to external sources, observations, and plan updates.

Why It Matters

An agent's core is not merely producing a plan; observations must keep changing the next action.

Related Chapters
Related Lineage
Standard

NIST AI RMF Organized Risk Governance as Continuous Functions

AI RMF 1.0 organized lifecycle risk management into Govern, Map, Measure, and Manage functions.

Why It Matters

Safety and reliability expanded from one-time testing into an organizational process spanning design, deployment, monitoring, and review.

Related Chapters
Related Lineage
Primary Sources
Standard

NIST Added a Dedicated Risk Profile for Generative AI

The Generative AI Profile mapped red teaming, incident records, ongoing evaluation, and treatment of risk onto the AI RMF.

Why It Matters

Release gates for modern generative systems need repeatable evidence and ongoing monitoring; one passing run cannot prove that risk is gone.

Related Chapters
Related Lineage
Primary Sources