Score breakdown

Sequence to Sequence Learning with Neural Networks

paper-0066 · paper · 2014

Ilya Sutskever, Oriol Vinyals, Quoc V. Le

Encoder-decoder; end-to-end sequence transduction.

Abstract

Deep Neural Networks (DNNs) are powerful models that have achieved excellent performance on difficult learning tasks. Although DNNs work well whenever large labeled training sets are available, they cannot be used to map sequences to sequences. In this paper, we present a general end-to-end approach to sequence learning that makes minimal assumptions on the sequence structure. Our method uses a multilayered Long Short-Term Memory (LSTM) to map the input sequence to a vector of a fixed dimensionality, and then another deep LSTM to decode the target sequence from the vector. Our main result is that on an English to French translation task from the WMT'14 dataset, the translations produced by the LSTM achieve a BLEU score of 34.8 on the entire test set, where the LSTM's BLEU score was penalized on out-of-vocabulary words. Additionally, the LSTM did not have difficulty on long sentences. For comparison, a phrase-based SMT system achieves a BLEU score of 33.3 on the same dataset. When we used the LSTM to rerank the 1000 hypotheses produced by the aforementioned SMT system, its BLEU score increases to 36.5, which is close to the previous best result on this task. The LSTM also learned sensible phrase and sentence representations that are sensitive to word order and are relatively invariant to the active and the passive voice. Finally, we found that reversing the order of the words in all source sentences (but not target sentences) improved the LSTM's performance markedly, because doing so introduced many short term dependencies between the source and the target sentence which made the optimization problem easier. [OpenAlex]

Academic, score -0.1449

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent13362.00.0601430.50.030072OpenAlexhighOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.1recorded as missing; penalized by rule, never imputed
readership_persistencepresent15.01.00.050.05OpenAlexmediumOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.125recorded as missing; penalized by rule, never imputed

Broad Influence, score 0.2120

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent13362.00.0601430.20.012029OpenAlexhighOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.125recorded as missing; penalized by rule, never imputed
readership_persistencepresent15.01.00.40.4OpenAlexmediumOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.075recorded as missing; penalized by rule, never imputed

Governance Practitioner, score -0.2100

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent13362.00.0601430.250.015036OpenAlexhighOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.15recorded as missing; penalized by rule, never imputed
readership_persistencepresent15.01.00.10.1OpenAlexmediumOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.175recorded as missing; penalized by rule, never imputed

A rank is not a verdict on intrinsic worth. It is a transparent output of declared evidence, weights, and missing-data rules at a specific release date.

Disagree with this rank or a number? Challenge it with your evidence. Every challenge gets a public identifier and a published resolution.