Backpropagation (1986) › The Credit Assignment Problem

The puzzle researchers faced seemed deceptively simple on the surface: how do you know which connections in a network are responsible for errors in the output? Consider a concrete example. Imagine you've built a neural network to predict whether movie reviews express positive or negative sentiment. You feed it the clearly positive review "I love this movie" and it confidently predicts negative sentiment. Something has obviously gone wrong, but where exactly? Which of the thousands of connections between neurons should you adjust? By how much? In which direction? And how can you be sure your adjustments will improve things rather than making them worse?

This fundamental challenge became known as the credit assignment problem. The task was figuring out which connections in the network deserve "credit" or "blame" for the network's performance. It's analogous to trying to identify which player on a football team is responsible for a loss. The outcome depends on hundreds of interconnected decisions and actions, and it's not always obvious which ones mattered most.

For single-layer networks, the perceptron learning rule could handle this elegantly enough. When an error occurred, you knew exactly which weights to adjust because there was only one layer of connections between input and output. But multi-layer networks remained largely untrainable. There was no efficient way to send error signals backward through multiple layers to fix the weights responsible for the problem. The deeper the network, the more opaque the relationship between any particular weight and the final output. Researchers had tried various approaches, including methods that essentially treated each layer independently or used random search strategies, but none proved both efficient and effective enough to make deep networks practical.