Loading...
Loading...
Loading Curriculum...
Loading Subject...
Loading Topic...
Loading Lesson...
Loading Lab...
Training a neural network is an optimization problem: find weights that minimize a loss. This page explains the core idea behind gradient descent and why Momentum, RMSProp, and Adam became practical defaults.
You pick parameters θ (weights). The model produces predictions. The loss L(θ) measures how wrong those predictions are.
Optimization repeatedly updates parameters to reduce loss:θ ← θ − α · ∇θ L(θ)
Here, α is the learning rate and ∇θ L is the gradient: the direction of steepest increase. We step opposite it to go downhill.
Real loss landscapes are noisy, ill-conditioned, and full of narrow valleys. Plain gradient descent can:
Optimizers modify the update rule to stabilize steps and accelerate progress.
The gradient points uphill. The optimizer chooses a direction and step size to move downhill.
Momentum adds “inertia” so updates keep going in consistent directions.
RMSProp and Adam adapt learning rates per-parameter using running statistics of gradient magnitudes.
Compare how different optimizers move on the same loss surface. Start with Rosenbrock, then try Saddle or Waves. Watch for zig-zagging, overshoot, and stabilization.