HackerPapers

arXiv:1802.00844cs.LG

Intriguing Properties of Randomly Weighted Networks: Generalizing While Learning Next to Nothing

Amir Rosenfeld, John K. Tsotsos

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Training deep neural networks results in strong learned representations that show good generalization capabilities. In most cases, training involves iterative modification of all weights inside the network via back-propagation. In Extreme Learning Machines, it has been suggested to set the first layer of a network to fixed random values instead of learning it. In this paper, we propose to take this approach a step further and fix almost all layers of a deep convolutional neural network, allowing only a small portion of the weights to be learned. As our experiments show, fixing even the majority of the parameters of the network often results in performance which is on par with the performance of learning all of them. The implications of this intriguing property of deep neural networks are discussed and we suggest ways to harness it to create more robust representations.

arXiv comments
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.AIArtificial Intelligence cs.CVComputer Vision and Pattern Recognition

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Mar 2018 to Mar 2018.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Very interesting. This also seems related to this recent work that shows that networks can learn by updating only a fraction (10%) of their parameters, having the others fixed to their arbitrarily chosen initial values: https://arxiv.org/abs/1802.00844

      amirrosenfeldView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.