Relation

Convolution and Pooling as an Infinitely Strong Prior

We can compare convolution to a fully connected net, but with an infinitely strong prior over its weights:

  1. the weights for one hidden unit must be identical to the weights of its neighbor but shifted in space.
  2. the weights must be zero, except for the small, spatially contiguous receptive field assigned to that hidden unit.

Pooling is similar:

  1. contains only local interactions and is equivariant to translation
  2. each unit should be invariant to small translations.

0

1

Updated 2021-07-01

References


Tags

Data Science