Pooling
Interactive lab
Try it: Pooling
How max or average pooling slides a window over a feature map and keeps one number per window, shrinking the map.
How it works
- Place the window over the top-left corner of the feature map.
- Max pooling keeps the largest value in the window; average pooling keeps the mean.
- Move the window by the stride and repeat.
- Output size per side = ⌊(n − k) / s⌋ + 1; each channel is pooled separately.
Default run (11 steps): 6×6 feature map, 2×2 max pooling, stride 2. Output is ⌊(6 − 2) / 2⌋ + 1 = 3 per side. … Done: the 6×6 map shrank to 3×3 — each output keeps one strongest value per window.
Simplified: One small single-channel feature map of whole numbers.
Educational simulation
Loading the simulation…