November 11, 2026

Backpropagation Explained: How Neural Networks Learn From Errors

Backpropagation explained cover with concentric blue and coral arcs and the article title

Backpropagation is the method that lets a neural network learn from its mistakes. A network makes a prediction, compares it with the right answer, measures the error and then works out which of its many internal numbers contributed to that error and by how much. It adjusts them slightly, and repeats this millions of times. Almost every neural network you have used, from image recognisers to chat assistants, was trained with some form of this idea. The name sounds technical, but the core is a careful use of ordinary school calculus, and you can understand it without writing a single formula.

This guide explains backpropagation in plain words. It covers what a network is trying to learn, the forward pass, the loss, the chain rule that moves blame backward, how weights are updated, what can go wrong, how it connects to gradient descent, why it needs so much computing power and how to ask an assistant such as Ask Mio to explain it at your level. No mathematics background is needed, though a few small numerical examples are included.

What a neural network is trying to learn

A neural network is a chain of simple calculations. Each unit multiplies its inputs by numbers called weights, adds them up and passes the result through a simple function. Thousands or billions of such units are arranged in layers. At the start of training the weights are essentially random, so the network’s predictions are poor. Training means finding weights that make predictions good. Our introduction to neural networks describes the structure, and this article focuses on how the numbers get better.

The challenge is scale. A modern network can have billions of weights, and each one influences the final answer in a tangled way. Changing weights at random would take forever. Backpropagation gives a systematic way to find out, for every weight at once, whether it should go up or down and by roughly how much.

Step one: the forward pass

Training starts with a forward pass. You show the network an example, such as a photo with a label or a sentence with the next word hidden. The input moves through the layers, each applying its weights, until the final layer produces an output: a probability for each possible label, or a score for each possible next word. Nothing is learned yet. The forward pass simply records what the network currently thinks, and it keeps the intermediate values, because they are needed later.

  1. The input arrives as numbers, such as pixel values or token ids.
  2. Each layer transforms the numbers using its weights.
  3. The last layer produces the prediction.
  4. The intermediate values are stored for the backward pass.

Step two: measuring the error with a loss

Next, the prediction is compared with the correct answer using a loss function. The loss is a single number that is small when the prediction is good and large when it is bad. For a classification task, a common loss grows sharply when the network was confident and wrong. For predicting a price, the loss might be the squared difference between the predicted and real value. The choice of loss defines what “better” means, so it shapes everything the network learns.

Everything that follows aims at one goal: reduce this number. If the loss falls on many examples, the network is improving. If it stops falling, learning has stalled. The idea of an error that you measure and then reduce is also central to overfitting, where the error on training data looks good while the error on new data does not.

Step three: the chain rule moves blame backward

Here is the heart of backpropagation. The loss depends on the output, the output depends on the last layer’s weights and on the layer before, which depends on the layer before that, and so on back to the input. The chain rule from calculus says how to compute the effect of a change at one end of a chain on the other end: multiply the effect of each link. Backpropagation applies this rule layer by layer, starting at the loss and moving backward.

A small example makes this concrete. Suppose a tiny network computes output = w2 times (w1 times x). Let x = 2, w1 = 3 and w2 = 0.5, so the output is 3, and the correct answer is 4. The error is 1 too low. If you raise w2 by a little, the output rises by about x times w1, which is 6 times the change. If you raise w1 by a little, the output rises by w2 times x, which is 1 times the change. So w2 has a stronger effect here. These effects are called gradients, and backpropagation computes them for every weight without trying each change separately.

  • Gradient: how much the loss changes if a weight changes a tiny amount.
  • Backward pass: computing all gradients efficiently by reusing results from later layers.
  • Reuse: the key saving is that each layer’s gradient builds on the one after it, so no work is repeated.

You can read the formal description in the article on backpropagation, which also covers its history.

Step four: updating the weights

Once every weight has a gradient, the network updates it. The usual rule is to move each weight a small step in the direction that lowers the loss. The size of the step is set by a number called the learning rate. A step that is too large can overshoot and make things worse, and a step that is too small makes training painfully slow. This update rule is called gradient descent, and backpropagation is the method that supplies its gradients. In short, backpropagation says which way is downhill, and gradient descent takes the step.

Part of training What happens Plain analogy
Forward pass Input flows through the layers to a prediction A student attempts a problem
Loss The prediction is scored against the answer The teacher marks the attempt
Backward pass Gradients are computed for every weight Working out which step caused the mistake
Update Weights move a small step to reduce the loss Adjusting the method for next time
Repeat Many examples, many rounds Practice until the results are steady

Batches, epochs and the training loop

Networks rarely learn from one example at a time. Training uses small groups of examples, called batches, and averages the gradients across a batch to get a steadier signal. A full pass through the dataset is an epoch, and training may take many epochs. Each step is cheap, but the number of steps is huge. For large models, training runs across many specialised chips for weeks, which is why the process is so expensive and why the training stage is separate from the later use of the model, described in our article on AI pretraining.

What can go wrong

Backpropagation is powerful but not magic. Several well-known problems appear in practice.

  • Vanishing gradients. In deep networks, the multiplied effects can shrink toward zero, so early layers barely learn. Better activation functions and connections that skip layers reduce this problem.
  • Exploding gradients. The opposite: the numbers grow too large and training becomes unstable. Clipping the gradient is a common fix.
  • Poor learning rate. Too high and the loss bounces, too low and training crawls.
  • Local traps. The loss landscape has many bumps, and training can settle in a place that is good but not best.
  • Overfitting. The network memorises training examples. More data, regularisation and early stopping help.

Modern training uses refinements of the basic method, with adaptive step sizes and careful starting values, but they all rest on the same backward pass.

Backpropagation in language models

The assistants people chat with are mostly built on the transformer design, explained in our guide to transformer models. They are trained by showing huge amounts of text with the next word hidden, measuring how wrong the guess was and sending the error backward through the whole network. Later training stages, such as learning from human feedback, use related ideas to nudge the model toward more helpful answers. Importantly, backpropagation happens during training. When you chat with an assistant, the weights are fixed and only the forward pass runs. The model does not learn from your conversation by changing its weights in real time.

A second small example: two weights in a row

Take the earlier example one step further. With w1 = 3, w2 = 0.5 and x = 2, the output is 3 and the target is 4, so the error is 1 (target minus output). Using a learning rate of 0.01 and the gradients described above, the update raises w2 by a small amount proportional to 6 and raises w1 by an amount proportional to 1. After one step the output moves slightly closer to 4. After many steps it reaches 4 and the loss is close to zero. Real networks do exactly this with billions of weights and with loss functions that are more complicated, but the logic of each step is the same. Seeing the numbers move helps most people grasp the idea faster than a page of equations.

Common misunderstandings

  1. “The network understands its errors.” It does not. It computes numbers that point toward a lower loss.
  2. “Backpropagation is how the brain learns.” It was inspired by the idea of learning from error, but there is no evidence that brains use this exact method.
  3. “More training always helps.” Past a point it leads to overfitting or wasted effort.
  4. “The assistant learns from me while we chat.” The weights stay fixed during use, although some products save your preferences as separate memory.

Learning backpropagation with an assistant

An assistant is a patient tutor for this topic. Ask Mio to explain backpropagation to a ten-year-old, then to a high school student, then to a programmer, and compare the three. Ask it to build a two-weight example with real numbers and show each step. The exact arithmetic matters here, and the features page lists a calculator tool that evaluates expressions exactly, so you can ask Mio to compute gradients and check the working. On plans with the code execution sandbox, you can ask for a few lines of Python that train a tiny network and print the loss at each step. Run it, change the learning rate and watch what happens. Our guide to AI model parameters gives useful context before you begin.

Frequently Asked Questions

What is backpropagation in simple words?

It is the method a neural network uses to work out which of its internal numbers caused an error and how to change them. The network makes a prediction, measures how wrong it was, then sends that error backward through its layers to compute a correction for every weight. Repeating this many times improves its predictions.

How is backpropagation different from gradient descent?

Backpropagation computes the gradients, which show how the loss changes when each weight changes. Gradient descent uses those gradients to update the weights in the direction that lowers the loss. They work as a pair: one finds the downhill direction for every weight, and the other takes the step.

Does an assistant learn through backpropagation while I chat?

No. Backpropagation happens during training. When you chat with an assistant, the model’s weights are fixed and only the forward pass runs to produce the answer. Some products add separate memory that stores your preferences, but that is not the model rewriting its own weights during the conversation.

Why do deep networks need so much computing power?

Every training step needs a forward pass and a backward pass across billions of weights, and training needs millions of steps over huge datasets. Specialised chips run these calculations in parallel. The cost is one reason large models are trained once by a few organisations and then used by many people.

Do I need calculus to understand it?

Not to grasp the idea. The chain rule is the only essential piece, and it says that effects along a chain multiply. You can follow small numerical examples with basic arithmetic. If you want the full mathematics, ask an assistant to walk through a two-weight network step by step.

The Bottom Line

Backpropagation is the efficient way a network finds out how every weight contributed to an error: a forward pass makes a prediction, the loss scores it, the chain rule sends blame backward and gradient descent takes a small step. It explains how modern AI learns during training, and why it does not learn from your chat afterwards. Ask Mio to explain it with small numbers, and try the free plan or compare options on the Ask Mio pricing page.


Try Ask Mio free

Free plan, no card required.

Start free