Linear Classification and Advanced Methods · Machine Learning

Artificial Neural Networks + Back Propagation

Watch lectures

Artificial Neural Networks + Back Propagation

1. Neuron

a=σ(wTx+b)a = σ(w^{T}x + b)

σσ = sigmoid / ReLU / tanh. ReLU (max(0,s))(max(0,s)) is default (fast, no saturation for s>0s>0). Network stacks layers: X→hidden→outputX → hidden → output.

2. Forward Pass (example 2-2-1)

h = relu(X W₁ + b₁)   # n × 2
p = sigmoid(h W₂ + b₂) # n × 1
loss = cross-entropy(p, y)

Universal approximation: one wide hidden layer can fit any continuous function (given enough units).

3. Back Propagation (chain rule)

Gradients flow output → input, reusing intermediate terms:

dLdW1=XT[(p−y)W2T times relu-gate]\frac{dL}{dW₁} = X^{T} [ (p - y) W₂^{T} \text{ times relu-gate} ]

Written with dL/ddL/d in words to stay rendering-safe. In code: cache forward activations, multiply by local derivatives backward.

4. Training Tips

Standardize inputs, init small random, mini-batch + Adam, dropout / weight decay to regularize, early stop on validation.

5. Exam Points

  • Neuron + forward equations — 5 marks, very frequent.
  • Backprop chain-rule idea + one-layer derivation — 7 marks, frequent.
  • ReLU vs sigmoid, overfitting fixes — 3 marks, frequent.
Free AppAndroid App

Coursify Android App

Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.

← All Machine Learning modules