2
$\begingroup$

Im implementing a neural network framework from scratch in C++ as a learning exercise. There is one concept I don't see explained anywhere clearly: How do you go from your last convolutional/pooling/something layer which is "3 dimensional" to your first fully connected layer in the network?

Many sources say, that you should flatten the data. Does this mean that you should just simply create a $1D$ vector with a size of $N*M*D$ ($N*M$ is the last conv. layer's size, and $D$ is the number of activation maps in that layer) and put the numbers in it one by one in some arbitrary order?

If this is the case I understand how to propagate further down the line, but how does backprogation work here? Just put the values in reverse order into the activation maps?

I also read, that you can do this "flattening" as a tensor contraction. How does that work exactly?

$\endgroup$
  • $\begingroup$ Can you link where you read 'tensor contraction' to replace flattening? $\endgroup$ – DuttaA May 25 at 13:04
1
$\begingroup$

Yes, you are correct (I think it is quite easily implementable in C++ with pointers). The arbitrary order is to be maintained though, since Fully Connected Neural Nets are "Translationally Invariant" i.e. you have to make sure if pixel $(1,5,6)$ is being supplied to node $38$ or being indexed as $37$ as a single datapoint to be input to a Fully Connected Neural Network, then from then on it must be fixed (cannot put say pixel $(1,6,5 )$ in node $38$.

Backpropagation works the same as it always works, it is tough to give a verbal explanation so I will give you this picture:

enter image description here

So, basically if you visualise like this you understand you have to differentiation will propagate, the "flattening" is only reshaping the value lookup table it is not changing the way the values affect final loss, so if you take gradient w.r.t each values and then convert it back to a $3D$ map same way as before and then propagate the gradients as you were doing in previous layers.

$\endgroup$
  • $\begingroup$ "So, basically if you visualise like this you understand you have to differentiation will propagate" I dont understand this sentence. In the last paragraph you mean that this flattening operation does not do any "computation" just spatial rearrangement, so the backprogation is just the inversion of this rearrangement? $\endgroup$ – Á. Márton May 25 at 13:21
  • $\begingroup$ @Á.Márton this is how differentiation works, Ill link you to the original video. The main thing I am trying to say reshaping something will not change anything except dimensions thus backpropagation through nodes will occur in the same way, you just have to make sure the backprop gradients reach the right place. $\endgroup$ – DuttaA May 25 at 13:24
  • $\begingroup$ @Á.Márton nope backpropagation has nothing to do with spatial rearranagement. Wait I'll link you a source,askme after watching it $\endgroup$ – DuttaA May 25 at 13:25
  • $\begingroup$ @Á.Márton youtube.com/… $\endgroup$ – DuttaA May 25 at 13:26
  • $\begingroup$ I'm using cs231n as a reference, I know what backpropagation is in general. I'm asking about this particular case, with the flattening layer: backpropagation here simply means that you rearrange your numbers into the spatial structure before the flattening? $\endgroup$ – Á. Márton May 25 at 13:37

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.