Data Flow: Forward Propagation Explained

An autoencoder's primary function is to reconstruct its input, with its performance often evaluated using loss functions. To produce that reconstruction, data must move through the autoencoder. This one-way movement of data, from the input to the output layer, is known as forward propagation.

Imagine you're sending a message ($X$) through a series of translators and summarizers, and then back through expanders and translators to try and get the original message ($X'$) back. Forward propagation is this entire send-and-receive process.

Here's a step-by-step breakdown of how data flows:

1. Entering the Input Layer: Your data, whether it's an image, a set of numbers, or sensor readings, first enters the input layer. This layer doesn't do any computation; it simply passes the raw data into the first part of the autoencoder, the encoder. Let's call our input data $X$.

2. Exploration of the Encoder: The data then travels through the encoder. The encoder is typically made up of one or more "hidden layers." Each layer contains processing units (often called neurons).

   • As data enters a neuron, it's multiplied by weights. Think of weights as knobs that control the strength or importance of each piece of incoming information.
   • A bias term is then added. A bias is like a small, constant adjustment that helps fine-tune the neuron's output.
   • The result of these calculations (weighted sum of inputs plus bias) is then passed through an activation function. This function decides what the neuron's final output will be, often transforming the value into a specific range or determining if the neuron should be "active." The encoder's job is to compress the input data. So, typically, each subsequent layer in the encoder will have fewer neurons than the previous one, gradually squeezing the information into a more compact form.

3. Reaching the Bottleneck (Latent Space): After passing through all the encoder layers, the data arrives at the bottleneck layer, also known as the latent space. This layer has the smallest number of neurons in the autoencoder. The output of this layer is the compressed representation of the input data, often denoted as $z$. This $z$ is a dense summary, capturing the most important features of the input in a lower-dimensional space.

4. Expansion Through the Decoder: The compressed representation $z$ is then fed into the decoder. The decoder's structure is usually a mirror image of the encoder. It takes the compact information from the bottleneck and starts to expand it back towards the original data's shape.

   • Similar to the encoder, the decoder has hidden layers with neurons, weights, biases, and activation functions.
   • However, in the decoder, layers typically increase in size, progressively "unpacking" the compressed information.

5. Producing the Output Layer: Finally, the data passes through the last layer of the decoder, called the output layer. The output of this layer is the autoencoder's reconstruction of the original input data. We can call this reconstructed data $X'$. The number of neurons in the output layer must match the number of features (e.g., pixels in an image, columns in a dataset) in the original input layer.

This entire process, from $X$ to $X'$, is one "forward pass" or "forward propagation." The autoencoder takes the input, pushes it through its network of layers and calculations, and produces an output.

The diagram shows the path data takes during forward propagation. It starts as input ($X$), gets compressed by the encoder into a latent representation ($z$) at the bottleneck, and then the decoder attempts to reconstruct the original data ($X'$) from this representation.

The output $X'$ generated by this forward propagation is what we then compare to the original input $X$. The difference between them, as we discussed with loss functions, tells us how well the autoencoder is performing its reconstruction task. This error measure is then used in the next step, backpropagation, to adjust the autoencoder's weights and biases, which we'll cover next.