Natural Language Inference¶
Given two sentence (premise and hypothesis), Natural Language Inference (NLI) is the task of deciding if the premise entails the hypothesis, if they are contradiction or if they are neutral. Commonly used NLI dataset are SNLI and MultiNLI.
Conneau et al. showed that NLI data can be quite useful when training Sentence Embedding methods. We also found this in our Sentence-BERT-Paper and often use NLI as a first fine-tuning step for sentence embedding methods.
To train on NLI, see the follwing example files:
training_nli_v2.py - The Softmax-Classification-Loss, as used in our original SBERT paper, does not yield optimal performance. A better loss is MultipleNegativesRankingLoss, where we provide pairs or triplets. In that example, we provide a triplet of the format: (anchor, entailment_sentence, contradiction_sentence). The NLI data provides such triplets. The MultipleNegativesRankingLoss yields much higher performances and is more intuitive than the Softmax-Classifiation-Loss. We have used this loss to train the paraphrase model in our Making Monolingual Sentence Embeddings Multilingual using Knowledge Distillation paper.
|Sentence A (Premise)||Sentence B (Hypothesis)||Label|
|A soccer game with multiple males playing.||Some men are playing a sport.||entailment|
|An older and younger man smiling.||Two men are smiling and laughing at the cats playing on the floor.||neutral|
|A man inspects the uniform of a figure in some East Asian country.||The man is sleeping.||contradiction|
The softmax loss looks like this:
We pass the two sentences through our SentenceTransformer network and get the sentence embeddings u and v. We then concatenate u, v and |u-v| to form one, long vector. This vector is then passed to a softmax classifier, which predicts our three classes (entailnment, neutral, contradiction).
This setup learns sentence embeddings, that can later be used for wide varity of tasks.
That the softmax-loss with NLI data produces (relatively) good sentence embeddings is rather coincidental. The MultipleNegativesRankingLoss is much more intuitive and produces also significantly better sentence representations.
The training data for MultipleNegativesRankingLoss consists of sentence pairs [(a1, b1), …, (an, bn)] where we assume that (ai, bi) are similar sentences and (ai, bj) are dissimilar sentences for i != j. The minimizes the distance between (ai, bi) while it simultaneously maximizes the distance (ai, bj) for all i != j.
For example in the following picture:
The distance between (a1, b1) is reduced, while the distance between (a1, b2…5) will be increased. The same is done for a2, …, a5.
Using MultipleNegativeRankingLoss with NLI is rather easy: We define sentences that have an entailment label as positive pairs. E.g, we have pairs like (“A soccer game with multiple males playing.”, “Some men are playing a sport.”) and want that these pairs are close in vector space.
MultipleNegativesRankingLoss with Hard Negatives¶
We can further improve MultipleNegativesRankingLoss by not only providing pairs, but by providing triplets: [(a1, b1, c1), …, (an, bn, cn)]
The entry for ci are so-called hard-negatives: On a lexical level, they are similar to ai and bi. But on a semantic level, they mean different things and should not be close in the vector space.
For NLI data, we can use the contradiction-label to create such triplets with a hard negative. So our triplets look like this: (“A soccer game with multiple males playing.”, “Some men are playing a sport.”, “A group of men playing a baseball game.”).
We want the sentences “A soccer game with multiple males playing.” and “Some men are playing a sport.” to be close in the vector space, while there should be a larger distance between “A soccer game with multiple males playing.” and “A group of men playing a baseball game.”.