An approach for dealing with the pooling layer issue that works as follows:

1. The stride of the max-pooling operation is constrained to be equal to the width of the pooling region.
2. The maximum input within each pooling region is assumed to be the input in the upper-left corner.
3. All nonmaximal inputs within each pooling region are assumed to be zero.

The inverse un-pooling operation allocates a tensor of zeros, then copies each value from spatial coordinate $i$ of the input to spatial coordinate $i\times k$ of the output, where $k$ is an integer that defines the size of the pooling region.