Pooling
Shrinking a picture by keeping one representative value per region
- Pooling splits a scanned picture into regions and keeps just one value per region, shrinking its size.
- The most common approach keeps only the single largest value in a region. Averaging is used too.
- A smaller picture lets the layer after it see a wider range at a glance, and cuts down computation and memory too.
- A representative value barely budges even if an object is shifted by a square or two, so pooling shrugs off small jitter in a photo.
- What it loses is exactly which square the value came from. Use it carefully wherever fine position matters.
Contents
1The analogy
A light switch panel hangs on the wall by the front door. There's one square for every room, and if that room's light is on, a little indicator lights up in its square. The living room ceiling might have six bulbs, but the panel still has just one square for it. If even one of those six is on, that square lights up.
The panel mirrors the shape of the house. The top-left square is the entryway, the bottom-right square is the main bedroom. So a glance at the panel tells you which side of the house has its lights on, without walking room to room to check twenty different bulbs.
Something gets lost, though. No amount of staring at the panel tells you which of the living room's six bulbs is the one that's lit — one square stands in for the whole room. That's exactly what pooling does to a picture.
2In detail
Split into regions, keep the representative
Pooling starts with the picture that scanning already produced. Cut that picture into square regions — two squares by two squares is typical — and pick a single value out of each one. Four squares become one, so the width and height each drop by half, and the area shrinks to a quarter of what it was.
Two choices for what to keep as the representative are common. One is picking the single largest value out of the four — keeping only how clearly a pattern showed up anywhere in that region, so nothing prominent gets missed. The other is taking the average of all four — keeping a softer sense of the region's overall mood.
Pooling has no values learned through training. Unlike scanning, there's no tile with numbers written on it — just a rule for picking. So a pooling layer shrinks the picture without adding a single value to remember.
Shrinking widens the view
There's a reason for shrinking. The size of the tile the next layer uses stays the same, but if the picture is now half the size, the area that same tile actually covers on the original photo doubles. Repeat this a few times and a tile that once saw a fingernail-sized spot ends up sweeping a large chunk of the photo at once.
It saves a lot on computation and memory, too. Shrink the picture to a quarter and the next layer's workload drops by that much. This is part of why stacks of layers can still run on a browser or a handheld device.
A small shift barely changes the result
Pooling comes with a bonus. Because only the single largest value in a region gets kept, a pattern can shift one square inside that region and the representative value stays the same. That's where the resilience comes from when a hand shakes and the photo shifts slightly, or an object sits in a slightly different spot than before.
The same trait becomes a weakness elsewhere. Once only the representative value survives, exactly which square in the region it came from is gone. That's fine for recognizing an object, but for work that has to trace a boundary square by square, the lost precision is a real cost. That's why precise work often shrinks a picture and then grows it back, merging it with the finer picture set aside earlier along the way.
Pooling isn't the only way to shrink
In newer architectures, instead of a separate pooling layer, scanning itself sometimes takes bigger strides — moving the tile two squares at a time — to shrink the size. Since even how to shrink gets settled through training, this sometimes fits better.
At the other extreme, a very aggressive form of pooling shows up right at the end: treating the one remaining picture, in full, as a single region and keeping just its average. The picture compresses down to one value, position disappears completely, and all that's left is the fact "this pattern was somewhere in the photo." This move often appears right before the final step of picking a label.
3More precisely
Pooling is an operation that slides a fixed-size window over a picture without overlap and collapses the values inside each window into one. A window size and stride of two squares each is the most common choice; picking the maximum is called max pooling, and averaging is called average pooling. It has no learned values, so it adds nothing to the parameter count, but it stays part of the computation graph and lets the training signal pass straight through. In max pooling, that signal flows back only to the square that was picked.
The switch panel analogy breaks down in one place. An indicator light is only ever on or off, but the representative value pooling keeps is a number with real magnitude. And a switch panel's squares are drawn to match a house's rooms, but pooling's regions are cut mechanically along a grid with no regard for meaning — they often slice straight through the middle of an object's boundary. It's also not true that a value vanishing means its influence vanishes too, since neighboring squares were already mixed together during the scan that came before.
4Try it yourself
5Common misconceptions
It's easy to think pooling compresses and stores information, but actually it's a step that simply discards the values it doesn't pick, and that can't be undone.
It's easy to assume pooling has learned values too, but actually it only has a picking rule — there are no numbers being adjusted.
It's easy to think more pooling is always better, but actually shrinking too aggressively can wipe out small objects or thin lines entirely.
7One-line summary
In shortPooling splits a picture into regions and keeps just one representative value per region, cutting size and computation and shrugging off small jitter, at the cost of fine-grained position.
Spotted an error or have a better analogy? Suggest an edit · Last updated2026-09-02