English
Backpropagation as a Computation Graph: A Two-Layer MLP by Hand
Backpropagation is chain rule execution on a computation graph. It is not a neural-network trick; it is a disciplined way to move local gradients backward through program operations.
This article works through a two-layer MLP: x -> W1x+b1 -> ReLU -> W2h+b2 -> softmax cross-entropy. The companion lab records the loss, probabilities, and gradient norms so the derivation can be checked numerically.
1. Split The Network Into Nodes
z1 = W1 x + b1
h = ReLU(z1)
logits = W2 h + b2
p = softmax(logits)
L = -log p[target]
Each node performs one simple operation. The forward pass stores intermediate values; the backward pass starts from the loss and multiplies local gradients in reverse order.
2. The Softmax Cross-Entropy Shortcut
For softmax followed by cross-entropy, the gradient with respect to logits simplifies to:
dL/dlogits = p - one_hot(target)
In the lab example the target is class 1. The model predicts p0=0.638763 and p1=0.361237, so dlogits = [0.638763, -0.638763]^T. This is why frameworks often fuse softmax and cross-entropy for stability and a clean gradient.
3. Backward Formulas For The MLP
dW2 = dlogits h^T
db2 = dlogits
dh = W2^T dlogits
dz1 = dh * ReLU'(z1)
dW1 = dz1 x^T
db1 = dz1
The lab reports loss=1.018222, norm_dW1=0.999823, and norm_dW2=0.993682. Both layers receive meaningful gradients in this toy example.
4. Core Code
dlogits = probs - target
dW2 = dlogits @ h.T
db2 = dlogits
dh = W2.T @ dlogits
dz1 = dh * (z1 > 0)
dW1 = dz1 @ x.T
db1 = dz1
The code mirrors the equations. Common bugs are missing transposes, incorrect ReLU masks, and mixing the batch axis with the feature axis.
5. What The Animation Shows
Do not only watch arrow direction. Watch which forward values each node must store and reuse during the backward pass.
6. Debugging Checklist
- Start with one sample before extending to a batch.
- Print every gradient shape and compare it with its parameter shape.
- ReLU gradients pass only where
z1 > 0. - Avoid unstable hand-written softmax code for large logits.
The next article studies how these gradients move parameters and why optimizers take different paths.
Chinese
反向传播计算图:两层 MLP 的前向、局部梯度和反向传播
Open as a full page反向传播可以理解成“在计算图上反向传递局部梯度”。它并不是神经网络专属的魔法,而是链式法则在程序里的系统化执行。
这一篇用一个两层 MLP 手算:x -> W1x+b1 -> ReLU -> W2h+b2 -> softmax cross-entropy,并对照实验包输出的 loss、概率和梯度范数。
一、把网络拆成计算图
z1 = W1 x + b1
h = ReLU(z1)
logits = W2 h + b2
p = softmax(logits)
L = -log p[target]
每个节点只负责一个简单操作。前向传播保存中间值,反向传播从 loss 出发,把梯度一层层乘回去。
二、softmax cross-entropy 的关键简化
如果 loss 是 softmax 后的交叉熵,logits 的梯度会简化成:
dL/dlogits = p - one_hot(target)
实验包里 target 是第 1 类,输出概率为 p0=0.638763、p1=0.361237,所以 dlogits = [0.638763, -0.638763]^T。这一步是很多框架把 softmax 和 cross-entropy 合并实现的原因:数值更稳定,梯度更简单。
三、两层 MLP 的反向公式
dW2 = dlogits h^T
db2 = dlogits
dh = W2^T dlogits
dz1 = dh * ReLU'(z1)
dW1 = dz1 x^T
db1 = dz1
实验结果给出 loss=1.018222,norm_dW1=0.999823,norm_dW2=0.993682。这两个范数接近,说明这个 toy example 中两层参数都收到明显梯度,不是只有最后一层在学习。
四、核心代码
dlogits = probs - target
dW2 = dlogits @ h.T
db2 = dlogits
dh = W2.T @ dlogits
dz1 = dh * (z1 > 0)
dW1 = dz1 @ x.T
db1 = dz1
这段代码和公式几乎一一对应。真正容易出错的地方通常是:h.T 忘记转置、ReLU mask 用错、或者把 batch 维度和特征维度混在一起。
五、动画看什么
不要只看箭头方向。要观察每个节点保存了什么前向值,以及为什么反向时需要这些值。
六、调试建议
- 先用单样本单 batch 跑通,再扩展到批量矩阵。
- 打印每个梯度的 shape,确保和参数 shape 一致。
- ReLU 梯度只在
z1 > 0的位置通过。 - softmax cross-entropy 不要先手写成不稳定的
exp(logits)大数版本。
下一篇会研究这些梯度如何驱动参数移动,以及不同优化器为什么走出不同轨迹。
Backpropagation is chain rule execution on a computation graph. It is not a neural-network trick; it is a disciplined way to move local gradients backward through program operations.
This article works through a two-layer MLP: x -> W1x+b1 -> ReLU -> W2h+b2 -> softmax cross-entropy. The companion lab records the loss, probabilities, and gradient norms so the derivation can be checked numerically.
1. Split The Network Into Nodes
z1 = W1 x + b1
h = ReLU(z1)
logits = W2 h + b2
p = softmax(logits)
L = -log p[target]
Each node performs one simple operation. The forward pass stores intermediate values; the backward pass starts from the loss and multiplies local gradients in reverse order.
2. The Softmax Cross-Entropy Shortcut
For softmax followed by cross-entropy, the gradient with respect to logits simplifies to:
dL/dlogits = p - one_hot(target)
In the lab example the target is class 1. The model predicts p0=0.638763 and p1=0.361237, so dlogits = [0.638763, -0.638763]^T. This is why frameworks often fuse softmax and cross-entropy for stability and a clean gradient.
3. Backward Formulas For The MLP
dW2 = dlogits h^T
db2 = dlogits
dh = W2^T dlogits
dz1 = dh * ReLU'(z1)
dW1 = dz1 x^T
db1 = dz1
The lab reports loss=1.018222, norm_dW1=0.999823, and norm_dW2=0.993682. Both layers receive meaningful gradients in this toy example.
4. Core Code
dlogits = probs - target
dW2 = dlogits @ h.T
db2 = dlogits
dh = W2.T @ dlogits
dz1 = dh * (z1 > 0)
dW1 = dz1 @ x.T
db1 = dz1
The code mirrors the equations. Common bugs are missing transposes, incorrect ReLU masks, and mixing the batch axis with the feature axis.
5. What The Animation Shows
Do not only watch arrow direction. Watch which forward values each node must store and reuse during the backward pass.
6. Debugging Checklist
- Start with one sample before extending to a batch.
- Print every gradient shape and compare it with its parameter shape.
- ReLU gradients pass only where
z1 > 0. - Avoid unstable hand-written softmax code for large logits.
The next article studies how these gradients move parameters and why optimizers take different paths.
Search questions
FAQ
Who is this article for?
This article is for readers who want an intermediate-level guide to Backpropagation as a Computation Graph. It takes about 14 min and focuses on Backpropagation, Computation Graph, Softmax.
What should I read next?
The recommended next step is Gradient Descent and Optimizer Geometry, so the article connects into a longer learning route instead of ending as an isolated note.
Does this article include runnable code or companion resources?
Yes. Use the run notes, resource cards, and download links on the page to reproduce the example or inspect the companion files.
How does this article fit into the larger site?
It is connected to the article context block, learning routes, resources, and project timeline so readers can move from concept to implementation.
Article context
AI Learning Project
A practical route from AI concepts to machine learning workflow, evaluation, neural networks, Python practice, handwritten digits, a CIFAR-10 CNN, adversarial traffic-defense notes, and AI security.
Your next step
Continue: Gradient Descent and Optimizer GeometryTrace local gradients through ReLU and softmax cross-entropy in a two-layer MLP.
Download share card Open share centerCompanion resources
AI Learning Project / GUIDE
Deep Learning Math Lab README
Setup commands, script entry points, generated outputs, and figure notes for the math series.
AI Learning Project / ARCHIVE
Deep learning math full lab bundle
Bundles NumPy scripts, CSV outputs, formula diagrams, loss contours, convolution figures, and attention heatmaps.
AI Learning Project / DIAGRAM
Deep learning math figure set
Includes matrix shapes, computation graphs, loss contours, convolution scans, and attention heatmaps.
Project timeline
Published posts
- AI Basics Learning Roadmap Separate AI, machine learning, and deep learning before going into implementation details.
- Machine Learning Workflow Follow the practical path from data and features to training, prediction, and evaluation.
- Model Training and Evaluation Understand loss, overfitting, train/test splits, accuracy, recall, and F1.
- Neural Network Basics Move from perceptrons to activation, forward propagation, backpropagation, and training loops.
- Matrix Calculus for Neural Networks Derive dL/dW for y = Wx + b and verify it with finite differences.
- Backpropagation as a Computation Graph Trace local gradients through ReLU and softmax cross-entropy in a two-layer MLP.
- Gradient Descent and Optimizer Geometry Compare gradient descent, momentum, and Adam on a visible quadratic loss surface.
- Convolution and Receptive Field Math Compute convolution output size, receptive fields, channel mixing, and im2col layout.
- Transformer Attention Math Hand-calculate Q/K/V scores, softmax weights, masks, multi-head structure, and KV cache.
- NLP Basics: Understanding Bag of Words and TF-IDF An introduction to the most fundamental text representation methods in NLP: Bag of Words (BoW) and TF-IDF.
- RNN Basics: Handling Sequential Data with Memory Understand the core concepts of Recurrent Neural Networks (RNN), the role of hidden states, and their application in NLP.
- Transformer Self-Attention Read Q/K/V, scaled dot-product attention, multi-head attention, and positional encoding before exploring LLM internals.
- Python AI Mini Practice Run a small scikit-learn classification task and read the experiment output.
- Handwritten Digit Dataset Basics Read train.csv, test.csv, labels, and the flattened 28 by 28 pixel layout before training the classifier.
- Handwritten Digit Softmax in C Follow the C implementation from logits and softmax probabilities to confusion matrices and submission export.
- Handwritten Digit Playground Notes See how the offline classifier was adapted into a browser demo with drawing input and probability output.
- CIFAR-10 Tiny CNN Tutorial in C Build and train a small convolutional neural network for CIFAR-10 image classification, then read its loss and accuracy output.
- Building a Tiny CIFAR-10 CNN in C: Convolution, Pooling, and Backpropagation A source-based walkthrough of cifar10_tiny_cnn.c, covering CIFAR-10 binary input, 3x3 convolution, ReLU, max pooling, fully connected logits, softmax, backpropagation, and local commands.
- High-Entropy Traffic Defense Notes Study encrypted metadata leaks, entropy, traffic classifiers, and a defensive Python chaffing prototype.
- AI Security Threat Modeling Build a defense map with NIST adversarial ML, MITRE ATLAS, and OWASP LLM risks.
- Adversarial Examples and Robust Evaluation Evaluate clean and perturbed accuracy with an FGSM-style digits experiment.
- Data Poisoning and Backdoor Defense Study poison rate, trigger behavior, attack success rate, and training pipeline controls.
- Model Privacy and Extraction Defense Measure membership inference signal and surrogate fidelity against a local toy model.
- LLM, RAG, and Agent Security Separate instructions from data and enforce tool permissions against indirect prompt injection.
Published resources
- Python AI practice code guide The article includes a runnable scikit-learn classification script.
- digit_softmax_classifier.c The C source for the handwritten digit softmax classifier.
- train.csv.zip Compressed handwritten digit training set with 42000 labeled samples.
- test.csv.zip Compressed handwritten digit test set with 28000 unlabeled samples.
- sample_submission.csv The official submission format example for checking the final output columns.
- submission.csv The prediction file generated by the current C project.
- digit-playground-model.json The compact softmax demo model and sample set used by the browser playground.
- digit-sample-grid.svg A small handwritten digit preview grid extracted from the training set.
- Handwritten digit project bundle Contains the source file, compressed datasets, submission files, browser model, and preview grid.
- cifar10_tiny_cnn.c source Single-file C tiny CNN with CIFAR-10 loading, convolution, pooling, softmax, and backpropagation.
- model_weights.bin sample weights Model weights generated by one local small-sample run.
- test_predictions.csv sample predictions Sample test prediction output from the CIFAR-10 tiny CNN.
- CNN project explanation PDF Companion explanation material for the CNN project.
- Virtual Mirror redacted code skeleton A redacted mld_chaffing_v2.py control-flow skeleton with secrets, node topology, and target lists removed.
- Virtual Mirror stress-test template A redacted CSV template for CPU, memory, peak threads, pulse rate, latency, and error measurements.
- Virtual Mirror classifier-evaluation template A CSV template for TP, FN, FP, TN, accuracy, precision, recall, F1, ROC-AUC, entropy, and JS divergence.
- Virtual Mirror resource notes Notes explaining why the public resources include only redacted code, test templates, and architecture context.
- AI Security Lab README Setup, safety boundaries, and quick-run commands for the AI Security series.
- AI Security Lab full bundle Includes safe toy scripts, result CSVs, risk register, attack-defense matrix, and architecture diagram.
- AI security risk register CSV risk register template for AI threat modeling and release review.
- AI attack-defense matrix Maps attack surface, toy demo, metric, and defensive control into one CSV table.
- AI Security Lab architecture diagram Shows threat modeling, robustness, data integrity, model privacy, and RAG guardrails.
- FGSM digits robustness script FGSM-style perturbation and accuracy-drop experiment for a local digits classifier.
- Data poisoning and backdoor toy script Demonstrates poison rate, trigger behavior, and attack success rate on digits.
- Model privacy and extraction toy script Outputs membership AUC, target accuracy, surrogate fidelity, and surrogate accuracy.
- RAG prompt injection guard toy script Uses a deterministic toy agent to demonstrate external-data demotion and tool-policy blocking.
- Deep Learning Math Lab README Setup commands, script entry points, generated outputs, and figure notes for the math series.
- Deep learning math full lab bundle Bundles NumPy scripts, CSV outputs, formula diagrams, loss contours, convolution figures, and attention heatmaps.
- Gradient check results CSV Stores MSE analytic gradients, finite-difference gradients, and error norms.
- Optimizer path CSV Step-by-step coordinates and loss for gradient descent, momentum, and Adam on a 2D quadratic.
- Attention weights CSV Scores, softmax weights, and context vectors for a three-token scaled dot-product attention example.
- Deep learning math figure set Includes matrix shapes, computation graphs, loss contours, convolution scans, and attention heatmaps.
- Deep learning math interactive visualizer Browser modules for gradient checking, optimizer paths, convolution output size, and attention heatmaps.
- Deep Learning topic share card A 1200x630 SVG card for sharing the Deep Learning / CNN topic hub.
- Machine Learning From Scratch share card A 1200x630 SVG card for the K-means, Iris, and ML workflow topic hub.
- Student AI Projects share card A 1200x630 SVG card for handwritten digits, C classifiers, and browser demos.
- CNN convolution scan animation An 8-second Remotion animation showing how a 3x3 convolution kernel scans an input and builds a feature map.
Current route
- AI Basics Learning Roadmap Learning path step
- Machine Learning Workflow Learning path step
- Model Training and Evaluation Learning path step
- Neural Network Basics Learning path step
- Matrix Calculus for Neural Networks Learning path step
- Backpropagation as a Computation Graph Learning path step
- Gradient Descent and Optimizer Geometry Learning path step
- Convolution and Receptive Field Math Learning path step
- Transformer Attention Math Learning path step
- Transformer Self-Attention Learning path step
- LLM Visualizer Learning path step
- Python AI Mini Practice Learning path step
- Handwritten Digit Dataset Basics Learning path step
- Handwritten Digit Softmax in C Learning path step
- Handwritten Digit Playground Notes Learning path step
- CIFAR-10 Tiny CNN Tutorial in C Learning path step
- High-Entropy Traffic Defense Notes Learning path step
- AI Security Threat Modeling Learning path step
- Adversarial Examples and Robust Evaluation Learning path step
- Data Poisoning and Backdoor Defense Learning path step
- Model Privacy and Extraction Defense Learning path step
- LLM, RAG, and Agent Security Learning path step
Next notes
- Add more image-classification and error-analysis cases
- Turn common metrics into a quick reference
- Add more AI security defense experiment notes
