AIAny
Icon for item

Sequence to Sequence Learning with Neural Networks

End-to-end encoder–decoder using deep LSTMs to map variable-length input sequences to output sequences; demonstrated competitive English→French translation (BLEU 34.8) and improved optimization by reversing source sentences, showing strong handling of long sentences.

Introduction

Most pre-2014 sequence systems relied on hand-engineered pipelines or phrase-based SMT; this paper showed a surprisingly simple end-to-end recipe could close the gap. The core insight: stack deep LSTM encoders and decoders and train them directly on sequence pairs — with a small training trick (reverse source word order) the model learns shorter-term dependencies that make optimization easier.

Key Findings
  • Competitive translation without explicit alignment: a deep LSTM encoder produces a fixed-size vector that a deep LSTM decoder turns into a target sentence; on WMT'14 English→French the model reached BLEU 34.8 (and 36.5 after reranking SMT hypotheses), comparable to phrase-based SMT at the time.
  • Robustness to long sentences: the model handled long sentence inputs better than expected, indicating the learned vector representations captured long-range structure.
  • Simple optimization trick matters: reversing source sentence word order substantially improved training convergence and final quality by creating shorter-term dependencies between corresponding source/target words.
  • Representations capture syntax-sensitive roles: the authors observed learned phrase and sentence vectors were sensitive to word order and relatively invariant to active/passive voice.
Who It's For and Trade-offs

Great fit if you want a clear, historically important baseline for sequence modeling, or a compact encoder–decoder architecture to prototype translation, summarization, or other seq→seq tasks. Look elsewhere if you need: scalable attention-based alignment (this paper predates attention), efficient handling of very large vocabularies/OOVs out of the box, or state-of-the-art throughput on modern NLP benchmarks — later models (attention, transformers) improved quality and efficiency.

Where It Fits

This work is a foundational milestone: it motivated follow-ups (attention mechanisms, global/local alignment, and ultimately transformer architectures) by demonstrating that simple learned sequence encoders and decoders can match classical systems. Use it for research comparisons, teaching, or understanding the evolution from RNN-based seq2seq to attention-first models.

How It Works (brief)
  • Architecture: two separate deep LSTMs (encoder → fixed-size vector → decoder). No explicit attention mechanism.
  • Training/data: trained end-to-end on parallel corpora; evaluation used WMT'14 English→French and reranking experiments with SMT n-best lists.
  • Practical note: the source-reversal trick is an inexpensive preprocessing step that improved gradient flow during training and yielded measurable BLEU gains.

Information

  • Websitearxiv.org
  • AuthorsIlya Sutskever, Oriol Vinyals, Quoc V. Le
  • Published date2014/09/10

More Items

Converts a natural-language function specification into a reusable local neural function by using teacher models to synthesize examples and finetuning a small adapter for a compact interpreter. Achieves higher semantic accuracy (83.6% on FuzzyBench-Hard) at the cost of roughly one minute compile time; produces versionable PAW artifacts for local deployment.

Introduces Declarative Attention (DA), a zero-shot protocol that has LMs declare which parts of long context to attend to during chain-of-thought, letting the runtime build dynamic attention masks and skip most KV-cache reads. Produces large token savings (up to ~52% on Gemma-4-31B) with modest accuracy loss.

Generates compact keyword sets for both queries and items with LLMs and matches them directly via an inverted index. Uses supervised fine-tuning to align keyword spaces, then alternates GRPO-based reinforcement learning on query- and item-side generators to co-evolve representations and maximize retrieval F1 while staying compatible with keyword-based infrastructure.