Supervised Learning of Universal Sentence Representations from Natural Language Inference Data
Abstract
Domain fit: AI-adjacent · Paper appears method- or tooling-adjacent to AI workflows with partial ecosystem coverage.
Many modern NLP systems rely on word embeddings, previously trained in an unsupervised manner on large corpora, as base features. Efforts to obtain embeddings for larger chunks of text, such as sentences, have however not been so successful. Several attempts at learning unsupervised representations of sentences have not reached satisfactory enough performance to be widely adopted. In this paper, we show how universal sentence representations trained using the supervised data of the Stanford Natural Language Inference datasets can consistently outperform unsupervised methods like SkipThought vectors on a wide range of transfer tasks. Much like how computer vision uses ImageNet to obtain features, which can then be transferred to other tasks, our work tends to indicate the suitability of natural language inference for transfer learning to other NLP tasks. Our encoder is publicly available.
Results and benchmarks
Many modern NLP systems rely on word embeddings, previously trained in an unsupervised manner on large corpora, as base features.
Benchmark evidence is limited
Evidence graph: 2 refs, 1 links.
Utility signals: depth 65/100, grounding 58/100, status medium.
Implementation
No direct implementation yet
Maintained implementation evidence is not confirmed for this paper yet.
Use the implementation status and reproduction sections for the current action plan.
No verified maintained repo yet
There is no verified maintained implementation yet. Use this baseline plan to decide whether to prototype now or defer.
- No direct maintained implementation was found. Use the paper PDF and citation graph to design a baseline reproduction.
- Start from related paper: Supervised Learning of Universal Sentence Representations from Natural\n Language Inference Data.
- Track assumptions and missing details in an experiment log before coding.
Time to first repro: a few days
Recommendation evidence is currently too limited for a maintained-repo choice. Use Implementation Status and Reproduction Path for a practical baseline plan.
- Estimate is based on paper-only reproduction flow
Reproduction readiness
No repo
No verified implementation available
- No maintained repository has been identified for this paper. Check adjacent implementations or HF artifacts below.
Hardware requirements
- Expect multi-day setup/compute for meaningful reproduction based on current guidance.
Validation caveat
Hugging Face artifacts
No trustworthy direct or curated related Hugging Face artifacts were found yet. Use targeted searches to quickly locate candidate models, datasets, and demos.
Datasets
Spaces
Tip: start with models, then check datasets and spaces if you need evaluation data or demos.
Research context
136
Citations
36
References
Tasks
Computer science, Inference, Sentence, Transfer of learning, Unsupervised learning, Word (group theory), Natural language, Encoder
Methods
Transformer
Domains
Artificial intelligence, Natural language processing, Machine learning
Related papers
- Supervised Learning of Universal Sentence Representations from Natural\n Language Inference DataSearch on Paper2Code
2017 · Semantic similarity
- Glove: Global Vectors for Word RepresentationSearch on Paper2Code
2014 · Semantic similarity
- Efficient Estimation of Word Representations in Vector SpaceSearch on Paper2Code
2013 · Semantic similarity
- BERT: Pre-training of Deep Bidirectional Transformers for Language UnderstandingSearch on Paper2Code
2019 · Semantic similarity
- A Simple but Tough-to-Beat Baseline for Sentence EmbeddingsSearch on Paper2Code
2017 · Semantic similarity
Open this paper in HFEPX to review benchmark signals, evaluation modes, and human-feedback protocol context.
Open in HFEPXJump to Paper2Code search queries derived from this paper's research context.