0 / 0
IBM slate-30m-english-rtrvr model card

IBM slate-30m-english-rtrvr model card

Model description

The slate.30m.english.rtrvr model is a standard sentence transformers model based on bi-encoders. The model produces an embedding for a given input e.g. query, passage, document etc. At a high level, our model is trained to maximize the cosine similarity between two input pieces of text e.g. text A (query text) and text B (passage text), which result in the sentence embeddings q and p. These sentence embeddings can then be compared using cosine similarity.

Diagram that compares the Slate encoded query text to encoded passage text

Figure 1. Bi-encoder Embeddings Model for Retrieval

Base language model

The underlying Language Model (LM) for our embeddings is slate.30m.english. It has the same architecture as a small-RoBERTa base transformer model (6 layers) and has ~30 million parameters and an embedding dimension of 384. Specifically, “slate.30m.english” was distilled from “slate.125m.english” (formerly, WatBERT). Our final model is called “slate.30m.english.rtrvr” - notice the suffix at the end denoting that we fine-tune the underlying model architecture for retrieval-based tasks.

Training algorithm

Most embedding models that are either state-of-the-art or at the top of the MTEB leaderboard are typically trained in 3 stages:

  1. Task Specific (retrieval-based) pre-training
  2. Task specific fine-tuning on mined pairs
  3. Fine-tuning on supervised pairs

We follow a similar approach, combining the final two stages into a single fine-tuning step.

slate.30m.english.rtrvr is produced by distilling from the “slate.125m.english.rtrvr” model in the fine-tuning step. Knowledge Distillation transfers the knowledge from a high-performing teacher model into a smaller student model by training the student’s output probability distribution to match that of the teacher as closely as possible, improving the student’s performance compared to stand-alone finetuning.

Task-specific pre-training

This stage uses the RetroMAE framework, to make our underlying LM more retrieval oriented. We initialize our base LM with slate.30m.english and continue with RetroMAE pre-training, using the data in Table 1. Our hyper-parameters are: learning rate: 2e-5, number of steps: 435000, GPUs: 8 A100 (80GB) GPUs. Note: this is our base LM for the following 2 stages.

Distillation using Unsupervised and Supervised Pairs

We use a bi-encoder framework for training an embedding model, as in Figure 1. We initialize with the RetroMAE pre-trained model, and further employ Knowledge Distillation with <query, passage> text pairs using a contrastive loss objective with in-batch negatives. Knowledge Distillation trains the student’s output probability distribution to match that of the teacher as closely as possible. In the context of retriever models, the output distribution is the similarity scores between pairs of text. Specifically, for each pair of sentences <query, passage>, the distribution of the teacher’s scores between the embeddings of query and passage, i.e., the cosine similarity between the embeddings, is distilled into the student.

The teacher used for distillation is the "slate.125m.english.rtrvr” model trained on the same data mentioned below. The teacher is formed using model fusion between two models, each of which used RetroMAE pretraining and finetuning, but differing in the finetuning data. For more details, please refer to the model card for slate.125m.english.rtrvr. The flow of knowledge transfer is shown pictorially in Figure 2.

Diagram that shows the distillation from slate.125m.english to slate.125m.rtrvr to slate.30m.rtrvr

Figure 2. Knowledge Distillation

We mine large scale pairs from various domain, as indicated in the Training Data section. Furthermore, we also include high-quality pairs for the retrieval task on the following datasets: SQuAD, Natural Questions, Specter, Stack Exchange (Title, Body) pairs, S2ORC, SearchQA, HotpotQA and Fever. Distillation hyperparameters are: learning rate:7e-4, number of steps: 400000, effective batch size: 2048, GPUs: 2 A100_80GB GPUs.

Training Data

Table 1. Pre-Training Data
Dataset Passages
Wikipedia 36396918
Books Corpus 3401308
Stack Exchange 15999837
Table 2. Fine-Tuning Data
Dataset Pairs
SPECTER citation triplets 684100
Stack Exchange Duplicate questions (titles) 304525
AllNLI (SNLI and MultiNLI) 277230
Stack Exchange Duplicate questions (bodies) 250519
Stack Exchange Duplicate questions (titles+bodies) 250460
Natural Questions (NQ) 100231
SQuAD2.0 87599
PAQ (Question, Answer) pairs 64371441
Stack Exchange (Title, Answer) pairs 4067139
Stack Exchange (Title, Body) pairs 23978013
Stack Exchange (Title+Body, Answer) pairs 187195
S2ORC Citation pairs (Titles) 52603982
S2ORC (Title, Abstract) 41769185
S2ORC_citations_abstracts 52603982
WikiAnswers Duplicate question pairs 77427422
SearchQA 582261
HotpotQA 85000
Fever 109810
Arxiv 2358545
Wikipedia 20745403
PubMed 20000000

Usage

# Make sure the sentence transformers is installed.
pip install -U sentence-transformers 

from sentence_transformers import SentenceTransformer, util 
model = SentenceTransformer('path_to_slate_model') 

input_queries = [ 
  'Who made the son My achy breaky heart ?', 
  'summit define'] 
input_passages = [ 
  "Achy Breaky Heart is a country song written by Don Von Tress. Originally titled Don't Tell My Heart and performed by The Marcy Brothers in 1991", 
  "Definition of summit for English Language Learners. : 1 the highest point of a mountain : the top of a mountain. : 2 the highest level. : 3 a meeting or series of meetings between the leaders of two or more governments."] 

query_embeddings = model.encode(input_queries) 
passage_embeddings = model.encode(input_passages) 
print(util.cos_sim(query_embeddings, passage_embeddings))

The maximum sequence length of this model is 512 tokens.

Evaluation

Baselines

For a fair comparison, we compare with the following baselines:

  1. BM25 (a traditional model based on tf-idf).
  2. ELSER (a commercial search algorithm provided by Elastic).
  3. all-MiniLM-l6-v2: a popular open-source sentence transformers model. This model shares the same architecture as slate.125m.english.rtvr, with a smaller embedding dimension (384) and has been trained on more data without commercial-friendly licenses. See the Hugging Face model card (https://huggingface.co/sentence-transformers/all-MiniLM-L6-v2) for more details.
  4. E5-base: a recent open-source transformer model with very good performance on the BEIR benchmark. This is a base-sized model, which has the same architecture as slate.125m.english.rtvr. [Reference: Wang et.al., 2022: Text Embeddings by Weakly-Supervised Contrastive Pre-training]. Huggingface model card (https://huggingface.co/intfloat/e5-base).
  5. E5-small: a smaller model within the open source E5 family. The embedding dimension of this model matches that of all-minilm-l6-v2 (384), however it has 12 layers, and thus is larger and slightly slower. [Reference: Wang et.al., 2022: Text Embeddings by Weakly-Supervised Contrastive Pre-training]. Huggingface model card (https://huggingface.co/intfloat/e5-small).
  6. BGE-base: a recent open-source transformer model with the best performance on the BEIR benchmark for the 768 embedding size (as of 01.20.2024). Huggingface model card (https://huggingface.co/BAAI/bge-base-en-v1.5).

Our Evaluation benchmark: BEIR (MTEB’s retrieval tab)

The BEIR benchmark contains of 15 open-source retrieval tasks evaluated under a zero-shot setting. BEIR focused on Diversity, including nine different retrieval tasks: Fact checking, citation prediction, duplicate question retrieval, argument retrieval, news retrieval, question answering, tweet retrieval, bio-medical IR, and entity retrieval. Further, it includes datasets from diverse text domains, datasets that cover broad topics (like Wikipedia) and specialized topics (like COVID-19 publications), different text types (news articles vs. Tweets), datasets of various sizes (3.6k - 15M documents), and datasets with different query lengths (average query length between 3 and 192 words) and document lengths (average document length between 11 and 635 words). BEIR uses the Normalized Cumulative Discount Gain (specifically, nDCG@10) metric for evaluation.

Long NQ

Long NQ is an IBM dataset designed for evaluating the full RAG pipeline, based on a subset of the NaturalQuestions dataset. The dev set has 300 answerable questions with a corpus of 178,891 passages from 2,345 Wikipedia documents. Long NQ also provides gold Wikipedia passages that are relevant for each question. During retrieval, the task is to obtain the relevant gold passage from the corpus for every question.

Results

Performance comparison on the BEIR benchmark (MTEB retrieval tab)
Model BEIR-15 (NDCG@10)
BM25 42.02
ELSER 49.01
all-miniLM-L6-v2 41.95
ES-small 46.01
ES-base 48.75
BGE-base 53.25
slate.30m.english.rtrvr 49.37
slate.30m.english.rtrvr 46.91

Graph that shows results for Slate and other models

Figure 3. Performance comparison on the BEIR benchmark (MTEB retrieval tab)

Performance comparison on the Long NQ dataset
Model LONGNQ (NDCG@10)
all-miniLM-L6-v2 58.10
ES-small 66.87
ES-base 63.95
BGE-base 61.29
slate.30m.english.rtrvr 65.01
slate.30m.english.rtrvr 59.94

Graph that shows results for Slate and other models

Figure 4. Performance comparison on the Long NQ dataset

Runtime Performance

The performance runtime is measured on a re-ranking task with 466 queries. For each query we re-rank the top-100 passages obtained by BM25 and we report the average time over all queries. The re-ranking was performed on a A100_40GB GPU.

Table 3. Run-time performance on re-ranking
Model Time/query
all-miniLM-L6-v2 0.18 sec
E5-small 0.33 sec
E5-base 0.75 sec
BGE-base 0.75 sec
slate.125m.english.rtrvr 0.71 sec
slate.30m.english.rtrvr 0.20 sec
Generative AI search and answer
These answers are generated by a large language model in watsonx.ai based on content from the product documentation. Learn more