Become an AI engineer
Foundations
Foundations is a unit of 48 lessons in Rabbithole's Become an AI engineer course, at levels 3 to 5.
Lessons
- Machine learning: how it works and how to build itLevel 3
- Neural networks: nodes, layers and the cost of building themLevel 3
- Deep learning: stacked layers that learn their own featuresLevel 3
- Embeddings: vectors, skip-gram and joint spacesLevel 3
- GPUs: how they run, how they fail, how to read themLevel 3
- Machine translation: from encoder-decoders to the translation pipelineLevel 3
- Overfitting and generalisationLevel 3
- Supervised learning: training on labeled examplesLevel 3
- Unsupervised learning: patterns without labelsLevel 3
- Activation functions: why networks need them and why ReLU wonLevel 3
- Chat Templates: Formatting Conversations for a ModelLevel 3
- Gradient descent: steps, mini-batches and keeping training healthyLevel 3
- Learning Curves: Reading a Training RunLevel 3
- Loss function: one number to make smallLevel 3
- Explaining a Black-Box Model: From Pairwise Slices to LIMELevel 3
- Object Detection: From Random Boxes to Learned PipelinesLevel 3
- Reinforcement learning: policies, exploration and GRPOLevel 3
- Softmax: from raw scores to probabilitiesLevel 3
- Active Learning: Choosing What Gets LabeledLevel 4
- Adam: an adaptive learning rate for every parameterLevel 3
- Autoencoders: learning by rebuilding the inputLevel 3
- Backpropagation: how gradients flow backwardLevel 3
- Convolutional neural networks: sliding filters with shared weightsLevel 3
- Curriculum Learning: Easy Examples FirstLevel 4
- Data Augmentation: More Training Data From the Data You HaveLevel 3
- Domain randomization: how the randomization gets tunedLevel 4
- Evolution Strategies: searching by sampling, selecting and refittingLevel 4
- Generative Adversarial Networks: Two Networks, One GameLevel 3
- Hyperparameters: learning rate, batch size, dropout and searchLevel 3
- Meta-Learning: Learning to Adapt FastLevel 4
- Normalisation layersLevel 3
- Policy Gradient MethodsLevel 4
- Prediction-Based ExplorationLevel 4
- Recurrent neural networks: memory, cost and the vanishing gradientLevel 3
- Regularisation through dropoutLevel 4
- Residual connections: adding the input backLevel 4
- Semi-Supervised Learning: Mean Teacher and UDALevel 4
- Temporal Difference LearningLevel 4
- Q-Learning: a table of action valuesLevel 4
- Deep Q-Learning: Stabilizing Q-Learning with a Neural NetworkLevel 4
- Information Bottleneck: what a network's layers keep and forgetLevel 5
- Memory-Augmented Neural Networks: a Controller with a Memory to Read and WriteLevel 4
- Muon: orthogonalized updates for the 2-D weightsLevel 4
- The Neural Tangent Kernel at Infinite WidthLevel 5
- Normalizing Flows: Invertible Building BlocksLevel 4
- The Reparameterization TrickLevel 4
- Variational AutoencoderLevel 4
- Wasserstein Distance: The Cost of Moving Probability MassLevel 4
Sources
These lessons draw on 48 sources. The most used: