• ImageNet Objects in realistic settings exhibit considerable variability, so to learn to recognize them it is necessary to use much larger training sets. ImageNet consists of over 15 million labeled high-resolution images in over 22,000 categories.
  • CNNs To learn about thousands of objects from millions of images, we need a model with a large learning capacity. Convolutional neural networks (CNNs) constitute one such class of models. Their capacity can be controlled by varying their depth and breadth, and they also make strong and mostly correct assumptions about the nature of images (namely, stationarity of statistics and locality of pixel dependencies).


The specific contributions of this paper are as follows:

  • We trained one of the largest convolutional neural networks to date on the subsets of ImageNet used in the ILSVRC-2010 and ILSVRC-2012 competitions and achieved by far the best results ever reported on these datasets.
  • We wrote a highly-optimized GPU implementation of 2D convolution and all the other operations inherent in training convolutional neural networks, which we make available publicly.
  • Our network contains a number of new and unusual features which improve its performance and reduce its training time.
  • The size of our network made overfitting a significant problem, even with 1.2 million labeled training examples, so we used several effective techniques for preventing overfitting.
  • Our final network contains five convolutional and three fully-connected layers, and this depth seems to be important: we found that removing any convolutional layer (each of which contains no more than 1% of the model’s parameters) resulted in inferior performance.


The neural network, which has 60 million parameters and 650,000 neurons, consists of five convolutional layers, some of which are followed by max-pooling layers, and three fully-connected layers with a final 1000-way softmax.


Motivation: We are not the first to consider alternatives to traditional neuron models in CNNs.

The standard way to model a neuron’s output f as a function of its input x is with f(x)=tanh(x)f(x)=tanh(x) or f(x)=(1+e−x)−1f(x)=(1+e_{−x})^{−1}. In terms of training time with gradient descent, these saturating nonlinearities are much slower than the non-saturating nonlinearity f(x)=max(0,x)f(x)=max(0,x). Deep convolutional neural networks with ReLUs train several times faster than their equivalents with tanh units.

Note: Saturation of Sigmoid f(x) refers to the time when the output is almost zero or 1, where the gradient in the region is almost zero, causing the local gradient to disappear.

A four-layer convolutional neural network with ReLUs (solid line) reaches a 25% training error rate on CIFAR-10 six times faster than an equivalent network with tanh neurons (dashed line).

Training on Multiple GPUs

A single GTX 580 GPU has only 3GB of memory, which limits the maximum size of the networks that can be trained on it. It turns out that 1.2 million training examples are enough to train networks which are too big to fit on one GPU. Therefore we spread the net across two GPUs. The parallelization scheme that we employ essentially puts half of the kernels (or neurons) on each GPU, with one additional trick: the GPUs communicate only in certain layers. Result: This scheme reduces our top-1 and top-5 error rates by 1.7% and 1.2%, respectively, as compared with a net with half as many kernels in each convolutional layer trained on one GPU. The two-GPU net takes slightly less time to train than the one-GPU net.

Local Response Normalization

Motivation: This sort of response normalization implements a form of lateral inhibition inspired by the type found in real neurons, creating competition for big activities amongst neuron outputs computed using different kernels.

We still find that the following local normalization scheme aids generalization. Denoting by aix,ya_{x,y}^i the activity of a neuron computed by applying kernel ii at position (x,y)(x, y) and then applying the ReLU nonlinearity, the response-normalized activity bix,yb^i_{x,y} is given by the expression


b^i_{x,y} = a_{x,y}^i / ( k + \alpha \sum _{j = max(0, i-n / 2)} ^{min(N-1, i+n / 2)} (a_{x,y}^i)^2 )^\beta

where the sum runs over n “adjacent” kernel maps at the same spatial position, and N is the total number of kernels in the layer. The constants k, n, α, and β are hyper-parameters whose values are determined using a validation set; we used k = 2, n = 5, α = 0.0001, and β = 0.75.

Result: Response normalization reduces our top-1 and top-5 error rates by 1.4% and 1.2%, respectively.

Overlapping Pooling

A pooling layer can be thought of as consisting of a grid of pooling units spaced ss pixels apart, each summarizing a neighborhood of size z×zz × z centered at the location of the pooling unit. If we set s=zs = z, we obtain traditional local pooling as commonly employed in CNNs. If we set s<zs < z, we obtain overlapping pooling. This is what we use throughout our network, with s=2s = 2 and z=3z = 3.

Result: This scheme reduces the top-1 and top-5 error rates by 0.4% and 0.3%, respectively. We generally observe during training that models with overlapping pooling find it slightly more difficult to overfit.

Overall Architecture

Reduce Overfitting

Data Augmentation

The first form of data augmentation consists of generating image translations and horizontal reflections.

The second form of data augmentation consists of altering the intensities of the RGB channels in training images. Specifically, we perform PCA on the set of RGB pixel values throughout the ImageNet training set. To each training image, we add multiples of the found principal components, with magnitudes proportional to the corresponding eigenvalues times a random variable drawn from a Gaussian with mean zero and standard deviation 0.1. Therefore to each RGB image pixel Ixy=[IRxy,IGxy,IBxy]TI_{xy} = [I^R_{xy} , I^G_{xy} , I^B_{xy} ]^T we add the following quantity:


[p_1, p_2, p_3][\alpha_1\lambda_1, \alpha_2\lambda_2, \alpha_3\lambda_3]^T

where p_ip\_i and λi\lambda_i are iith eigenvector and eigenvalue of the 3 × 3 covariance matrix of RGB pixel values, respectively, and αi\alpha_i is the aforementioned random variable.

Result: This scheme reduces the top-1 error rate by over 1%.


Motivation: Combining the predictions of many different models is a very successful way to reduce test errors, but it appears to be too expensive for big neural networks that already take several days to train.

There is, however, a very efficient version of model combination that only costs about a factor of two during training. The recently-introduced technique, called “dropout”, consists of setting to zero the output of each hidden neuron with probability 0.5. We use dropout in the first two fully-connected layers. Without dropout, our network exhibits substantial overfitting. Dropout roughly doubles the number of iterations required to converge.

Experimental Results


Supplement material




0 条评论
登录 后参与评论





原 初学图论-Kahn拓扑排序算法(Kah


HashMap 多线程下死循环分析及JDK8修复

来自专栏xingoo, 一个梦想做发明家的程序员


这个算法来求关键路径,其实就是利用拓扑排序,首先求出,每个节点最晚开始时间,再倒退求每个最早开始的时间。 从而算出活动最早开始的时间和最晚开始的时间,如果这两个...


LeetCode Invert Binary Tree题目分析

Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9 to4 / \ 7 2 / \ / \9 6 3 1 Tri...



1. 贝叶斯定理:        (1)   P(A^B) = P(A|B)P(B) = P(B|A)P(A)   由(1)得    P(A|B) = P(B|...



为了能讲明白弗洛伊德(Floyd)算法的主要思想,我们先来看最简单的案例。图7-7-12的左图是一个简单的3个顶点的连通网图。 ? 我们先定义两个二维数组D[3...

来自专栏xingoo, 一个梦想做发明家的程序员




原 数据结构-红黑树(Red-Black



导语: 这里分析的ArrayList是使用的JDK1.8里面的类,AndroidSDK里面的ArrayList基本和这个一样。 分析的方式是逐个API进行解析 ...