about
Outrageously Large Neural Networks: Up to 137B Parameters (arxiv.org)
2 points by serialx on Jan 29, 2017 | hide | past | pdf | 1 comment on HN

In plain words: Instead of running every part of a network on each example, this layer holds thousands of small sub-networks and a trainable router picks just a few. It grew capacity over 1000-fold with barely any slowdown, beating the best language and translation models at lower cost.

Abstract · Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer

The capacity of a neural network to absorb information is limited by its number of parameters. Conditional computation, where parts of the network are active on a per-example basis, has been proposed in theory as a way of dramatically increasing model capacity without a proportional increase in computation. In practice, however, there are significant algorithmic and performance challenges. In this work, we address these challenges and finally realize the promise of conditional computation, achieving greater than 1000x improvements in model capacity with only minor losses in computational efficiency on modern GPU clusters. We introduce a Sparsely-Gated Mixture-of-Experts layer (MoE), consisting of up to thousands of feed-forward sub-networks. A trainable gating network determines a sparse combination of these experts to use for each example. We apply the MoE to the tasks of language modeling and machine translation, where model capacity is critical for absorbing the vast quantities of knowledge available in the training corpora. We present model architectures in which a MoE with up to 137 billion parameters is applied convolutionally between stacked LSTM layers. On large language modeling and machine translation benchmarks, these models achieve significantly better results than state-of-the-art at lower computational cost.

Noam Shazeer, Azalia Mirhoseini, Krzysztof Maziarz, Andy Davis, Quoc Le, Geoffrey Hinton, Jeff Dean
arXiv:1701.06538 · cs.LG, cs.CL, cs.NE, stat.ML · submitted Jan 23, 2017
abstract · pdf · html

add comment on HN
Also discussed: Dec 2025 (1 point, 0 comments) · Dec 2023 (60 points, 10 comments) · Jun 2019 (65 points, 33 comments) · Jan 2017 (200 points, 81 comments) · Jan 2017 (3 points, 0 comments) · Jan 2017 (1 point, 0 comments) · Jan 2017 (3 points, 0 comments)

Looking at paper like this, I can't help to think about PDP. Will we be able to confirm Parallel distributed processing (PDP) theory in the near future?