Skip to content
Back to the collection

Improving neural networks by preventing co-adaptation of feature detectors

Geoffrey E. Hinton, Nitish Srivastava, Alex Krizhevsky, Ilya Sutskever, Ruslan R. Salakhutdinov

2012 · arXiv

Read the paper
HN score
0
Mentions
7
Readers
7
Months
7
What’s in a score?

From the abstract

When a large feedforward neural network is trained on a small training set, it typically performs poorly on held-out test data. This "overfitting" is greatly reduced by randomly omitting half of the feature detectors on each training case. This prevents complex co-adaptations in which a feature detector is only helpful in the context of several other specific feature detectors. Instead, each neuron learns to detect a feature that is generally helpful for producing the correct answer given the combinatorially large variety of internal contexts in which it must operate. Random "dropout" gives big improvements on many benchmark tasks and sets new records for speech and object recognition.

Metadata: arXiv. Abstracts retain their original authors’ rights.

In the conversation

Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels

7 selected excerpts · 7 total mentions

esafak
Neutral mention · rule
That is one lens to view it through. Co-adaptation reduction is another, and it is an intuitive one: generalization ability is improved if a neuron has to be predictive in multiple contexts, and can't rely on other neurons to lift all the weight, if you pardon the pun. Improving neural networks by preventing co-adaptation of feature detectors https://arxiv.org/abs/1207.0580
spacehacker
Neutral mention · rule
The dropout regularization method for neural networks was sort of inspired by this observation, i.e. that recombination (combining genes of more than one individual) makes the resulting structures more robust [1]. The idea is basically that it avoids overfitting to the evolutionary context. This has two effects: the fitness cannot change very quickly in response to single mutations, and, conversely, it avoids that genes co-adapt such that the entire genome becomes inflexible at exploring alternatives. To achieve the same without sex, mutations would would have both break up the co-adapted genes without breaking their functions and also find a good alternative mutation.…
Read the full comment
With sex, it does not matter if co-adapted genes are broken up, because they are forced to evolve to deal with it. (This is kind of similar to the concept of learning to learn in neural network research.) Also, if a parent gene is unfit, it is possible that the child can escape this mutation by receiving that part of the genome from the other parent instead by a 50% chance. [1] https://arxiv.org/abs/1207.0580
sja
Neutral mention · rule
Good list! I think it's important to note that this article is (intentionally) focused on modern CNN architectures, and not "deep learning" in general. I'd also add in the following "technique" articles: Geoff Hinton et al.'s dropout paper[0] and Loffe and Szegedy's Batch Normalization paper[1]. I don't think there's been enough time for the dust to settle, but I'm excited about the possibilities Stochastic Depth[2] could offer, too. [0]: http://arxiv.org/abs/1207.0580 [1]: http://arxiv.org/abs/1502.03167 [2]: http://arxiv.org/abs/1603.09382
eivarv
Neutral mention · rule
1) The evidence is that when you for instance visualize the features learned in the layers of a deep convolutional neural net, you'll see that these correspond to layers of abstraction, with each layer's features building upon concepts from the previous layer(s). I found an image [0] (on a site [1]) that illustrates it nicely. 2) Deep learning is really a term that denotes machine learning using models that attempt to abstract the data via multiple layers (popularly in artificial neural networks). Not all deep neural nets are unsupervised, but unsupervised pre-training [2] was an approach that was [3] very popular until dropout [4,5] (and its variations) appeared. See,…
Read the full comment
for instance, some of the standard datasets [6] of the field, on some of which deep neural nets achieved state of the art accuracy using supervised learning. [0]: http://www.rsipvision.com/wp-content/uploads/2015/04/Slide6.... [1]: http://www.rsipvision.com/exploring-deep-learning/ [2]: https://www.youtube.com/watch?v=Oq38pINmddk [3]: http://fastml.com/deep-learning-these-days/ [4]: http://arxiv.org/pdf/1207.0580.pdf [5]: http://www.cs.toronto.edu/~hinton/absps/JMLRdropout.pdf [6]: http://rodrigob.github.io/are_we_there_yet/build/
billderose
Neutral mention · rule
Hinton's DropOut [1] and Wan's DropConnect [2] have ameliorated some of the overfitting issues present in traditional NN's. In fact, DropConnect in conjunction with deep learning are responsible for new records being set on classical datasets such as MNIST. [1] http://arxiv.org/pdf/1207.0580.pdf [2] http://cs.nyu.edu/~wanli/dropc/
thisisdave
Neutral mention · rule
>Neural networks? See The Vanishing Gradient Problem. For what it's worth, Geoff Hinton and others have had a lot of success in the last few years by intentionally injecting noise into their neural network computations. The best-known example is [0], but he's also had some success just adding noise to the calculation of the gradient in good old sigmoid MLPs--even reducing the information content of the gradient below a single bit in some cases. Going back further, stochastic gradient descent and other algorithms have shown for decades that trading accuracy for speed can be very desirable for neural network computations. [0] http://arxiv.org/pdf/1207.0580.pdf
psb217
Neutral mention · rule
In addition to what bravura said, Geoff Hinton's group at UT has recently introduced a new approach to training neural networks that they call "dropout". You can read about it in their paper (http://arxiv.org/pdf/1207.0580.pdf) or watch Hinton describe it in a recent talk he gave at Google (http://www.youtube.com/watch?v=DleXA5ADG78). Roughly speaking, dropout training provides a strong regularizing effect through a sort of model averaging that is conceptually related to the well-known bagging approach from which random forests derive their power and flexibility. Dropout training has already produced state-of-the art results on several time-worn standard benchmarks and…
Read the full comment
helped Hinton's group win a recent Kaggle competition (for an overview of their approach, see: http://blog.kaggle.com/2012/11/01/deep-learning-how-i-did-it...). I've played around with this a bit over the last few weeks, and have a Matlab implementation publicly available from my Github at: https://github.com/Philip-Bachman/NN-Dropout.

Keep following the thread.

More in Machine learning

More from the same topics.

2018arXiv

Talent vs Luck: the role of randomness in success and failure

A. Pluchino. A. E. Biondo, A. Rapisarda

The largely dominant meritocratic paradigm of highly competitive Western cultures is rooted on the belief that success is due mainly, if not exclusively, to personal qualities such as talent, intelligence, skills, efforts or risk taking.

16 mentions14 months
2.5HN score