-
Notifications
You must be signed in to change notification settings - Fork 0
Theory Notes
eantcal edited this page Jul 7, 2026
·
3 revisions
This section is the bridge between the book material and the nuNN implementation.
The goal is not to reproduce the book verbatim. Each wiki note should be short, visual, and tied to code in the repository.
The following theory pages are good candidates for expansion:
- Gradient descent and learning rate
- MSE and cross-entropy
- Backpropagation in an MLP
- Mini-batch SGD and matrix multiplication
- Activation functions
- MNIST vectorization
- Vanishing gradients and recurrent networks
- GRU and LSTM gates
- Convolution and pooling
- Self-attention and causal masking
- Q-learning vs SARSA
- DQN, replay buffers, and target networks
- PCA and dimensionality reduction
- K-means and clustering
Gradient descent:
theta <- theta - eta * grad J(theta)
MSE:
J = (1/N) * sum_i (y_i - t_i)^2
Sigmoid:
sigma(x) = 1 / (1 + exp(-x))
Q-learning update:
Q(s,a) <- Q(s,a) + alpha * (r + gamma * max_a' Q(s',a') - Q(s,a))
The current image assets were copied from the book-generated TikZ PNG files and renamed for wiki readability:
mlp-topology.pngtraining-loop.pngmnist-digit.pngmnist-flatten-vector.pngmnist-mlp-ocr.pngconv-filter.pngmaxpool.pngautoencoder.pngrnn-unrolled.pnglstm-cell.pngrl-agent-environment.pngmaze-rewards.pngq-table.png