← Questions
2D max pooling that also returns where each maximum came from
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Implement 2D max pooling over a grid of integers: a k by k window moves across the grid with a given stride, and each window outputs its maximum. Follow-up: for every output cell, also return the coordinates in the input of the maximum, and say how you break ties.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding