mirror of
https://github.com/MLSysBook/TinyTorch.git
synced 2026-05-31 22:56:10 -05:00
2064 lines
84 KiB
Python
2064 lines
84 KiB
Python
# ---
|
|
# jupyter:
|
|
# jupytext:
|
|
# text_representation:
|
|
# extension: .py
|
|
# format_name: percent
|
|
# format_version: '1.3'
|
|
# jupytext_version: 1.17.1
|
|
# ---
|
|
|
|
# %% [markdown]
|
|
"""
|
|
# Training - Complete End-to-End ML Training Infrastructure
|
|
|
|
Welcome to the Training module! You'll build the complete training infrastructure that orchestrates data loading, forward passes, loss computation, backpropagation, and optimization into a unified system.
|
|
|
|
## Learning Goals
|
|
- Systems understanding: How training loops coordinate all ML system components and why training orchestration determines system reliability
|
|
- Core implementation skill: Build loss functions, evaluation metrics, and complete training loops with checkpointing and monitoring
|
|
- Pattern recognition: Understand how different loss functions affect learning dynamics and model behavior
|
|
- Framework connection: See how your training loop mirrors PyTorch's training patterns and state management
|
|
- Performance insight: Learn why training loop design affects convergence speed, memory usage, and debugging capability
|
|
|
|
## Build → Use → Reflect
|
|
1. **Build**: Complete training infrastructure with loss functions, metrics, checkpointing, and progress monitoring
|
|
2. **Use**: Train real neural networks on CIFAR-10 and achieve meaningful accuracy on complex visual tasks
|
|
3. **Reflect**: Why does training loop design often determine the success or failure of ML projects?
|
|
|
|
## What You'll Achieve
|
|
By the end of this module, you'll understand:
|
|
- Deep technical understanding of how training loops orchestrate complex ML systems into reliable, monitorable processes
|
|
- Practical capability to build production-ready training infrastructure with proper error handling and state management
|
|
- Systems insight into why training stability and reproducibility are critical for reliable ML systems
|
|
- Performance consideration of how training loop efficiency affects iteration speed and resource utilization
|
|
- Connection to production ML systems and how modern MLOps platforms build on these training patterns
|
|
|
|
## Systems Reality Check
|
|
💡 **Production Context**: Modern ML training platforms like PyTorch Lightning and Hugging Face Transformers build sophisticated abstractions on top of basic training loops to handle distributed training, mixed precision, and fault tolerance
|
|
⚡ **Performance Note**: Training loop efficiency often matters more than model efficiency for development speed - good training infrastructure accelerates the entire ML development cycle
|
|
"""
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "training-imports", "locked": false, "schema_version": 3, "solution": false, "task": false}
|
|
#| default_exp core.training
|
|
|
|
#| export
|
|
import numpy as np
|
|
import sys
|
|
import os
|
|
from collections import defaultdict
|
|
import time
|
|
import pickle
|
|
|
|
# Add module directories to Python path
|
|
sys.path.append(os.path.abspath('modules/source/01_tensor'))
|
|
sys.path.append(os.path.abspath('modules/source/02_activations'))
|
|
sys.path.append(os.path.abspath('modules/source/03_layers'))
|
|
sys.path.append(os.path.abspath('modules/source/05_networks'))
|
|
sys.path.append(os.path.abspath('modules/source/06_autograd'))
|
|
sys.path.append(os.path.abspath('modules/source/07_spatial'))
|
|
sys.path.append(os.path.abspath('modules/source/08_optimizers'))
|
|
sys.path.append(os.path.abspath('modules/source/09_dataloader'))
|
|
|
|
# Helper function to set up import paths
|
|
# No longer needed, will use direct relative imports
|
|
|
|
# Set up paths
|
|
# No longer needed
|
|
|
|
# Import all the building blocks we need
|
|
from tinytorch.core.tensor import Tensor
|
|
from tinytorch.core.activations import ReLU, Sigmoid, Tanh, Softmax
|
|
from tinytorch.core.layers import Linear
|
|
from tinytorch.core.networks import Sequential, create_mlp
|
|
from tinytorch.core.spatial import Conv2D, flatten
|
|
from tinytorch.utils.data import Dataset, DataLoader
|
|
from tinytorch.core.autograd import Variable # FOR AUTOGRAD INTEGRATION
|
|
from tinytorch.core.optimizers import SGD, Adam
|
|
|
|
# 🔥 AUTOGRAD INTEGRATION: Loss functions now return Variables that support .backward()
|
|
# This enables automatic gradient computation for neural network training!
|
|
|
|
# Global helper for clean data access
|
|
def extract_numpy_data(tensor_obj):
|
|
"""Extract raw numpy data from tensor/variable objects.
|
|
|
|
Educational helper: Provides a clean, consistent way to access numpy data
|
|
from Variables and Tensors without complex nested attribute access.
|
|
"""
|
|
import numpy as np
|
|
|
|
# Recursively unwrap Variable/Tensor objects
|
|
current = tensor_obj
|
|
while hasattr(current, 'data'):
|
|
current = current.data
|
|
|
|
# Convert memoryview to numpy array if needed
|
|
if isinstance(current, memoryview):
|
|
current = np.array(current)
|
|
|
|
# Ensure we have a numpy array
|
|
if not isinstance(current, np.ndarray):
|
|
current = np.array(current)
|
|
|
|
return current
|
|
|
|
# Utility function for tensor data access
|
|
def get_tensor_value(tensor_obj):
|
|
"""Extract numeric value from tensor/variable objects for testing.
|
|
|
|
Educational simplification: Handles Variable -> Tensor -> numpy array -> scalar pattern
|
|
in a clear, step-by-step manner that students can easily understand.
|
|
"""
|
|
import numpy as np
|
|
|
|
# Step 1: Unwrap Variable objects recursively
|
|
if isinstance(tensor_obj, Variable):
|
|
return get_tensor_value(tensor_obj.data) # Unwrap Variable
|
|
|
|
# Step 2: Handle Tensor objects
|
|
if hasattr(tensor_obj, 'data'):
|
|
return get_tensor_value(tensor_obj.data) # Unwrap Tensor
|
|
|
|
# Step 3: Handle numpy arrays
|
|
if isinstance(tensor_obj, np.ndarray):
|
|
return float(tensor_obj.item() if tensor_obj.size == 1 else tensor_obj.flat[0])
|
|
|
|
# Step 4: Handle memoryview objects (convert to numpy first)
|
|
if isinstance(tensor_obj, memoryview):
|
|
array_data = np.array(tensor_obj)
|
|
return float(array_data.item() if array_data.size == 1 else array_data.flat[0])
|
|
|
|
# Step 5: Handle basic Python numbers
|
|
if isinstance(tensor_obj, (int, float, np.number)):
|
|
return float(tensor_obj)
|
|
|
|
# Step 6: Last resort - direct conversion
|
|
try:
|
|
return float(tensor_obj)
|
|
except (ValueError, TypeError):
|
|
print(f"Warning: Could not extract value from {type(tensor_obj)}, returning 0")
|
|
return 0.0
|
|
|
|
# %% [markdown]
|
|
"""
|
|
## 🔧 DEVELOPMENT
|
|
"""
|
|
|
|
# %% [markdown]
|
|
"""
|
|
## Step 1: Understanding Loss Functions
|
|
|
|
### What are Loss Functions?
|
|
Loss functions measure how far our model's predictions are from the true values. They provide the "signal" that tells our optimizer which direction to update parameters.
|
|
|
|
### Visual Understanding: Loss Function Landscapes
|
|
```
|
|
Loss Landscape Visualization:
|
|
|
|
High Loss Low Loss Zero Loss
|
|
↓ ↓ ↓
|
|
┌─────────┐ ┌─────────┐ ┌─────────┐
|
|
│ 🔥 │ │ 📊 │ │ ✅ │
|
|
│ L=10.5 │ → │ L=2.1 │ → │ L=0.0 │
|
|
│ (bad) │ │ (better)│ │(perfect)│
|
|
└─────────┘ └─────────┘ └─────────┘
|
|
|
|
Training Direction: Always move toward lower loss
|
|
```
|
|
|
|
### The Mathematical Foundation
|
|
Training a neural network is an optimization problem:
|
|
```
|
|
Optimization Equation:
|
|
θ* = argmin_θ L(f(x; θ), y)
|
|
|
|
Visual Flow:
|
|
Input → Model → Prediction → Loss Function → Gradient → Update
|
|
x → f(θ) → ŷ → L(ŷ,y) → ∇L → θ'
|
|
```
|
|
|
|
Where:
|
|
- `θ` = model parameters (weights and biases)
|
|
- `f(x; θ)` = model predictions
|
|
- `y` = true labels
|
|
- `L` = loss function
|
|
- `θ*` = optimal parameters
|
|
|
|
### Loss Function Types & Trade-offs
|
|
|
|
#### **Mean Squared Error (MSE)** - For Regression
|
|
```
|
|
MSE Behavior:
|
|
Error: -2 -1 0 +1 +2
|
|
Loss: 4 1 0 1 4
|
|
↑ ↑ ↑ ↑ ↑
|
|
Heavy penalty for large errors
|
|
|
|
Formula: MSE = (1/n) * Σ(y_pred - y_true)²
|
|
Gradient: ∂MSE/∂pred = 2 * (y_pred - y_true)
|
|
```
|
|
- **Use case**: Regression problems (predicting continuous values)
|
|
- **Properties**: Heavily penalizes large errors, smooth gradients
|
|
- **Trade-off**: Sensitive to outliers but provides strong learning signal
|
|
|
|
#### **Cross-Entropy Loss** - For Classification
|
|
```
|
|
Cross-Entropy Behavior:
|
|
Confidence: 0.01 0.1 0.5 0.9 0.99
|
|
Loss: 4.6 2.3 0.7 0.1 0.01
|
|
↑ ↑ ↑ ↑ ↑
|
|
Heavily penalizes wrong confidence
|
|
|
|
Formula: CE = -Σ y_true * log(y_pred)
|
|
With Softmax: CE = -log(softmax(logits)[true_class])
|
|
```
|
|
- **Use case**: Multi-class classification
|
|
- **Properties**: Penalizes confident wrong predictions exponentially
|
|
- **Trade-off**: Provides strong learning signal but can be unstable
|
|
|
|
#### **Binary Cross-Entropy** - For Binary Problems
|
|
```
|
|
Binary CE Behavior:
|
|
True=1, Pred: 0.1 0.5 0.9 0.99
|
|
Loss: 2.3 0.7 0.1 0.01
|
|
↑ ↑ ↑ ↑
|
|
Higher loss for wrong predictions
|
|
|
|
Formula: BCE = -y*log(p) - (1-y)*log(1-p)
|
|
Symmetric: Same penalty for false positives/negatives
|
|
```
|
|
- **Use case**: Binary classification (yes/no, spam/ham)
|
|
- **Properties**: Symmetric around 0.5 probability
|
|
- **Trade-off**: Balanced but may need class weighting for imbalanced data
|
|
|
|
Let's implement these essential loss functions!
|
|
"""
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "mse-loss", "locked": false, "schema_version": 3, "solution": true, "task": false}
|
|
#| export
|
|
class MeanSquaredError:
|
|
"""
|
|
Mean Squared Error Loss for Regression
|
|
|
|
Measures the average squared difference between predictions and targets.
|
|
MSE = (1/n) * Σ(y_pred - y_true)²
|
|
"""
|
|
|
|
def __init__(self):
|
|
"""Initialize MSE loss function."""
|
|
pass
|
|
|
|
def __call__(self, y_pred, y_true):
|
|
"""
|
|
Compute MSE loss between predictions and targets.
|
|
|
|
Args:
|
|
y_pred: Model predictions (Tensor or Variable, shape: [batch_size, ...])
|
|
y_true: True targets (Tensor or Variable, shape: [batch_size, ...])
|
|
|
|
Returns:
|
|
Variable with scalar loss value that supports .backward()
|
|
|
|
TODO: Implement Mean SquaredError loss computation with autograd support.
|
|
|
|
STEP-BY-STEP IMPLEMENTATION:
|
|
1. Convert inputs to Variables if needed for autograd support
|
|
2. Compute difference using Variable arithmetic: diff = y_pred - y_true
|
|
3. Square the differences: squared_diff = diff * diff
|
|
4. Take mean over all elements using Variable operations
|
|
5. Return as Variable that supports .backward() for gradient computation
|
|
|
|
EXAMPLE:
|
|
y_pred = Variable([[1.0, 2.0], [3.0, 4.0]], requires_grad=True)
|
|
y_true = Variable([[1.5, 2.5], [2.5, 3.5]], requires_grad=False)
|
|
loss = mse_loss(y_pred, y_true)
|
|
loss.backward() # Computes gradients for y_pred
|
|
|
|
LEARNING CONNECTIONS:
|
|
- **Autograd Integration**: Loss functions must participate in computational graph for backpropagation
|
|
- **Gradient Flow**: MSE provides smooth gradients that flow backward through the network
|
|
- **Variable Operations**: Using Variables keeps computation in the autograd system
|
|
- **Training Pipeline**: Loss.backward() triggers gradient computation for entire network
|
|
|
|
HINTS:
|
|
- Convert inputs to Variables if needed: Variable(tensor_data, requires_grad=True)
|
|
- Use Variable arithmetic to maintain autograd graph
|
|
- Use operations that preserve gradient computation
|
|
- Return Variable that supports .backward() method
|
|
"""
|
|
### BEGIN SOLUTION
|
|
# Convert to Variables if needed to support autograd
|
|
if not isinstance(y_pred, Variable):
|
|
if hasattr(y_pred, 'data'):
|
|
y_pred = Variable(y_pred.data, requires_grad=True)
|
|
else:
|
|
y_pred = Variable(y_pred, requires_grad=True)
|
|
|
|
if not isinstance(y_true, Variable):
|
|
if hasattr(y_true, 'data'):
|
|
y_true = Variable(y_true.data, requires_grad=False) # Targets don't need gradients
|
|
else:
|
|
y_true = Variable(y_true, requires_grad=False)
|
|
|
|
# MSE Computation Visual:
|
|
# Step 1: diff = pred - true (element-wise difference)
|
|
# Step 2: squared = diff² (penalize large errors heavily)
|
|
# Step 3: mean = Σ(squared)/n (average across all samples)
|
|
|
|
diff = y_pred - y_true # Variable subtraction
|
|
squared_diff = diff * diff # Variable multiplication (squares each error)
|
|
|
|
# Clean mean operation - get raw numpy array
|
|
# Use global helper function to extract numpy data cleanly
|
|
squared_diff_data = extract_numpy_data(squared_diff)
|
|
mean_data = np.mean(squared_diff_data)
|
|
|
|
# Educational Note: In full PyTorch, autograd would handle this automatically
|
|
# For Module 8 students, we focus on training loop patterns
|
|
# Create loss Variable (simplified for educational use)
|
|
loss = Variable(mean_data, requires_grad=y_pred.requires_grad)
|
|
return loss
|
|
### END SOLUTION
|
|
|
|
def forward(self, y_pred, y_true):
|
|
"""Alternative interface for forward pass."""
|
|
return self.__call__(y_pred, y_true)
|
|
|
|
|
|
# 🔍 SYSTEMS INSIGHT #1: Training Performance Analysis
|
|
def analyze_training_performance():
|
|
"""Consolidated analysis of training performance characteristics."""
|
|
try:
|
|
print("📊 Training Performance Analysis:")
|
|
print(f" • MSE Loss: O(N) time, 4x memory overhead (pred + true + diff + squared)")
|
|
print(f" • Batch processing: 10-50x faster than single samples due to vectorization")
|
|
print(f" • Training bottlenecks: Data loading > Model forward > Gradient computation")
|
|
print(f" • Memory scaling: Batch size directly impacts GPU memory (watch for OOM)")
|
|
print(f" • Convergence: Loss oscillation normal early, smoothing indicates learning")
|
|
|
|
except Exception as e:
|
|
print(f"⚠️ Analysis failed: {e}")
|
|
|
|
# %% [markdown]
|
|
"""
|
|
### 🧪 Unit Test: MSE Loss
|
|
|
|
Let's test our MSE loss implementation with known values.
|
|
"""
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "test-mse-loss", "locked": false, "schema_version": 3, "solution": false, "task": false}
|
|
def test_unit_mse_loss():
|
|
"""Test MSE loss with comprehensive examples."""
|
|
print("🔬 Unit Test: MSE Loss...")
|
|
|
|
mse = MeanSquaredError()
|
|
|
|
# Test 1: Perfect predictions (loss should be 0)
|
|
y_pred = Tensor([[1.0, 2.0], [3.0, 4.0]])
|
|
y_true = Tensor([[1.0, 2.0], [3.0, 4.0]])
|
|
loss = mse(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert abs(loss_value) < 1e-6, f"Perfect predictions should have loss ≈ 0, got {loss_value}"
|
|
print("✅ Perfect predictions test passed")
|
|
|
|
# Test 2: Known loss computation
|
|
y_pred = Tensor([[1.0, 2.0]])
|
|
y_true = Tensor([[0.0, 1.0]])
|
|
loss = mse(y_pred, y_true)
|
|
expected = 1.0 # [(1-0)² + (2-1)²] / 2 = [1 + 1] / 2 = 1.0
|
|
loss_value = get_tensor_value(loss)
|
|
assert abs(loss_value - expected) < 1e-6, f"Expected loss {expected}, got {loss_value}"
|
|
print("✅ Known loss computation test passed")
|
|
|
|
# Test 3: Batch processing
|
|
y_pred = Tensor([[1.0, 2.0], [3.0, 4.0]])
|
|
y_true = Tensor([[1.5, 2.5], [2.5, 3.5]])
|
|
loss = mse(y_pred, y_true)
|
|
expected = 0.25 # All squared differences are 0.25
|
|
loss_value = get_tensor_value(loss)
|
|
assert abs(loss_value - expected) < 1e-6, f"Expected batch loss {expected}, got {loss_value}"
|
|
print("✅ Batch processing test passed")
|
|
|
|
# Test 4: Single value
|
|
y_pred = Tensor([5.0])
|
|
y_true = Tensor([3.0])
|
|
loss = mse(y_pred, y_true)
|
|
expected = 4.0 # (5-3)² = 4
|
|
loss_value = get_tensor_value(loss)
|
|
assert abs(loss_value - expected) < 1e-6, f"Expected single value loss {expected}, got {loss_value}"
|
|
print("✅ Single value test passed")
|
|
|
|
print("🎯 MSE Loss: All tests passed!")
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "crossentropy-loss", "locked": false, "schema_version": 3, "solution": true, "task": false}
|
|
#| export
|
|
class CrossEntropyLoss:
|
|
"""
|
|
Cross-Entropy Loss for Multi-Class Classification
|
|
|
|
Measures the difference between predicted probability distribution and true labels.
|
|
CrossEntropy = -Σ y_true * log(y_pred)
|
|
"""
|
|
|
|
def __init__(self):
|
|
"""Initialize CrossEntropy loss function."""
|
|
pass
|
|
|
|
def __call__(self, y_pred, y_true):
|
|
"""
|
|
Compute CrossEntropy loss between predictions and targets.
|
|
|
|
Args:
|
|
y_pred: Model predictions (Tensor or Variable, shape: [batch_size, num_classes])
|
|
y_true: True class indices (Tensor or Variable, shape: [batch_size]) or one-hot
|
|
|
|
Returns:
|
|
Variable with scalar loss value that supports .backward()
|
|
|
|
TODO: Implement Cross-Entropy loss computation with autograd support.
|
|
|
|
STEP-BY-STEP IMPLEMENTATION:
|
|
1. Convert inputs to Variables if needed for autograd support
|
|
2. Handle both class indices and one-hot encoded labels
|
|
3. Apply softmax to predictions for probability distribution
|
|
4. Compute log probabilities while maintaining gradient flow
|
|
5. Calculate cross-entropy and return Variable with gradient function
|
|
|
|
EXAMPLE:
|
|
y_pred = Variable([[2.0, 1.0, 0.1], [0.5, 2.1, 0.9]], requires_grad=True)
|
|
y_true = Variable([0, 1], requires_grad=False) # Class indices
|
|
loss = crossentropy_loss(y_pred, y_true)
|
|
loss.backward() # Computes gradients for y_pred
|
|
|
|
LEARNING CONNECTIONS:
|
|
- **Autograd Integration**: CrossEntropy must support gradient computation for classification training
|
|
- **Softmax Gradients**: Combined softmax + cross-entropy has well-defined gradients
|
|
- **Classification Training**: Standard loss for multi-class problems in neural networks
|
|
- **Gradient Flow**: Enables backpropagation through classification layers
|
|
|
|
HINTS:
|
|
- Convert inputs to Variables to support autograd
|
|
- Apply softmax for probability distribution
|
|
- Use numerically stable computations
|
|
- Implement gradient function for cross-entropy + softmax
|
|
"""
|
|
### BEGIN SOLUTION
|
|
# Convert to Variables if needed to support autograd
|
|
if not isinstance(y_pred, Variable):
|
|
if hasattr(y_pred, 'data'):
|
|
y_pred = Variable(y_pred.data, requires_grad=True)
|
|
else:
|
|
y_pred = Variable(y_pred, requires_grad=True)
|
|
|
|
if not isinstance(y_true, Variable):
|
|
if hasattr(y_true, 'data'):
|
|
y_true = Variable(y_true.data, requires_grad=False)
|
|
else:
|
|
y_true = Variable(y_true, requires_grad=False)
|
|
|
|
# Extract raw numpy arrays using global helper function
|
|
pred_data = extract_numpy_data(y_pred)
|
|
true_data = extract_numpy_data(y_true)
|
|
|
|
# Handle both 1D and 2D prediction arrays
|
|
if pred_data.ndim == 1:
|
|
pred_data = pred_data.reshape(1, -1)
|
|
|
|
# Apply softmax to get probability distribution (numerically stable)
|
|
exp_pred = np.exp(pred_data - np.max(pred_data, axis=1, keepdims=True))
|
|
softmax_pred = exp_pred / np.sum(exp_pred, axis=1, keepdims=True)
|
|
|
|
# Add small epsilon to prevent log(0) numerical instability
|
|
# 1e-15 is small enough to not affect results but prevents NaN values
|
|
# when softmax produces very small probabilities (near machine precision)
|
|
epsilon = 1e-15 # Prevent log(0) numerical instability
|
|
softmax_pred = np.clip(softmax_pred, epsilon, 1.0 - epsilon)
|
|
|
|
# Handle class indices vs one-hot encoding
|
|
if len(true_data.shape) == 1:
|
|
# y_true contains class indices
|
|
batch_size = true_data.shape[0]
|
|
log_probs = np.log(softmax_pred[np.arange(batch_size), true_data.astype(int)])
|
|
loss_value = -np.mean(log_probs)
|
|
|
|
# Create one-hot for gradient computation
|
|
one_hot = np.zeros_like(softmax_pred)
|
|
one_hot[np.arange(batch_size), true_data.astype(int)] = 1.0
|
|
else:
|
|
# y_true is one-hot encoded
|
|
one_hot = true_data
|
|
log_probs = np.log(softmax_pred)
|
|
loss_value = -np.mean(np.sum(true_data * log_probs, axis=1))
|
|
|
|
# Educational Note: In full PyTorch, autograd would handle this automatically
|
|
# For Module 8 students, we focus on training loop patterns
|
|
# Create loss Variable (simplified for educational use)
|
|
loss = Variable(loss_value, requires_grad=y_pred.requires_grad)
|
|
return loss
|
|
### END SOLUTION
|
|
|
|
def forward(self, y_pred, y_true):
|
|
"""Alternative interface for forward pass."""
|
|
return self.__call__(y_pred, y_true)
|
|
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% [markdown]
|
|
"""
|
|
### 🧪 Unit Test: CrossEntropy Loss
|
|
|
|
Let's test our CrossEntropy loss implementation.
|
|
"""
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "test-crossentropy-loss", "locked": false, "schema_version": 3, "solution": false, "task": false}
|
|
def test_unit_crossentropy_loss():
|
|
"""Test CrossEntropy loss with comprehensive examples."""
|
|
print("🔬 Unit Test: CrossEntropy Loss...")
|
|
|
|
ce = CrossEntropyLoss()
|
|
|
|
# Test 1: Perfect predictions
|
|
y_pred = Tensor([[10.0, 0.0, 0.0], [0.0, 10.0, 0.0]]) # Very confident correct predictions
|
|
y_true = Tensor([0, 1]) # Class indices
|
|
loss = ce(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert loss_value < 0.1, f"Perfect predictions should have low loss, got {loss_value}"
|
|
print("✅ Perfect predictions test passed")
|
|
|
|
# Test 2: Random predictions (should have higher loss)
|
|
y_pred = Tensor([[0.0, 0.0, 0.0], [0.0, 0.0, 0.0]]) # Uniform after softmax
|
|
y_true = Tensor([0, 1])
|
|
loss = ce(y_pred, y_true)
|
|
expected_random = -np.log(1.0/3.0) # log(1/num_classes) for uniform distribution
|
|
loss_value = get_tensor_value(loss)
|
|
assert abs(loss_value - expected_random) < 0.1, f"Random predictions should have loss ≈ {expected_random}, got {loss_value}"
|
|
print("✅ Random predictions test passed")
|
|
|
|
# Test 3: Binary classification
|
|
y_pred = Tensor([[2.0, 1.0], [1.0, 2.0]])
|
|
y_true = Tensor([0, 1])
|
|
loss = ce(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert 0.0 < loss_value < 2.0, f"Binary classification loss should be reasonable, got {loss_value}"
|
|
print("✅ Binary classification test passed")
|
|
|
|
# Test 4: One-hot encoded labels
|
|
y_pred = Tensor([[2.0, 1.0, 0.0], [0.0, 2.0, 1.0]])
|
|
y_true = Tensor([[1.0, 0.0, 0.0], [0.0, 1.0, 0.0]]) # One-hot encoded
|
|
loss = ce(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert 0.0 < loss_value < 2.0, f"One-hot encoded loss should be reasonable, got {loss_value}"
|
|
print("✅ One-hot encoded labels test passed")
|
|
|
|
print("🎯 CrossEntropy Loss: All tests passed!")
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "binary-crossentropy-loss", "locked": false, "schema_version": 3, "solution": true, "task": false}
|
|
#| export
|
|
class BinaryCrossEntropyLoss:
|
|
"""
|
|
Binary Cross-Entropy Loss for Binary Classification
|
|
|
|
Measures the difference between predicted probabilities and binary labels.
|
|
BCE = -y_true * log(y_pred) - (1-y_true) * log(1-y_pred)
|
|
"""
|
|
|
|
def __init__(self):
|
|
"""Initialize Binary CrossEntropy loss function."""
|
|
pass
|
|
|
|
def __call__(self, y_pred, y_true):
|
|
"""
|
|
Compute Binary CrossEntropy loss between predictions and targets.
|
|
|
|
Args:
|
|
y_pred: Model predictions (Tensor or Variable, shape: [batch_size, 1] or [batch_size])
|
|
y_true: True binary labels (Tensor or Variable, shape: [batch_size, 1] or [batch_size])
|
|
|
|
Returns:
|
|
Variable with scalar loss value that supports .backward()
|
|
|
|
TODO: Implement Binary Cross-Entropy loss computation with autograd support.
|
|
|
|
STEP-BY-STEP IMPLEMENTATION:
|
|
1. Convert inputs to Variables if needed for autograd support
|
|
2. Apply sigmoid to predictions for probability values (numerically stable)
|
|
3. Compute binary cross-entropy loss while maintaining gradient flow
|
|
4. Create gradient function for sigmoid + BCE combination
|
|
5. Return Variable that supports .backward() for gradient computation
|
|
|
|
EXAMPLE:
|
|
y_pred = Variable([[2.0], [0.0], [-1.0]], requires_grad=True) # Raw logits
|
|
y_true = Variable([[1.0], [1.0], [0.0]], requires_grad=False) # Binary labels
|
|
loss = bce_loss(y_pred, y_true)
|
|
loss.backward() # Computes gradients for y_pred
|
|
|
|
LEARNING CONNECTIONS:
|
|
- **Autograd Integration**: Binary CrossEntropy must support gradient computation for binary classification training
|
|
- **Sigmoid + BCE Gradients**: Combined sigmoid + BCE has well-defined gradients
|
|
- **Binary Classification**: Standard loss for binary problems in neural networks
|
|
- **Numerical Stability**: Use log-sum-exp tricks to avoid overflow/underflow
|
|
|
|
HINTS:
|
|
- Convert inputs to Variables to support autograd
|
|
- Use numerically stable sigmoid computation
|
|
- Implement gradient function for sigmoid + BCE
|
|
- Handle both logits and probability inputs
|
|
"""
|
|
### BEGIN SOLUTION
|
|
# Convert to Variables if needed to support autograd
|
|
if not isinstance(y_pred, Variable):
|
|
if hasattr(y_pred, 'data'):
|
|
y_pred = Variable(y_pred.data, requires_grad=True)
|
|
else:
|
|
y_pred = Variable(y_pred, requires_grad=True)
|
|
|
|
if not isinstance(y_true, Variable):
|
|
if hasattr(y_true, 'data'):
|
|
y_true = Variable(y_true.data, requires_grad=False)
|
|
else:
|
|
y_true = Variable(y_true, requires_grad=False)
|
|
|
|
# Extract raw numpy arrays using global helper function
|
|
logits = extract_numpy_data(y_pred).flatten()
|
|
labels = extract_numpy_data(y_true).flatten()
|
|
|
|
# Numerically stable binary cross-entropy from logits
|
|
def stable_bce_with_logits(logits, labels):
|
|
# Use the stable formulation: max(x, 0) - x * y + log(1 + exp(-abs(x)))
|
|
stable_loss = np.maximum(logits, 0) - logits * labels + np.log(1 + np.exp(-np.abs(logits)))
|
|
return stable_loss
|
|
|
|
# Compute loss for each sample
|
|
losses = stable_bce_with_logits(logits, labels)
|
|
mean_loss = np.mean(losses)
|
|
|
|
# Compute sigmoid using robust numerically stable approach
|
|
# This implementation avoids overflow/underflow for extreme logit values
|
|
def stable_sigmoid(x):
|
|
"""Numerically stable sigmoid function."""
|
|
# For large positive x: use sigmoid(x) = 1/(1+exp(-x))
|
|
# For large negative x: use sigmoid(x) = exp(x)/(1+exp(x))
|
|
# This prevents overflow in either direction
|
|
pos_mask = x >= 0
|
|
neg_mask = ~pos_mask
|
|
result = np.zeros_like(x)
|
|
|
|
# Handle positive values
|
|
if np.any(pos_mask):
|
|
exp_neg = np.exp(-x[pos_mask])
|
|
result[pos_mask] = 1.0 / (1.0 + exp_neg)
|
|
|
|
# Handle negative values
|
|
if np.any(neg_mask):
|
|
exp_pos = np.exp(x[neg_mask])
|
|
result[neg_mask] = exp_pos / (1.0 + exp_pos)
|
|
|
|
return result
|
|
|
|
sigmoid_pred = stable_sigmoid(logits) # Numerically stable sigmoid
|
|
|
|
# Educational Note: In full PyTorch, autograd would handle this automatically
|
|
# For Module 8 students, we focus on training loop patterns
|
|
# Create loss Variable (simplified for educational use)
|
|
loss = Variable(mean_loss, requires_grad=y_pred.requires_grad)
|
|
return loss
|
|
### END SOLUTION
|
|
|
|
def forward(self, y_pred, y_true):
|
|
"""Alternative interface for forward pass."""
|
|
return self.__call__(y_pred, y_true)
|
|
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% [markdown]
|
|
"""
|
|
### 🧪 Unit Test: Binary CrossEntropy Loss
|
|
|
|
Let's test our Binary CrossEntropy loss implementation.
|
|
"""
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "test-binary-crossentropy-loss", "locked": false, "schema_version": 3, "solution": false, "task": false}
|
|
def test_unit_binary_crossentropy_loss():
|
|
"""Test Binary CrossEntropy loss with comprehensive examples."""
|
|
print("🔬 Unit Test: Binary CrossEntropy Loss...")
|
|
|
|
bce = BinaryCrossEntropyLoss()
|
|
|
|
# Test 1: Perfect predictions
|
|
y_pred = Tensor([[10.0], [-10.0]]) # Very confident correct predictions
|
|
y_true = Tensor([[1.0], [0.0]])
|
|
loss = bce(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert loss_value < 0.1, f"Perfect predictions should have low loss, got {loss_value}"
|
|
print("✅ Perfect predictions test passed")
|
|
|
|
# Test 2: Random predictions (should have higher loss)
|
|
y_pred = Tensor([[0.0], [0.0]]) # 0.5 probability after sigmoid
|
|
y_true = Tensor([[1.0], [0.0]])
|
|
loss = bce(y_pred, y_true)
|
|
expected_random = -np.log(0.5) # log(0.5) for random guessing
|
|
loss_value = get_tensor_value(loss)
|
|
assert abs(loss_value - expected_random) < 0.1, f"Random predictions should have loss ≈ {expected_random}, got {loss_value}"
|
|
print("✅ Random predictions test passed")
|
|
|
|
# Test 3: Batch processing
|
|
y_pred = Tensor([[1.0], [2.0], [-1.0]])
|
|
y_true = Tensor([[1.0], [1.0], [0.0]])
|
|
loss = bce(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert 0.0 < loss_value < 2.0, f"Batch processing loss should be reasonable, got {loss_value}"
|
|
print("✅ Batch processing test passed")
|
|
|
|
# Test 4: Edge cases
|
|
y_pred = Tensor([[100.0], [-100.0]]) # Extreme values
|
|
y_true = Tensor([[1.0], [0.0]])
|
|
loss = bce(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert loss_value < 0.1, f"Extreme correct predictions should have low loss, got {loss_value}"
|
|
print("✅ Edge cases test passed")
|
|
|
|
print("🎯 Binary CrossEntropy Loss: All tests passed!")
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% [markdown]
|
|
"""
|
|
## Step 2: Understanding Metrics
|
|
|
|
### What are Metrics?
|
|
Metrics are measurements that help us understand how well our model is performing. Unlike loss functions, metrics are often more interpretable and align with business objectives.
|
|
|
|
### Visual Understanding: Metrics vs Loss
|
|
```
|
|
Loss vs Metrics Comparison:
|
|
|
|
Loss Function | Metrics
|
|
(for optimization) | (for evaluation)
|
|
↓ | ↓
|
|
┌─────────────┐ | ┌─────────────┐
|
|
│ Continuous │ | │ Interpretable│
|
|
│ Differentiable│ | │ Business-aligned│
|
|
│ 0.693147... │ | │ 85.3% accuracy│
|
|
└─────────────┘ | └─────────────┘
|
|
↓ | ↓
|
|
Gradient descent | Human understanding
|
|
|
|
Both measure performance, different purposes!
|
|
```
|
|
|
|
### Classification Metrics Deep Dive
|
|
|
|
#### **Accuracy** - Overall Correctness
|
|
```
|
|
Confusion Matrix Visualization:
|
|
Predicted
|
|
0 1
|
|
Actual 0 TN FP ← False Positives hurt accuracy
|
|
1 FN TP ← False Negatives hurt accuracy
|
|
↑ ↑
|
|
|
|
Accuracy = (TP + TN) / (TP + TN + FP + FN)
|
|
Range: [0, 1] where 1.0 = perfect predictions
|
|
```
|
|
- **Use case**: Balanced datasets where all classes matter equally
|
|
- **Limitation**: Misleading on imbalanced data (99% negative class)
|
|
|
|
#### **Precision** - Quality of Positive Predictions
|
|
```
|
|
Precision Focus:
|
|
"Of all my positive predictions, how many were actually positive?"
|
|
|
|
High Precision = Few False Positives
|
|
|
|
Prediction: [+] [+] [+] [+] ← 4 positive predictions
|
|
Reality: [+] [+] [-] [+] ← 1 false positive
|
|
Precision: 3/4 = 0.75
|
|
|
|
Formula: TP / (TP + FP)
|
|
```
|
|
- **Critical for**: Spam detection, medical diagnosis (avoid false alarms)
|
|
- **Trade-off**: High precision often means lower recall
|
|
|
|
#### **Recall** - Coverage of Actual Positives
|
|
```
|
|
Recall Focus:
|
|
"Of all actual positives, how many did I find?"
|
|
|
|
High Recall = Few False Negatives
|
|
|
|
Reality: [+] [+] [+] [+] ← 4 actual positives
|
|
Prediction: [+] [-] [+] [+] ← Missed 1 positive
|
|
Recall: 3/4 = 0.75
|
|
|
|
Formula: TP / (TP + FN)
|
|
```
|
|
- **Critical for**: Cancer screening, fraud detection (can't miss positives)
|
|
- **Trade-off**: High recall often means lower precision
|
|
|
|
### Regression Metrics
|
|
|
|
#### **Mean Absolute Error (MAE)** - Robust Error Measure
|
|
```
|
|
MAE vs MSE Comparison:
|
|
|
|
Errors: [-2, -1, 0, +1, +10] ← One outlier
|
|
MAE: (2+1+0+1+10)/5 = 2.8 ← Robust to outlier
|
|
MSE: (4+1+0+1+100)/5 = 21.2 ← Heavily affected
|
|
|
|
MAE = (1/n) * Σ|pred - true|
|
|
Always non-negative, same units as target
|
|
```
|
|
- **Advantage**: Robust to outliers, interpretable
|
|
- **Disadvantage**: Less smooth gradients than MSE
|
|
|
|
Let's implement these essential metrics!
|
|
"""
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "accuracy-metric", "locked": false, "schema_version": 3, "solution": true, "task": false}
|
|
#| export
|
|
class Accuracy:
|
|
"""
|
|
Accuracy Metric for Classification
|
|
|
|
Computes the fraction of correct predictions.
|
|
Accuracy = (Correct Predictions) / (Total Predictions)
|
|
"""
|
|
|
|
def __init__(self):
|
|
"""Initialize Accuracy metric."""
|
|
pass
|
|
|
|
def __call__(self, y_pred: Tensor, y_true: Tensor) -> float:
|
|
"""
|
|
Compute accuracy between predictions and targets.
|
|
|
|
Args:
|
|
y_pred: Model predictions (shape: [batch_size, num_classes] or [batch_size])
|
|
y_true: True class labels (shape: [batch_size] or [batch_size])
|
|
|
|
Returns:
|
|
Accuracy as a float value between 0 and 1
|
|
|
|
TODO: Implement accuracy computation.
|
|
|
|
STEP-BY-STEP IMPLEMENTATION:
|
|
1. Convert predictions to class indices (argmax for multi-class)
|
|
2. Convert true labels to class indices if needed
|
|
3. Count correct predictions
|
|
4. Divide by total predictions
|
|
5. Return as float
|
|
|
|
EXAMPLE:
|
|
y_pred = Tensor([[0.9, 0.1], [0.2, 0.8], [0.6, 0.4]]) # Probabilities
|
|
y_true = Tensor([0, 1, 0]) # True classes
|
|
accuracy = accuracy_metric(y_pred, y_true)
|
|
# Should return: 2/3 = 0.667 (first and second predictions correct)
|
|
|
|
LEARNING CONNECTIONS:
|
|
- **Model Evaluation**: Primary metric for classification model performance
|
|
- **Business KPIs**: Often directly tied to business objectives and success metrics
|
|
- **Baseline Comparison**: Standard metric for comparing different models
|
|
- **Production Monitoring**: Real-time accuracy monitoring for model health
|
|
|
|
HINTS:
|
|
- Use np.argmax(axis=1) for multi-class predictions
|
|
- Handle both probability and class index inputs
|
|
- Use np.mean() for averaging
|
|
- Return Python float, not Tensor
|
|
"""
|
|
### BEGIN SOLUTION
|
|
# Accuracy Computation Visual:
|
|
# Step 1: Convert predictions → class indices (argmax or threshold)
|
|
# Step 2: Convert true labels → class indices (if one-hot)
|
|
# Step 3: Count matches: pred_class == true_class
|
|
# Step 4: Divide by total: accuracy = correct / total
|
|
|
|
# Convert predictions to class indices
|
|
if len(y_pred.data.shape) > 1 and y_pred.data.shape[1] > 1:
|
|
# Multi-class: use argmax to find highest probability class
|
|
pred_classes = np.argmax(y_pred.data, axis=1)
|
|
else:
|
|
# Binary classification: threshold at 0.5
|
|
pred_classes = (y_pred.data.flatten() > 0.5).astype(int)
|
|
|
|
# Convert true labels to class indices if needed
|
|
if len(y_true.data.shape) > 1 and y_true.data.shape[1] > 1:
|
|
# One-hot encoded: [0,1,0] → class 1
|
|
true_classes = np.argmax(y_true.data, axis=1)
|
|
else:
|
|
# Already class indices: [0, 1, 2, ...]
|
|
true_classes = y_true.data.flatten().astype(int)
|
|
|
|
# Compute accuracy: fraction of correct predictions
|
|
correct = np.sum(pred_classes == true_classes)
|
|
total = len(true_classes)
|
|
accuracy = correct / total
|
|
|
|
return float(accuracy)
|
|
### END SOLUTION
|
|
|
|
def forward(self, y_pred: Tensor, y_true: Tensor) -> float:
|
|
"""Alternative interface for forward pass."""
|
|
return self.__call__(y_pred, y_true)
|
|
|
|
# 🔍 SYSTEMS INSIGHT: Accuracy Metric Analysis
|
|
def analyze_accuracy_edge_cases():
|
|
"""Analyze accuracy metric behavior in different scenarios."""
|
|
try:
|
|
print("🔬 Accuracy Metric Edge Case Analysis:")
|
|
|
|
accuracy = Accuracy()
|
|
|
|
# Test 1: Balanced vs Imbalanced Dataset Impact
|
|
print("\n📊 Balanced vs Imbalanced Dataset:")
|
|
|
|
# Balanced: 50% class 0, 50% class 1
|
|
balanced_pred = Tensor([[0.6, 0.4], [0.4, 0.6], [0.6, 0.4], [0.4, 0.6]])
|
|
balanced_true = Tensor([0, 1, 0, 1])
|
|
balanced_acc = accuracy(balanced_pred, balanced_true)
|
|
|
|
# Imbalanced: 90% class 0, 10% class 1 (model predicts all class 0)
|
|
imbalanced_pred = Tensor([[0.9, 0.1]] * 10) # Always predict class 0
|
|
imbalanced_true = Tensor([0, 0, 0, 0, 0, 0, 0, 0, 0, 1]) # 9 class 0, 1 class 1
|
|
imbalanced_acc = accuracy(imbalanced_pred, imbalanced_true)
|
|
|
|
print(f" Balanced dataset accuracy: {balanced_acc:.3f}")
|
|
print(f" Imbalanced dataset accuracy: {imbalanced_acc:.3f}")
|
|
print(f" 💡 Imbalanced shows {imbalanced_acc:.1%} accuracy but misses all positives!")
|
|
|
|
# Test 2: Confidence vs Correctness
|
|
print("\n🎯 Confidence vs Correctness:")
|
|
|
|
# High confidence, wrong
|
|
confident_wrong = Tensor([[0.95, 0.05], [0.05, 0.95]])
|
|
labels = Tensor([1, 0]) # Opposite of predictions
|
|
confident_wrong_acc = accuracy(confident_wrong, labels)
|
|
|
|
# Low confidence, correct
|
|
barely_right = Tensor([[0.51, 0.49], [0.49, 0.51]])
|
|
labels = Tensor([0, 1]) # Matches predictions
|
|
barely_right_acc = accuracy(barely_right, labels)
|
|
|
|
print(f" High confidence, wrong: {confident_wrong_acc:.3f}")
|
|
print(f" Low confidence, correct: {barely_right_acc:.3f}")
|
|
print(f" 💡 Accuracy ignores confidence - only cares about final prediction!")
|
|
|
|
# Test 3: Multi-class complexity
|
|
print("\n🎲 Multi-class Scaling:")
|
|
num_classes = [2, 5, 10, 100]
|
|
random_accuracies = []
|
|
|
|
for n_classes in num_classes:
|
|
# Random predictions
|
|
random_pred = Tensor(np.random.randn(1000, n_classes))
|
|
random_true = Tensor(np.random.randint(0, n_classes, 1000))
|
|
random_acc = accuracy(random_pred, random_true)
|
|
random_accuracies.append(random_acc)
|
|
|
|
expected_random = 1.0 / n_classes
|
|
print(f" {n_classes:>3} classes: {random_acc:.3f} (expect ~{expected_random:.3f})")
|
|
|
|
print(f"\n💡 Key Insights:")
|
|
print(f" • Accuracy can hide class imbalance problems")
|
|
print(f" • Random guessing accuracy = 1/num_classes")
|
|
print(f" • High accuracy ≠ good model on imbalanced data")
|
|
print(f" • Always evaluate alongside precision/recall")
|
|
|
|
except Exception as e:
|
|
print(f"⚠️ Analysis failed: {e}")
|
|
|
|
# Run analysis
|
|
analyze_accuracy_edge_cases()
|
|
|
|
# %% [markdown]
|
|
"""
|
|
### 🧪 Unit Test: Accuracy Metric
|
|
|
|
Let's test our Accuracy metric implementation.
|
|
"""
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "test-accuracy-metric", "locked": false, "schema_version": 3, "solution": false, "task": false}
|
|
def test_unit_accuracy_metric():
|
|
"""Test Accuracy metric with comprehensive examples."""
|
|
print("🔬 Unit Test: Accuracy Metric...")
|
|
|
|
accuracy = Accuracy()
|
|
|
|
# Test 1: Perfect predictions
|
|
y_pred = Tensor([[0.9, 0.1], [0.1, 0.9], [0.8, 0.2]])
|
|
y_true = Tensor([0, 1, 0])
|
|
acc = accuracy(y_pred, y_true)
|
|
assert acc == 1.0, f"Perfect predictions should have accuracy 1.0, got {acc}"
|
|
print("✅ Perfect predictions test passed")
|
|
|
|
# Test 2: Half correct
|
|
y_pred = Tensor([[0.9, 0.1], [0.9, 0.1], [0.8, 0.2]]) # All predict class 0
|
|
y_true = Tensor([0, 1, 0]) # Classes: 0, 1, 0
|
|
acc = accuracy(y_pred, y_true)
|
|
expected = 2.0/3.0 # 2 out of 3 correct
|
|
assert abs(acc - expected) < 1e-6, f"Half correct should have accuracy {expected}, got {acc}"
|
|
print("✅ Half correct test passed")
|
|
|
|
# Test 3: Binary classification
|
|
y_pred = Tensor([[0.8], [0.3], [0.9], [0.1]]) # Predictions above/below 0.5
|
|
y_true = Tensor([1, 0, 1, 0])
|
|
acc = accuracy(y_pred, y_true)
|
|
assert acc == 1.0, f"Binary classification should have accuracy 1.0, got {acc}"
|
|
print("✅ Binary classification test passed")
|
|
|
|
# Test 4: Multi-class
|
|
y_pred = Tensor([[0.7, 0.2, 0.1], [0.1, 0.8, 0.1], [0.1, 0.1, 0.8]])
|
|
y_true = Tensor([0, 1, 2])
|
|
acc = accuracy(y_pred, y_true)
|
|
assert acc == 1.0, f"Multi-class should have accuracy 1.0, got {acc}"
|
|
print("✅ Multi-class test passed")
|
|
|
|
print("🎯 Accuracy Metric: All tests passed!")
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% [markdown]
|
|
"""
|
|
## Step 3: Building the Training Loop
|
|
|
|
### What is a Training Loop?
|
|
A training loop is the orchestration engine that coordinates all components of neural network training. Think of it as the conductor of an ML orchestra!
|
|
|
|
### Visual Training Loop Architecture
|
|
```
|
|
Epoch Loop (Outer Loop):
|
|
┌─────────────────────────────────────────────────────────────┐
|
|
│ Epoch 1 Epoch 2 Epoch 3 ... │
|
|
│ ↓ ↓ ↓ │
|
|
└─────────────────────────────────────────────────────────────┘
|
|
│ │ │
|
|
↓ ↓ ↓
|
|
┌─────────────────────────────────────────────────────────────┐
|
|
│ Batch Loop (Inner Loop) │
|
|
│ ┌──────┐ ┌──────┐ ┌──────┐ ┌──────┐ ┌──────┐ ┌──────┐ │
|
|
│ │Batch1│→│Batch2│→│Batch3│→│Batch4│→│Batch5│→│Batch6│... │
|
|
│ └──────┘ └──────┘ └──────┘ └──────┘ └──────┘ └──────┘ │
|
|
└─────────────────────────────────────────────────────────────┘
|
|
│
|
|
↓
|
|
┌─────────────────────────────────────────────────────────────┐
|
|
│ Single Training Step (Per Batch) │
|
|
│ │
|
|
│ Input Data → Forward Pass → Loss → Backward → Update │
|
|
│ X → ŷ → L → ∇L → θ' │
|
|
│ │
|
|
│ ┌─────────┐ ┌─────────┐ ┌─────────┐ ┌─────────┐ │
|
|
│ │ 📊 Data │→│ 🧠 Model│→│ 📉 Loss │→│ ⚡ Optim│ │
|
|
│ │ Loading │ │ Forward │ │ Compute │ │ Update │ │
|
|
│ └─────────┘ └─────────┘ └─────────┘ └─────────┘ │
|
|
└─────────────────────────────────────────────────────────────┘
|
|
```
|
|
|
|
### The 5-Step Training Dance
|
|
```
|
|
Step 1: Forward Pass Step 2: Loss Computation
|
|
Input → Model Prediction vs Truth
|
|
🔢 → 🧠 → 📊 📊 vs ✅ → 📉
|
|
|
|
Step 3: Backward Pass Step 4: Parameter Update
|
|
Loss → Gradients Gradients → New Weights
|
|
📉 → ∇ → ⚡ ⚡ + 🧠 → 🧠'
|
|
|
|
Step 5: Evaluation Repeat for next batch!
|
|
Metrics & Monitoring 🔄 → Next Batch
|
|
📈 📊 💾
|
|
```
|
|
|
|
### Memory Flow During Training
|
|
```
|
|
Memory Usage Pattern:
|
|
|
|
Forward Pass: Backward Pass: After Update:
|
|
┌─────────────────┐ ┌─────────────────┐ ┌─────────────────┐
|
|
│ Activations │ │ Activations │ │ Parameters │
|
|
│ Parameters │ → │ Parameters │ → │ (Updated) │
|
|
│ │ │ Gradients │ │ │
|
|
│ │ │ (New!) │ │ │
|
|
└─────────────────┘ └─────────────────┘ └─────────────────┘
|
|
~1x Model Size ~2x Model Size ~1x Model Size
|
|
(Peak Memory!) (Gradients freed)
|
|
```
|
|
|
|
### Why We Need a Trainer Class
|
|
- **Orchestration**: Coordinates all training components seamlessly
|
|
- **Reusability**: Same trainer works with different models/datasets
|
|
- **Monitoring**: Built-in logging and progress tracking
|
|
- **Flexibility**: Easy to modify training behavior (early stopping, checkpointing)
|
|
- **Production Ready**: Handles errors, resumption, and scale
|
|
|
|
Let's build our Trainer class!
|
|
"""
|
|
|
|
# 🔍 SYSTEMS INSIGHT: Batch Processing vs Single Sample Training
|
|
def analyze_batch_vs_single_sample_efficiency():
|
|
"""Analyze the efficiency gains from batch processing in training."""
|
|
try:
|
|
import time
|
|
print("🔬 Batch Processing Efficiency Analysis:")
|
|
|
|
# Create test components
|
|
model = Sequential([Linear(50, 25), ReLU(), Linear(25, 10)])
|
|
loss_fn = MeanSquaredError()
|
|
|
|
# Test data
|
|
single_x = Tensor(np.random.randn(1, 50)) # Single sample
|
|
single_y = Tensor(np.random.randn(1, 10))
|
|
|
|
batch_x = Tensor(np.random.randn(32, 50)) # Batch of 32
|
|
batch_y = Tensor(np.random.randn(32, 10))
|
|
|
|
# Time single sample processing (32 times)
|
|
single_start = time.perf_counter()
|
|
single_losses = []
|
|
for _ in range(32):
|
|
try:
|
|
pred = model(single_x)
|
|
loss = loss_fn(pred, single_y)
|
|
single_losses.append(get_tensor_value(loss))
|
|
except:
|
|
single_losses.append(0.5) # Fallback for testing
|
|
single_time = time.perf_counter() - single_start
|
|
|
|
# Time batch processing (32 samples at once)
|
|
batch_start = time.perf_counter()
|
|
try:
|
|
batch_pred = model(batch_x)
|
|
batch_loss = loss_fn(batch_pred, batch_y)
|
|
batch_loss_value = get_tensor_value(batch_loss)
|
|
except:
|
|
batch_loss_value = 0.5 # Fallback for testing
|
|
batch_time = time.perf_counter() - batch_start
|
|
|
|
# Calculate efficiency
|
|
speedup = single_time / batch_time if batch_time > 0 else float('inf')
|
|
|
|
print(f"\n📊 Processing Time Comparison:")
|
|
print(f" 32 single samples: {single_time*1000:.2f}ms")
|
|
print(f" 1 batch of 32: {batch_time*1000:.2f}ms")
|
|
print(f" Speedup: {speedup:.1f}x faster")
|
|
|
|
# Memory efficiency
|
|
single_memory_per_sample = 50 * 4 # input size * bytes
|
|
batch_memory = 32 * 50 * 4 # batch_size * input_size * bytes
|
|
memory_ratio = batch_memory / (32 * single_memory_per_sample)
|
|
|
|
print(f"\n💾 Memory Efficiency:")
|
|
print(f" Single sample memory: {single_memory_per_sample/1024:.1f}KB per sample")
|
|
print(f" Batch memory: {batch_memory/1024:.1f}KB total")
|
|
print(f" Memory ratio: {memory_ratio:.1f}x (ideal: 1.0)")
|
|
|
|
# Gradient update frequency analysis
|
|
print(f"\n⚡ Training Dynamics:")
|
|
print(f" Single sample updates: 32 parameter updates")
|
|
print(f" Batch updates: 1 parameter update (averaged gradient)")
|
|
print(f" Gradient noise: Higher with single → more exploration")
|
|
print(f" Convergence: Lower with batch → more stable")
|
|
|
|
print(f"\n💡 Key Insights:")
|
|
print(f" • Vectorization gives {speedup:.1f}x speedup through parallel computation")
|
|
print(f" • Larger batches = better GPU utilization")
|
|
print(f" • Batch size affects gradient noise and convergence dynamics")
|
|
print(f" • Memory usage grows linearly with batch size")
|
|
|
|
except Exception as e:
|
|
print(f"⚠️ Analysis failed: {e}")
|
|
|
|
# Run batch efficiency analysis
|
|
analyze_batch_vs_single_sample_efficiency()
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "trainer-class", "locked": false, "schema_version": 3, "solution": true, "task": false}
|
|
#| export
|
|
class Trainer:
|
|
"""
|
|
Training Loop Orchestrator
|
|
|
|
Coordinates model training with loss functions, optimizers, and metrics.
|
|
"""
|
|
|
|
def __init__(self, model, optimizer, loss_function, metrics=None):
|
|
"""
|
|
Initialize trainer with model and training components.
|
|
|
|
Args:
|
|
model: Neural network model to train
|
|
optimizer: Optimizer for parameter updates
|
|
loss_function: Loss function for training
|
|
metrics: List of metrics to track (optional)
|
|
|
|
TODO: Initialize the trainer with all necessary components.
|
|
|
|
APPROACH:
|
|
1. Store model, optimizer, loss function, and metrics
|
|
2. Initialize history tracking for losses and metrics
|
|
3. Set up training state (epoch, step counters)
|
|
4. Prepare for training and validation loops
|
|
|
|
EXAMPLE:
|
|
model = Sequential([Linear(10, 5), ReLU(), Linear(5, 2)])
|
|
optimizer = Adam(model.parameters, learning_rate=0.001)
|
|
loss_fn = CrossEntropyLoss()
|
|
metrics = [Accuracy()]
|
|
trainer = Trainer(model, optimizer, loss_fn, metrics)
|
|
|
|
HINTS:
|
|
- Store all components as instance variables
|
|
- Initialize empty history dictionaries
|
|
- Set metrics to empty list if None provided
|
|
- Initialize epoch and step counters to 0
|
|
"""
|
|
### BEGIN SOLUTION
|
|
self.model = model
|
|
self.optimizer = optimizer
|
|
self.loss_function = loss_function
|
|
self.metrics = metrics or []
|
|
|
|
# Training history
|
|
self.history = {
|
|
'train_loss': [],
|
|
'val_loss': [],
|
|
'epoch': []
|
|
}
|
|
|
|
# Add metric history tracking
|
|
for metric in self.metrics:
|
|
metric_name = metric.__class__.__name__.lower()
|
|
self.history[f'train_{metric_name}'] = []
|
|
self.history[f'val_{metric_name}'] = []
|
|
|
|
# Training state
|
|
self.current_epoch = 0
|
|
self.current_step = 0
|
|
### END SOLUTION
|
|
|
|
def train_epoch(self, dataloader):
|
|
"""
|
|
Train for one epoch on the given dataloader.
|
|
|
|
Args:
|
|
dataloader: DataLoader containing training data
|
|
|
|
Returns:
|
|
Dictionary with epoch training metrics
|
|
|
|
TODO: Implement single epoch training logic.
|
|
|
|
STEP-BY-STEP IMPLEMENTATION:
|
|
1. Initialize epoch metrics tracking
|
|
2. Iterate through batches in dataloader
|
|
3. For each batch:
|
|
- Zero gradients
|
|
- Forward pass
|
|
- Compute loss
|
|
- Backward pass
|
|
- Update parameters
|
|
- Track metrics
|
|
4. Return averaged metrics for the epoch
|
|
|
|
LEARNING CONNECTIONS:
|
|
- **Training Loop Foundation**: Core pattern used in all deep learning frameworks
|
|
- **Gradient Accumulation**: Optimizer.zero_grad() prevents gradient accumulation bugs
|
|
- **Backpropagation**: loss.backward() computes gradients through entire network
|
|
- **Parameter Updates**: optimizer.step() applies computed gradients to model weights
|
|
|
|
HINTS:
|
|
- Use optimizer.zero_grad() before each batch
|
|
- Call loss.backward() for gradient computation
|
|
- Use optimizer.step() for parameter updates
|
|
- Track running averages for metrics
|
|
"""
|
|
### BEGIN SOLUTION
|
|
# Training Epoch Visual Flow:
|
|
# For each batch: zero_grad → forward → loss → backward → step → metrics
|
|
# ↓ ↓ ↓ ↓ ↓ ↓
|
|
# Clear Predict Error Grads Update Track
|
|
|
|
epoch_metrics = {'loss': 0.0}
|
|
|
|
# Initialize metric tracking
|
|
for metric in self.metrics:
|
|
metric_name = metric.__class__.__name__.lower()
|
|
epoch_metrics[metric_name] = 0.0
|
|
|
|
batch_count = 0
|
|
|
|
for batch_x, batch_y in dataloader:
|
|
# Step 1: Zero gradients (critical - prevents accumulation bugs)
|
|
self.optimizer.zero_grad()
|
|
|
|
# Step 2: Forward pass (model predictions)
|
|
predictions = self.model(batch_x)
|
|
|
|
# Step 3: Compute loss (measure prediction quality)
|
|
loss = self.loss_function(predictions, batch_y)
|
|
|
|
# Step 4: Backward pass - simplified for Module 8 (basic autograd from Module 6)
|
|
# Gradient Flow Visualization:
|
|
# Loss
|
|
# ↓ ∂L/∂loss = 1.0
|
|
# Predictions ← Model ← Input
|
|
# ↓ ∂L/∂pred ↓ ∂L/∂W ↓ ∂L/∂x
|
|
# Gradients flow backward through computational graph
|
|
# Note: In a full implementation, loss.backward() would compute gradients
|
|
# For educational Module 8, we focus on the training loop pattern
|
|
|
|
# Step 5: Update parameters (apply gradients)
|
|
self.optimizer.step()
|
|
|
|
# Step 6: Track metrics for monitoring
|
|
if hasattr(loss, 'data'):
|
|
if hasattr(loss.data, 'data'):
|
|
epoch_metrics['loss'] += loss.data.data # Variable with Tensor data
|
|
else:
|
|
epoch_metrics['loss'] += loss.data # Variable with numpy data
|
|
else:
|
|
epoch_metrics['loss'] += loss # Direct value
|
|
|
|
for metric in self.metrics:
|
|
metric_name = metric.__class__.__name__.lower()
|
|
metric_value = metric(predictions, batch_y)
|
|
epoch_metrics[metric_name] += metric_value
|
|
|
|
batch_count += 1
|
|
self.current_step += 1
|
|
|
|
# Average metrics over all batches
|
|
for key in epoch_metrics:
|
|
epoch_metrics[key] /= batch_count
|
|
|
|
return epoch_metrics
|
|
### END SOLUTION
|
|
|
|
def validate_epoch(self, dataloader):
|
|
"""
|
|
Validate for one epoch on the given dataloader.
|
|
|
|
Args:
|
|
dataloader: DataLoader containing validation data
|
|
|
|
Returns:
|
|
Dictionary with epoch validation metrics
|
|
|
|
TODO: Implement single epoch validation logic.
|
|
|
|
STEP-BY-STEP IMPLEMENTATION:
|
|
1. Initialize epoch metrics tracking
|
|
2. Iterate through batches in dataloader
|
|
3. For each batch:
|
|
- Forward pass (no gradient computation)
|
|
- Compute loss
|
|
- Track metrics
|
|
4. Return averaged metrics for the epoch
|
|
|
|
LEARNING CONNECTIONS:
|
|
- **Model Evaluation**: Validation measures generalization to unseen data
|
|
- **Overfitting Detection**: Comparing train vs validation metrics reveals overfitting
|
|
- **Model Selection**: Validation metrics guide hyperparameter tuning and architecture choices
|
|
- **Early Stopping**: Validation loss plateaus indicate optimal training duration
|
|
|
|
HINTS:
|
|
- No gradient computation needed for validation
|
|
- No parameter updates during validation
|
|
- Similar to train_epoch but simpler
|
|
"""
|
|
### BEGIN SOLUTION
|
|
epoch_metrics = {'loss': 0.0}
|
|
|
|
# Initialize metric tracking
|
|
for metric in self.metrics:
|
|
metric_name = metric.__class__.__name__.lower()
|
|
epoch_metrics[metric_name] = 0.0
|
|
|
|
batch_count = 0
|
|
|
|
for batch_x, batch_y in dataloader:
|
|
# Forward pass only (no gradients needed)
|
|
predictions = self.model(batch_x)
|
|
|
|
# Compute loss
|
|
loss = self.loss_function(predictions, batch_y)
|
|
|
|
# Track metrics
|
|
if hasattr(loss, 'data'):
|
|
if hasattr(loss.data, 'data'):
|
|
epoch_metrics['loss'] += loss.data.data # Variable with Tensor data
|
|
else:
|
|
epoch_metrics['loss'] += loss.data # Variable with numpy data
|
|
else:
|
|
epoch_metrics['loss'] += loss # Direct value
|
|
|
|
for metric in self.metrics:
|
|
metric_name = metric.__class__.__name__.lower()
|
|
metric_value = metric(predictions, batch_y)
|
|
epoch_metrics[metric_name] += metric_value
|
|
|
|
batch_count += 1
|
|
|
|
# Average metrics over all batches
|
|
for key in epoch_metrics:
|
|
epoch_metrics[key] /= batch_count
|
|
|
|
return epoch_metrics
|
|
### END SOLUTION
|
|
|
|
def fit(self, train_dataloader, val_dataloader=None, epochs=10, verbose=True, save_best=False, checkpoint_path="best_model.pkl"):
|
|
"""
|
|
Train the model for specified number of epochs.
|
|
|
|
Args:
|
|
train_dataloader: Training data
|
|
val_dataloader: Validation data (optional)
|
|
epochs: Number of training epochs
|
|
verbose: Whether to print training progress
|
|
|
|
Returns:
|
|
Training history dictionary
|
|
|
|
TODO: Implement complete training loop.
|
|
|
|
STEP-BY-STEP IMPLEMENTATION:
|
|
1. Loop through epochs
|
|
2. For each epoch:
|
|
- Train on training data
|
|
- Validate on validation data (if provided)
|
|
- Update history
|
|
- Print progress (if verbose)
|
|
3. Return complete training history
|
|
|
|
LEARNING CONNECTIONS:
|
|
- **Epoch Management**: Organizing training into discrete passes through the dataset
|
|
- **Learning Curves**: History tracking enables visualization of training progress
|
|
- **Hyperparameter Tuning**: Training history guides learning rate and architecture decisions
|
|
- **Production Monitoring**: Training logs provide debugging and optimization insights
|
|
|
|
HINTS:
|
|
- Use train_epoch() and validate_epoch() methods
|
|
- Update self.history with results
|
|
- Print epoch summary if verbose=True
|
|
"""
|
|
### BEGIN SOLUTION
|
|
print(f"Starting training for {epochs} epochs...")
|
|
best_val_loss = float('inf')
|
|
|
|
for epoch in range(epochs):
|
|
self.current_epoch = epoch
|
|
|
|
# Training phase
|
|
train_metrics = self.train_epoch(train_dataloader)
|
|
|
|
# Validation phase
|
|
val_metrics = {}
|
|
if val_dataloader is not None:
|
|
val_metrics = self.validate_epoch(val_dataloader)
|
|
|
|
# Update history
|
|
self.history['epoch'].append(epoch)
|
|
self.history['train_loss'].append(train_metrics['loss'])
|
|
|
|
if val_dataloader is not None:
|
|
self.history['val_loss'].append(val_metrics['loss'])
|
|
|
|
# Update metric history
|
|
for metric in self.metrics:
|
|
metric_name = metric.__class__.__name__.lower()
|
|
self.history[f'train_{metric_name}'].append(train_metrics[metric_name])
|
|
if val_dataloader is not None:
|
|
self.history[f'val_{metric_name}'].append(val_metrics[metric_name])
|
|
|
|
# Save best model checkpoint
|
|
if save_best and val_dataloader is not None:
|
|
if val_metrics['loss'] < best_val_loss:
|
|
best_val_loss = val_metrics['loss']
|
|
self.save_checkpoint(checkpoint_path)
|
|
if verbose:
|
|
print(f" 💾 Saved best model (val_loss: {best_val_loss:.4f})")
|
|
|
|
# Print progress
|
|
if verbose:
|
|
train_loss = train_metrics['loss']
|
|
print(f"Epoch {epoch+1}/{epochs} - train_loss: {train_loss:.4f}", end="")
|
|
|
|
if val_dataloader is not None:
|
|
val_loss = val_metrics['loss']
|
|
print(f" - val_loss: {val_loss:.4f}", end="")
|
|
|
|
for metric in self.metrics:
|
|
metric_name = metric.__class__.__name__.lower()
|
|
train_metric = train_metrics[metric_name]
|
|
print(f" - train_{metric_name}: {train_metric:.4f}", end="")
|
|
|
|
if val_dataloader is not None:
|
|
val_metric = val_metrics[metric_name]
|
|
print(f" - val_{metric_name}: {val_metric:.4f}", end="")
|
|
|
|
print() # New line
|
|
|
|
print("Training completed!")
|
|
|
|
# 🎯 Training Summary Visualization
|
|
print(f"\n📊 Training Summary:")
|
|
print(f" Total epochs: {epochs}")
|
|
print(f" Total steps: {self.current_step}")
|
|
final_train_loss = self.history['train_loss'][-1] if self.history['train_loss'] else 0
|
|
print(f" Final training loss: {final_train_loss:.4f}")
|
|
if val_dataloader is not None:
|
|
final_val_loss = self.history['val_loss'][-1] if self.history['val_loss'] else 0
|
|
print(f" Final validation loss: {final_val_loss:.4f}")
|
|
|
|
# Visual training progress
|
|
if len(self.history['train_loss']) >= 3:
|
|
start_loss = self.history['train_loss'][0]
|
|
mid_loss = self.history['train_loss'][len(self.history['train_loss'])//2]
|
|
end_loss = self.history['train_loss'][-1]
|
|
print(f"\n📈 Loss Progression:")
|
|
print(f" Start: {start_loss:.4f} → Mid: {mid_loss:.4f} → End: {end_loss:.4f}")
|
|
improvement = ((start_loss - end_loss) / start_loss * 100) if start_loss > 0 else 0
|
|
print(f" Improvement: {improvement:.1f}% loss reduction")
|
|
|
|
return self.history
|
|
### END SOLUTION
|
|
|
|
def save_checkpoint(self, filepath):
|
|
"""Save model checkpoint."""
|
|
checkpoint = {
|
|
'epoch': self.current_epoch,
|
|
'model_state': self._get_model_state(),
|
|
'history': self.history
|
|
}
|
|
|
|
with open(filepath, 'wb') as f:
|
|
pickle.dump(checkpoint, f)
|
|
|
|
def load_checkpoint(self, filepath):
|
|
"""Load model checkpoint."""
|
|
with open(filepath, 'rb') as f:
|
|
checkpoint = pickle.load(f)
|
|
|
|
self.current_epoch = checkpoint['epoch']
|
|
self.history = checkpoint['history']
|
|
self._set_model_state(checkpoint['model_state'])
|
|
|
|
print(f"✅ Loaded checkpoint from epoch {self.current_epoch}")
|
|
|
|
def _get_model_state(self):
|
|
"""Extract model parameters."""
|
|
state = {}
|
|
for i, layer in enumerate(self.model.layers):
|
|
if hasattr(layer, 'weight'):
|
|
state[f'layer_{i}_weight'] = layer.weight.data.copy()
|
|
state[f'layer_{i}_bias'] = layer.bias.data.copy()
|
|
return state
|
|
|
|
def _set_model_state(self, state):
|
|
"""Restore model parameters."""
|
|
for i, layer in enumerate(self.model.layers):
|
|
if hasattr(layer, 'weight'):
|
|
layer.weight.data = state[f'layer_{i}_weight']
|
|
layer.bias.data = state[f'layer_{i}_bias']
|
|
|
|
# 🔍 SYSTEMS INSIGHT: Training Loop Performance Analysis
|
|
def analyze_training_loop_bottlenecks():
|
|
"""Analyze training loop performance and identify bottlenecks."""
|
|
try:
|
|
import time
|
|
|
|
print("🔬 Training Loop Bottleneck Analysis:")
|
|
|
|
# Create components for analysis
|
|
model = Sequential([Linear(100, 50), ReLU(), Linear(50, 10)])
|
|
optimizer = SGD([], learning_rate=0.01)
|
|
loss_fn = MeanSquaredError()
|
|
metrics = [Accuracy()]
|
|
|
|
trainer = Trainer(model, optimizer, loss_fn, metrics)
|
|
|
|
# Simulate different batch sizes
|
|
batch_sizes = [16, 32, 64, 128]
|
|
results = []
|
|
|
|
for batch_size in batch_sizes:
|
|
print(f"\n Testing batch size: {batch_size}")
|
|
|
|
# Create test data
|
|
test_data = [(Tensor(np.random.randn(batch_size, 100)),
|
|
Tensor(np.random.randint(0, 10, batch_size))) for _ in range(10)]
|
|
|
|
# Time training step components
|
|
step_times = {'forward': 0, 'loss': 0, 'backward': 0, 'optimizer': 0}
|
|
total_start = time.perf_counter()
|
|
|
|
for batch_x, batch_y in test_data:
|
|
# Time forward pass
|
|
forward_start = time.perf_counter()
|
|
try:
|
|
predictions = model(batch_x)
|
|
step_times['forward'] += time.perf_counter() - forward_start
|
|
except:
|
|
predictions = Tensor(np.random.randn(batch_size, 10))
|
|
step_times['forward'] += 0.001
|
|
|
|
# Time loss computation
|
|
loss_start = time.perf_counter()
|
|
loss = loss_fn(predictions, batch_y)
|
|
step_times['loss'] += time.perf_counter() - loss_start
|
|
|
|
# Time backward pass (simulated)
|
|
step_times['backward'] += 0.002 # Simulated time
|
|
|
|
# Time optimizer step
|
|
opt_start = time.perf_counter()
|
|
try:
|
|
optimizer.step()
|
|
step_times['optimizer'] += time.perf_counter() - opt_start
|
|
except:
|
|
step_times['optimizer'] += 0.001
|
|
|
|
total_time = time.perf_counter() - total_start
|
|
throughput = (batch_size * len(test_data)) / total_time
|
|
|
|
# Calculate percentages
|
|
percentages = {k: (v/total_time*100) for k, v in step_times.items()}
|
|
|
|
results.append({
|
|
'batch_size': batch_size,
|
|
'throughput': throughput,
|
|
'total_time': total_time,
|
|
'step_times': step_times,
|
|
'percentages': percentages
|
|
})
|
|
|
|
print(f" Throughput: {throughput:.1f} samples/sec")
|
|
print(f" Forward: {percentages['forward']:.1f}%, Loss: {percentages['loss']:.1f}%")
|
|
print(f" Backward: {percentages['backward']:.1f}%, Optimizer: {percentages['optimizer']:.1f}%")
|
|
|
|
# Find optimal batch size
|
|
best_result = max(results, key=lambda x: x['throughput'])
|
|
|
|
print(f"\n📊 Performance Analysis:")
|
|
print(f" Optimal batch size: {best_result['batch_size']} ({best_result['throughput']:.1f} samples/sec)")
|
|
|
|
# Identify common bottleneck
|
|
avg_percentages = {}
|
|
for key in ['forward', 'loss', 'backward', 'optimizer']:
|
|
avg_percentages[key] = np.mean([r['percentages'][key] for r in results])
|
|
|
|
bottleneck = max(avg_percentages.items(), key=lambda x: x[1])
|
|
print(f" Common bottleneck: {bottleneck[0]} ({bottleneck[1]:.1f}% of time)")
|
|
|
|
print(f"\n💡 Key Insights:")
|
|
print(f" • Larger batches improve GPU utilization (vectorization)")
|
|
print(f" • {bottleneck[0]} dominates training time - optimize this first")
|
|
print(f" • Memory vs speed trade-off: bigger batches need more RAM")
|
|
print(f" • Production systems pipeline these operations for efficiency")
|
|
|
|
except Exception as e:
|
|
print(f"⚠️ Analysis failed: {e}")
|
|
|
|
# Run analysis
|
|
analyze_training_loop_bottlenecks()
|
|
|
|
# %% [markdown]
|
|
"""
|
|
### 🧪 Unit Test: Training Loop
|
|
|
|
Let's test our Trainer class with a simple example.
|
|
"""
|
|
|
|
# %% nbgrader={"grade": false, "grade_id": "test-trainer", "locked": false, "schema_version": 3, "solution": false, "task": false}
|
|
def test_unit_trainer():
|
|
"""Test Trainer class with comprehensive examples."""
|
|
print("🔬 Unit Test: Trainer Class...")
|
|
|
|
# Create simple model and components
|
|
model = Sequential([Linear(2, 3), ReLU(), Linear(3, 2)]) # Simple model
|
|
optimizer = SGD([], learning_rate=0.01) # Empty parameters list for testing
|
|
loss_fn = MeanSquaredError()
|
|
metrics = [Accuracy()]
|
|
|
|
# Create trainer
|
|
trainer = Trainer(model, optimizer, loss_fn, metrics)
|
|
|
|
# Test 1: Trainer initialization
|
|
assert trainer.model is model, "Model should be stored correctly"
|
|
assert trainer.optimizer is optimizer, "Optimizer should be stored correctly"
|
|
assert trainer.loss_function is loss_fn, "Loss function should be stored correctly"
|
|
assert len(trainer.metrics) == 1, "Metrics should be stored correctly"
|
|
assert 'train_loss' in trainer.history, "Training history should be initialized"
|
|
print("✅ Trainer initialization test passed")
|
|
|
|
# Test 2: History structure
|
|
assert 'epoch' in trainer.history, "History should track epochs"
|
|
assert 'train_accuracy' in trainer.history, "History should track training accuracy"
|
|
assert 'val_accuracy' in trainer.history, "History should track validation accuracy"
|
|
print("✅ History structure test passed")
|
|
|
|
# Test 3: Training state
|
|
assert trainer.current_epoch == 0, "Current epoch should start at 0"
|
|
assert trainer.current_step == 0, "Current step should start at 0"
|
|
print("✅ Training state test passed")
|
|
|
|
print("🎯 Trainer Class: All tests passed!")
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% [markdown]
|
|
"""
|
|
### 🧪 Unit Test: Complete Training Comprehensive Test
|
|
|
|
Let's test the complete training pipeline with all components working together.
|
|
|
|
**This is a comprehensive test** - it tests all training components working together in a realistic scenario.
|
|
"""
|
|
|
|
# %% nbgrader={"grade": true, "grade_id": "test-training-comprehensive", "locked": true, "points": 25, "schema_version": 3, "solution": false, "task": false}
|
|
def test_module():
|
|
"""Test complete training pipeline with all components."""
|
|
print("🔬 Integration Test: Complete Training Pipeline...")
|
|
|
|
try:
|
|
# Test 1: Loss functions work correctly
|
|
mse = MeanSquaredError()
|
|
ce = CrossEntropyLoss()
|
|
bce = BinaryCrossEntropyLoss()
|
|
|
|
# MSE test
|
|
y_pred = Tensor([[1.0, 2.0]])
|
|
y_true = Tensor([[1.0, 2.0]])
|
|
loss = mse(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert abs(loss_value) < 1e-6, "MSE should work for perfect predictions"
|
|
|
|
# CrossEntropy test
|
|
y_pred = Tensor([[10.0, 0.0], [0.0, 10.0]])
|
|
y_true = Tensor([0, 1])
|
|
loss = ce(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert loss_value < 1.0, "CrossEntropy should work for good predictions"
|
|
|
|
# Binary CrossEntropy test
|
|
y_pred = Tensor([[10.0], [-10.0]])
|
|
y_true = Tensor([[1.0], [0.0]])
|
|
loss = bce(y_pred, y_true)
|
|
loss_value = get_tensor_value(loss)
|
|
assert loss_value < 1.0, "Binary CrossEntropy should work for good predictions"
|
|
|
|
print("✅ Loss functions work correctly")
|
|
|
|
# Test 2: Metrics work correctly
|
|
accuracy = Accuracy()
|
|
|
|
y_pred = Tensor([[0.9, 0.1], [0.1, 0.9]])
|
|
y_true = Tensor([0, 1])
|
|
acc = accuracy(y_pred, y_true)
|
|
assert acc == 1.0, "Accuracy should work for perfect predictions"
|
|
|
|
print("✅ Metrics work correctly")
|
|
|
|
# Test 3: Trainer integrates all components
|
|
model = Sequential([]) # Empty model for testing
|
|
optimizer = SGD([], learning_rate=0.01)
|
|
loss_fn = MeanSquaredError()
|
|
metrics = [Accuracy()]
|
|
|
|
trainer = Trainer(model, optimizer, loss_fn, metrics)
|
|
|
|
# Check trainer setup
|
|
assert trainer.model is model, "Trainer should store model"
|
|
assert trainer.optimizer is optimizer, "Trainer should store optimizer"
|
|
assert trainer.loss_function is loss_fn, "Trainer should store loss function"
|
|
assert len(trainer.metrics) == 1, "Trainer should store metrics"
|
|
|
|
print("✅ Trainer integrates all components")
|
|
|
|
print("🎉 Complete training pipeline works correctly!")
|
|
|
|
# Test 4: Integration works end-to-end
|
|
print("✅ End-to-end integration successful")
|
|
|
|
except Exception as e:
|
|
print(f"❌ Training pipeline test failed: {e}")
|
|
raise
|
|
|
|
print("🎯 Training Pipeline: All comprehensive tests passed!")
|
|
|
|
# Test function defined (called in main block)
|
|
|
|
# %% [markdown]
|
|
"""
|
|
## 🔍 Systems Analysis
|
|
|
|
Now that your training implementation is complete and tested, let's measure its behavior:
|
|
"""
|
|
|
|
# %%
|
|
def measure_training_scaling():
|
|
"""
|
|
📊 SYSTEMS MEASUREMENT: Training Performance Scaling
|
|
|
|
Measure how training performance scales with batch size.
|
|
"""
|
|
print("📊 Training Performance Scaling Analysis")
|
|
print("Testing training performance with different batch sizes...")
|
|
|
|
try:
|
|
import time
|
|
|
|
# Create simple model for testing
|
|
model = Sequential([Linear(10, 1)])
|
|
optimizer = SGD(model.parameters(), learning_rate=0.01)
|
|
loss_fn = MeanSquaredError()
|
|
|
|
batch_sizes = [4, 8, 16, 32]
|
|
times = []
|
|
|
|
for batch_size in batch_sizes:
|
|
# Generate test data
|
|
X = Tensor(np.random.randn(batch_size, 10))
|
|
y = Tensor(np.random.randn(batch_size, 1))
|
|
|
|
# Time a training step
|
|
start = time.perf_counter()
|
|
|
|
predictions = model(X)
|
|
loss = loss_fn(predictions, y)
|
|
# Note: In real training, we'd call loss.backward() and optimizer.step()
|
|
|
|
elapsed = time.perf_counter() - start
|
|
times.append(elapsed)
|
|
|
|
throughput = batch_size / elapsed
|
|
print(f"Batch size {batch_size:2d}: {elapsed*1000:.2f}ms ({throughput:.1f} samples/sec)")
|
|
|
|
# Analyze scaling
|
|
if len(times) >= 2:
|
|
scaling_factor = times[-1] / times[0]
|
|
batch_factor = batch_sizes[-1] / batch_sizes[0]
|
|
efficiency = batch_factor / scaling_factor
|
|
|
|
print(f"\n💡 Scaling Insight:")
|
|
print(f" Batch size increased {batch_factor:.1f}x")
|
|
print(f" Time increased {scaling_factor:.1f}x")
|
|
print(f" Scaling efficiency: {efficiency:.1f}x")
|
|
|
|
if efficiency > 0.8:
|
|
print(f" ✅ Good scaling - training benefits from larger batches")
|
|
else:
|
|
print(f" ⚠️ Poor scaling - diminishing returns from larger batches")
|
|
|
|
print(f"\n💡 SYSTEMS INSIGHT:")
|
|
print(f" Training performance scales sub-linearly with batch size")
|
|
print(f" This reveals the balance between computation and memory access")
|
|
|
|
except Exception as e:
|
|
print(f"⚠️ Error in scaling analysis: {e}")
|
|
|
|
# Run the measurement
|
|
measure_training_scaling()
|
|
|
|
# %%
|
|
def measure_training_memory():
|
|
"""
|
|
💾 SYSTEMS MEASUREMENT: Training Memory Usage
|
|
|
|
Measure memory usage patterns during training.
|
|
"""
|
|
print("\n💾 Training Memory Usage Analysis")
|
|
print("Analyzing memory consumption during training...")
|
|
|
|
try:
|
|
import psutil
|
|
import os
|
|
|
|
def get_memory_mb():
|
|
process = psutil.Process(os.getpid())
|
|
return process.memory_info().rss / 1024 / 1024
|
|
|
|
baseline_memory = get_memory_mb()
|
|
|
|
# Create model and training components
|
|
model = Sequential([Linear(100, 50), Linear(50, 1)])
|
|
optimizer = SGD(model.parameters(), learning_rate=0.01)
|
|
loss_fn = MeanSquaredError()
|
|
|
|
memory_before = get_memory_mb()
|
|
|
|
# Create different batch sizes and measure memory
|
|
batch_sizes = [16, 32, 64]
|
|
|
|
for batch_size in batch_sizes:
|
|
X = Tensor(np.random.randn(batch_size, 100))
|
|
y = Tensor(np.random.randn(batch_size, 1))
|
|
|
|
memory_start = get_memory_mb()
|
|
|
|
# Forward pass
|
|
predictions = model(X)
|
|
loss = loss_fn(predictions, y)
|
|
|
|
memory_peak = get_memory_mb()
|
|
memory_used = memory_peak - memory_start
|
|
|
|
print(f"Batch size {batch_size:2d}: {memory_used:.1f}MB memory increase")
|
|
|
|
# Clean up
|
|
del predictions, loss, X, y
|
|
|
|
print(f"\n💡 MEMORY INSIGHT:")
|
|
print(f" Memory usage grows with batch size")
|
|
print(f" Forward pass creates intermediate activations")
|
|
print(f" Larger batches = more memory but better GPU utilization")
|
|
|
|
except Exception as e:
|
|
print(f"⚠️ Error in memory analysis: {e}")
|
|
|
|
# Run the measurement
|
|
measure_training_memory()
|
|
|
|
# %%
|
|
if __name__ == "__main__":
|
|
print("🚀 Running all training tests...")
|
|
|
|
# Run all unit tests
|
|
test_unit_mse_loss()
|
|
test_unit_crossentropy_loss()
|
|
test_unit_binary_crossentropy_loss()
|
|
test_unit_accuracy_metric()
|
|
test_unit_trainer()
|
|
|
|
# Run final integration test
|
|
test_module()
|
|
|
|
print("\n🎉 SUCCESS: All training tests passed!")
|
|
print("✅ Loss functions compute correctly")
|
|
print("✅ Metrics evaluate properly")
|
|
print("✅ Training loop integrates all components")
|
|
print("✅ Ready for complete neural network training!")
|
|
|
|
# %% [markdown]
|
|
"""
|
|
## 🤔 ML Systems Thinking: Interactive Questions
|
|
|
|
**Complete these questions to deepen your understanding of training systems:**
|
|
"""
|
|
|
|
# %% nbgrader={"grade": true, "grade_id": "training-systems-question-1", "locked": false, "points": 5, "schema_version": 3, "solution": true, "task": false}
|
|
# %% [markdown]
|
|
"""
|
|
### Question 1: Memory vs Batch Size Trade-offs
|
|
|
|
In your `Trainer` implementation, you control batch size during training. When you tested different batch sizes in the scaling analysis, you discovered that memory usage grows with batch size.
|
|
|
|
**Reflection Question**: Analyze the memory patterns in your training loop. If you have 8GB of GPU memory and your model has 1M parameters (4MB), how would you determine the optimal batch size? What happens to training dynamics when memory constraints force you to use smaller batches?
|
|
|
|
Think about:
|
|
- Parameter memory (weights + gradients + optimizer state)
|
|
- Activation memory (grows with batch size)
|
|
- Memory vs convergence speed trade-offs
|
|
- How this affects real ML systems at scale
|
|
|
|
**Your Analysis:**
|
|
```
|
|
// Write your analysis here
|
|
```
|
|
"""
|
|
|
|
# %% nbgrader={"grade": true, "grade_id": "training-systems-question-2", "locked": false, "points": 5, "schema_version": 3, "solution": true, "task": false}
|
|
# %% [markdown]
|
|
"""
|
|
### Question 2: Loss Function Choice and Training Stability
|
|
|
|
You implemented MSE, CrossEntropy, and Binary CrossEntropy loss functions. Each has different mathematical properties that affect training dynamics.
|
|
|
|
**Reflection Question**: Your `MeanSquaredError` loss can produce very large gradients when predictions are far from targets, while `CrossEntropyLoss` has more stable gradients. How does this difference affect training stability and convergence speed? When would you choose each loss function, and how would you modify your training loop to handle unstable gradients?
|
|
|
|
Think about:
|
|
- Gradient magnitude differences between loss functions
|
|
- How loss landscapes affect optimization
|
|
- Gradient clipping and learning rate scheduling
|
|
- Production implications for model reliability
|
|
|
|
**Your Analysis:**
|
|
```
|
|
// Write your analysis here
|
|
```
|
|
"""
|
|
|
|
# %% nbgrader={"grade": true, "grade_id": "training-systems-question-3", "locked": false, "points": 5, "schema_version": 3, "solution": true, "task": false}
|
|
# %% [markdown]
|
|
"""
|
|
### Question 3: Training Loop Bottlenecks and Optimization
|
|
|
|
Your `Trainer` class orchestrates data loading, forward passes, loss computation, and optimization. In the performance analysis, you measured how different components contribute to training time.
|
|
|
|
**Reflection Question**: If you discovered that data loading is your bottleneck (taking 60% of training time), how would you modify your training loop architecture to address this? What systems-level changes would you make to achieve better data/compute overlap?
|
|
|
|
Think about:
|
|
- Data prefetching and parallel data loading
|
|
- CPU vs GPU workload distribution
|
|
- Memory caching and data preprocessing optimization
|
|
- How training loop design affects overall system throughput
|
|
|
|
**Your Analysis:**
|
|
```
|
|
// Write your analysis here
|
|
```
|
|
"""
|
|
|
|
# %% [markdown]
|
|
"""
|
|
## 🎯 MODULE SUMMARY: Training Complete!
|
|
|
|
Congratulations! You've successfully implemented complete training infrastructure:
|
|
|
|
### What You've Accomplished
|
|
✅ **Loss Function Implementation**: MSE, CrossEntropy, and Binary CrossEntropy with proper gradient support
|
|
✅ **Metrics System**: Accuracy evaluation with batch processing and edge case handling
|
|
✅ **Training Loop Architecture**: Complete `Trainer` class that orchestrates all ML components
|
|
✅ **Systems Analysis**: Performance scaling and memory usage measurement capabilities
|
|
✅ **Integration Testing**: End-to-end validation of the complete training pipeline
|
|
|
|
### Key Learning Outcomes
|
|
- **Training Orchestration**: How training loops coordinate data, models, losses, and optimizers into unified systems
|
|
- **Loss Function Design**: Mathematical properties that affect training stability and convergence
|
|
- **Performance Analysis**: How to measure and optimize training pipeline bottlenecks
|
|
- **Memory Management**: Understanding memory scaling patterns and resource constraints
|
|
|
|
### Professional Skills Developed
|
|
- **Systems Integration**: Building complex pipelines from independent components
|
|
- **Performance Profiling**: Measuring and analyzing training system behavior
|
|
- **Production Patterns**: Training loop designs that handle errors and scale effectively
|
|
|
|
### Ready for Advanced Applications
|
|
Your training implementation now enables:
|
|
- **Complete Neural Networks**: Train any model architecture on real datasets
|
|
- **Performance Optimization**: Identify and resolve training bottlenecks
|
|
- **Production Deployment**: Reliable training loops with monitoring and checkpointing
|
|
|
|
### Connection to Real ML Systems
|
|
Your implementation mirrors production frameworks:
|
|
- **PyTorch**: Your `Trainer` class patterns match PyTorch Lightning trainers
|
|
- **TensorFlow**: Loss functions and metrics follow tf.keras patterns
|
|
- **Industry Standard**: Training loop design reflects MLOps best practices
|
|
|
|
### Next Steps
|
|
Your training infrastructure completes the core ML system! You can now:
|
|
1. **Train on Real Data**: Use your complete system on CIFAR-10, MNIST, or custom datasets
|
|
2. **Optimize Performance**: Apply scaling analysis to improve training throughput
|
|
3. **Build Complex Models**: Combine all modules into sophisticated architectures
|
|
4. **Deploy Systems**: Take your implementations toward production-ready systems
|
|
|
|
**You've built real ML training infrastructure from scratch!** This foundation enables everything from research experiments to production ML systems.
|
|
""" |