The bottleneck layer reduces the training time by diminishing the number of features and operations. By reducing the number of nodes of a newer layer in comparison to previous layers, you can reduce dimensionality.

As shown in the figure, the bottom architecture requires 120 M computations, but by adding the bottleneck layer in the middle, in the architecture shown on top, the number of computations is reduced to 12.4 M.

Bottleneck Layer in Inception Network

If the input has multiple channels, a 1 x 1 convolution filter would help with combining all the numbers in the corresponding cells of all the input channels into one output number.

If we convolve an *n x n x m* input using *f* channels of 1 x 1 convolution filters, we would get an *n x n x f* output, where each cell is a linear combination (weighted average) of all the corresponding cells in different channels of the input.

This helps with reducing the number of channels to save computational power and memory.

University of Michigan - Ann Arbor

Claude

The Inception network, also known as GoogLeNet, is a deep convolutional neural network architecture that arranges multiple Inception modules (multi-branch convolutional blocks) into a sequential pipeline for multi-scale feature detection. GoogLeNet uses a stack of $$9$$ Inception blocks organized into three groups with max-pooling between them, and employs global average pooling in its output head to generate predictions. The stem of the network resembles earlier architectures like AlexNet and LeNet. Max-pooling between Inception block groups reduces the spatial dimensionality. The model is computationally complex and involves a large number of relatively arbitrary hyperparameters governing channel counts, the number of blocks before dimensionality reduction, and the relative partitioning of capacity across channels.

Inception Network (GoogLeNet)

Dive into Deep Learning

1 x 1 Convolution Layer in Neural Networks  
 (Network ~ Network)

Auxiliary classifiers are side branches of an inception network take some hidden layers to make a prediction using a few connected layers and Softmax activation to predict the output label.

They help to ensure that the features computed, even at intermediate layers, are not too bad for protecting the output class of a image. In other words, they have some regularizing effect on the inception network and help prevent it from overfitting.

Auxiliary Classifiers in Inception Network

Going deeper with convolutions paper

Using 1x1 convolution to raise and lower the dimension; Convolution repolymerization is performed simultaneously on multiple sizes.

Convolution on multiple scales at the same time can extract the features of different scales, and the features are richer.

The principle of decomposing sparse matrix into dense matrix is used to speed up the convergence speed.

We should bring together highly relevant features. Separate the features of 1x1, 3x3 and 5x5. Because the ultimate goal of training convergence is to extract independent features, gathering highly correlated features in advance can accelerate convergence.

Effect of Inception

1. Inception

2. Multiple loss: perception net has 22 layers deep. In addition to the output of the last layer, it also uses an auxiliary classification node, that is, the output of a middle layer is used as classification and added to the final classification result according to a small weight (0.3), which is equivalent to model fusion. At the same time, it adds back-propagation gradient signal to the network and provides additional regularization.

Features of GoogLeNet

The fundamental convolutional block in the GoogLeNet architecture is the Inception block. It consists of four parallel branches that process the input to extract information at different spatial scales. The first branch uses a $$1 \times 1$$ convolutional layer. The second and third branches start with a $$1 \times 1$$ convolution to reduce the number of channels and model complexity, followed by $$3 \times 3$$ and $$5 \times 5$$ convolutions, respectively. The fourth branch applies a $$3 \times 3$$ max-pooling layer followed by a $$1 \times 1$$ convolutional layer to adjust channel counts. All branches use appropriate padding to ensure the spatial dimensions (height and width) of the input and output remain identical. Finally, the outputs from these four branches are concatenated along the channel dimension to form the block's output.

Inception Block Structure

The GoogLeNet model is constructed from five sequential modules (labeled $$b_1$$ through $$b_5$$) followed by a fully connected output layer. The overall architecture diagram is shown in Fig. 8.4.2.

- Module $$b_1$$ (Stem): A $$7 	imes 7$$ convolutional layer with $$64$$ output channels, stride $$2$$, and padding $$3$$, followed by ReLU activation and a $$3 	imes 3$$ max-pooling layer (stride $$2$$, padding $$1$$). This module resembles the stems of AlexNet and LeNet.
- Module $$b_2$$: A $$1 	imes 1$$ convolution with $$64$$ channels, then a $$3 	imes 3$$ convolution that triples the channels to $$192$$, each followed by ReLU, concluding with $$3 	imes 3$$ max-pooling (stride $$2$$, padding $$1$$).
- Module $$b_3$$: Two Inception blocks producing $$64+128+32+32=256$$ and $$128+192+96+64=480$$ output channels respectively, followed by $$3 	imes 3$$ max-pooling.
- Module $$b_4$$: Five Inception blocks producing $$512$$, $$512$$, $$512$$, $$528$$, and $$832$$ output channels respectively, followed by $$3 	imes 3$$ max-pooling.
- Module $$b_5$$: Two Inception blocks producing $$832$$ and $$1024$$ output channels respectively, followed by global average pooling (reducing each channel to $$1 	imes 1$$) and a flatten operation.

Finally, a fully connected layer maps the $$1024$$-dimensional representation to the number of output classes.

GoogLeNet Model Architecture

A defining characteristic of GoogLeNet is that it is computationally cheaper to evaluate than its predecessors while simultaneously providing improved accuracy. This architecture initiated a shift toward deliberate network design, where researchers explicitly trade off the computational cost of inference against the reduction of prediction errors.

Learn Before

Related

Learn After