2016/09/14 by Édouard Grave, Edouard Grave, Grave, Edouard +9 · 14 citations
Computer Science · #Advanced Neural Network Applications #Computation and Language (cs.CL) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Neural Networks and Applications #Parallel Computing and Optimization Techniques #cs.CL #cs.LG
paper · pdf · doi:10.48550/arxiv.1609.04309
Accepted to ICML 2017
openalex publication_date 2016/09/14 · arxiv created 2017/06/19 · arxiv updated 2017/06/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose an approximate strategy to efficiently train neural network based language models over very large vocabularies. Our approach, called adaptive softmax, circumvents the linear dependency on the vocabulary size by exploiting the unbalanced word distribution to form clusters that explicitly minimize the expectation of computation time. Our approach further reduces the computational time by exploiting the specificities of modern architectures and matrix-matrix vector operations, making it particularly suited for graphical processing units. Our experiments carried out on standard benchmarks, such as EuroParl and One Billion Word, show that our approach brings a large gain in efficiency over standard approximations while achieving an accuracy close to that of the full softmax. The code of our method is available at https://github.com/facebookresearch/adaptive-softmax.