Theory ofIntelligence

Decode

Artificialintelligence.

From First Principles.

A university-grade, open curriculum spanning modern Python architecture, vector geometry, deep neural compute graphs, generative LLMs, and scalable production systems.

350+
Interactive Lessons
10
Curriculum Tracks
33+
Visual Workstations
0.0s
Setup Friction

The Three-Stage Learning Journey

From elementary bedrock and vector geometry to self-attention and production infrastructure.

01Stage 1

Build the Bedrock

Inspect CPython heap layouts, pointer arrays, matrix vector geometry, and data transformation pipelines without black boxes.

Tracks 01, 02 & 03
02Stage 2

Derive Neural Graphs

Construct reverse-mode automatic differentiation from scratch, implement self-attention matrices, and optimize loss functions.

Tracks 04, 05 & 06
03Stage 3

Scale Frontier Systems

Deploy generative RAG pipelines, quantize models for edge serving, configure Linux daemons, and manage GPU inference budgets.

Tracks 07, 08, 09 & 10

Curriculum Tracks

Select a track to inspect core competencies, time investment, and lesson scope.

01•TRACK 01 • FOUNDATIONS•32 UNITS · 18 HOURS · IN-BROWSER PYODIDE

Python Architecture & Computational Bedrock

Master Python from first principles. Inspect CPython memory layouts, PyObject pointer arrays, reference counting, memory-efficient generators, and asynchronous concurrency.

✓PyObject memory allocation & reference counting garbage collection
✓Dunder protocols (__iter__, __next__, __getitem__, __call__)
✓Asyncio event loops, coroutine mechanics, and thread pools
02•TRACK 02 • MATHEMATICAL FOUNDATIONS•28 UNITS · 22 HOURS · MATRIX CALCULUS

Linear Algebra & Geometric Spaces for AI

Develop intuitive geometric mastery over vector spaces, dot products, projections, matrix transformations, eigenvalues, Singular Value Decomposition (SVD), and multivariate gradients.

✓Vector spaces, basis spans, and geometric orthogonal projections
✓Eigenvector decompositions and SVD dimensional compression
✓Multivariate chain rule, Jacobians, and gradient descent optimization
03•TRACK 03 • DATA SYSTEMS•16 UNITS · 12 HOURS · ETL & PIPELINES

Data Handling, Ingestion & Preprocessing

Build resilient data preprocessing pipelines: feature normalization, categorical encoding, missing value imputation, schema validation, and high-throughput data loading.

✓Missing data strategies: imputation, masking, and variance preservation
✓Feature scaling, target encoding, and outlier sensitivity bounds
✓High-throughput batching and data streaming pipelines
04•TRACK 04 • STATISTICAL LEARNING•36 UNITS · 26 HOURS · CLASSICAL & MODERN

Classical Machine Learning & Loss Surfaces

Study machine learning from statistical bedrock: linear and logistic regression, decision trees, random forests, boosting ensembles, loss landscapes, and regularization bounds.

✓Ordinary least squares derivation and convex loss formulations
✓L1 Lasso vs. L2 Ridge sparsity proofs and bias-variance tradeoff
✓Ensemble mechanics: bagging, random forests, and gradient boosting
05•TRACK 05 • NEURAL ARCHITECTURES•42 UNITS · 32 HOURS · PYTORCH & COMPUTE

Deep Learning, Backpropagation & Transformers

Construct reverse-mode automatic differentiation from scratch, implement convolutional networks, and master self-attention matrices and Transformer decoder blocks.

✓Reverse-mode autograd: computational DAGs and tape backpropagation
✓2D Convolution kernels, receptive fields, and residual connections
✓Scaled dot-product attention, multi-head projections, and causal masking
06•TRACK 06 • ALGORITHMIC EFFICIENCY•24 UNITS · 16 HOURS · COMPUTATIONAL THINKING

Data Structures & Algorithmic Complexity

Understand algorithmic efficiency in production AI systems: asymptotic Big-O analysis, priority queues, binary search trees, graph traversal, and dynamic programming.

✓Asymptotic time and spatial complexity bounds (Big-O, Big-Omega)
✓Priority queues, binary heaps, and Top-K similarity retrievers
✓Graph traversals (BFS, DFS, Dijkstra) and shortest-path formulations
07•TRACK 07 • FRONTIER AI•25 UNITS · 20 HOURS · FRONTIER LLM STACK

Generative AI, Large Language Models & RAG

Implement modern LLM systems: tokenization mechanics, dense vector embeddings, semantic chunking, Retrieval-Augmented Generation (RAG), and agentic tool invocation.

✓Byte-Pair Encoding (BPE), vocabulary distributions, and temperature sampling
✓Vector embedding databases and cosine similarity search algorithms
✓RAG architectures: hybrid retrieval, re-ranking, and context synthesis
08•TRACK 08 • PRODUCTION SYSTEMS•20 UNITS · 18 HOURS · PRODUCTION ML

AI Engineering, Model Serving & MLOps

Bridge research prototypes to reliable production scale: model quantization (FP16/INT8), containerized inference serving, GPU resource management, and drift observability.

✓Post-training quantization: scale factors, zero points, and INT8 inference
✓Low-latency serving architectures and GPU memory utilization
✓Data drift detection, model evaluation loops, and system observability
09•TRACK 09 • INFRASTRUCTURE•18 UNITS · 14 HOURS · LINUX & SERVICES

Backend Engineering, Linux & Microservices

The systems engineering behind AI: Linux kernel daemons, process permissions, cron automation, asynchronous networking, and high-performance FastAPI microservices.

✓Linux shell pipelines, file permissions, and daemon management
✓Cron job automation, systemd services, and background scheduling
✓High-throughput REST and streaming endpoints with FastAPI
10•TRACK 10 • DOMAIN SPECIALIZATIONS•16 UNITS · 14 HOURS · SPECIALIZED DOMAINS

AI Specializations: Computer Vision & NLP

Apply deep neural models to specialized perception tasks: bounding-box object detection, semantic segmentation, sequence classification, and language transformers.

✓Object detection pipelines: anchor boxes, IoU, and non-max suppression
✓Semantic segmentation and spatial feature preservation
✓Sequence-to-sequence tokenizers and transformer fine-tuning
Hands-On Interactive Laboratory

Verify Mathematical Concepts Visually.

No installation or cloud billing required. Step directly into 33+ interactive workstations to explore Attention QKV heatmaps, LoRA low-rank decomposition, INT8 quantization loss, and 3D eigenvector geometry.