Feature Extraction
sentence-transformers
PyTorch
Safetensors
English
roberta
language
granite
embeddings
sparse-encoder
sparse
splade
text-embeddings-inference
Instructions to use seerware/granite-embedding-30m-sparse with libraries, inference providers, notebooks, and local apps. Follow these links to get started.
- Libraries
- sentence-transformers
How to use seerware/granite-embedding-30m-sparse with sentence-transformers:
from sentence_transformers import SentenceTransformer model = SentenceTransformer("seerware/granite-embedding-30m-sparse") sentences = [ "The weather is lovely today.", "It's so sunny outside!", "He drove to the stadium." ] embeddings = model.encode(sentences) similarities = model.similarity(embeddings, embeddings) print(similarities.shape) # [3, 3] - Notebooks
- Google Colab
- Kaggle
Duplicate from ibm-granite/granite-embedding-30m-sparse
Browse filesCo-authored-by: Ibrahim Ibrahim <ibibrahim@users.noreply.huggingface.co>
- .gitattributes +35 -0
- 1_SpladePooling/config.json +5 -0
- README.md +284 -0
- config.json +27 -0
- config_sentence_transformers.json +14 -0
- merges.txt +0 -0
- model.safetensors +3 -0
- modules.json +14 -0
- pytorch_model.bin +3 -0
- sentence_bert_config.json +4 -0
- special_tokens_map.json +1 -0
- tokenizer.json +0 -0
- tokenizer_config.json +1 -0
- vocab.json +0 -0
- zero_to_fp32.py +578 -0
.gitattributes
ADDED
|
@@ -0,0 +1,35 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
*.7z filter=lfs diff=lfs merge=lfs -text
|
| 2 |
+
*.arrow filter=lfs diff=lfs merge=lfs -text
|
| 3 |
+
*.bin filter=lfs diff=lfs merge=lfs -text
|
| 4 |
+
*.bz2 filter=lfs diff=lfs merge=lfs -text
|
| 5 |
+
*.ckpt filter=lfs diff=lfs merge=lfs -text
|
| 6 |
+
*.ftz filter=lfs diff=lfs merge=lfs -text
|
| 7 |
+
*.gz filter=lfs diff=lfs merge=lfs -text
|
| 8 |
+
*.h5 filter=lfs diff=lfs merge=lfs -text
|
| 9 |
+
*.joblib filter=lfs diff=lfs merge=lfs -text
|
| 10 |
+
*.lfs.* filter=lfs diff=lfs merge=lfs -text
|
| 11 |
+
*.mlmodel filter=lfs diff=lfs merge=lfs -text
|
| 12 |
+
*.model filter=lfs diff=lfs merge=lfs -text
|
| 13 |
+
*.msgpack filter=lfs diff=lfs merge=lfs -text
|
| 14 |
+
*.npy filter=lfs diff=lfs merge=lfs -text
|
| 15 |
+
*.npz filter=lfs diff=lfs merge=lfs -text
|
| 16 |
+
*.onnx filter=lfs diff=lfs merge=lfs -text
|
| 17 |
+
*.ot filter=lfs diff=lfs merge=lfs -text
|
| 18 |
+
*.parquet filter=lfs diff=lfs merge=lfs -text
|
| 19 |
+
*.pb filter=lfs diff=lfs merge=lfs -text
|
| 20 |
+
*.pickle filter=lfs diff=lfs merge=lfs -text
|
| 21 |
+
*.pkl filter=lfs diff=lfs merge=lfs -text
|
| 22 |
+
*.pt filter=lfs diff=lfs merge=lfs -text
|
| 23 |
+
*.pth filter=lfs diff=lfs merge=lfs -text
|
| 24 |
+
*.rar filter=lfs diff=lfs merge=lfs -text
|
| 25 |
+
*.safetensors filter=lfs diff=lfs merge=lfs -text
|
| 26 |
+
saved_model/**/* filter=lfs diff=lfs merge=lfs -text
|
| 27 |
+
*.tar.* filter=lfs diff=lfs merge=lfs -text
|
| 28 |
+
*.tar filter=lfs diff=lfs merge=lfs -text
|
| 29 |
+
*.tflite filter=lfs diff=lfs merge=lfs -text
|
| 30 |
+
*.tgz filter=lfs diff=lfs merge=lfs -text
|
| 31 |
+
*.wasm filter=lfs diff=lfs merge=lfs -text
|
| 32 |
+
*.xz filter=lfs diff=lfs merge=lfs -text
|
| 33 |
+
*.zip filter=lfs diff=lfs merge=lfs -text
|
| 34 |
+
*.zst filter=lfs diff=lfs merge=lfs -text
|
| 35 |
+
*tfevents* filter=lfs diff=lfs merge=lfs -text
|
1_SpladePooling/config.json
ADDED
|
@@ -0,0 +1,5 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"pooling_strategy": "max",
|
| 3 |
+
"activation_function": "relu",
|
| 4 |
+
"word_embedding_dimension": null
|
| 5 |
+
}
|
README.md
ADDED
|
@@ -0,0 +1,284 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
language:
|
| 3 |
+
- en
|
| 4 |
+
license: apache-2.0
|
| 5 |
+
tags:
|
| 6 |
+
- language
|
| 7 |
+
- granite
|
| 8 |
+
- embeddings
|
| 9 |
+
- sentence-transformers
|
| 10 |
+
- sparse-encoder
|
| 11 |
+
- sparse
|
| 12 |
+
- splade
|
| 13 |
+
pipeline_tag: feature-extraction
|
| 14 |
+
library_name: sentence-transformers
|
| 15 |
+
---
|
| 16 |
+
# Granite-Embedding-30m-Sparse
|
| 17 |
+
|
| 18 |
+
**Model Summary:**
|
| 19 |
+
Granite-Embedding-30m-Sparse is a 30M parameter sparse biencoder embedding model from the Granite Experimental suite that can be used to generate high quality text embeddings. This model produces variable length bag-of-word like dictionary, containing expansions of sentence tokens and their corresponding weights and is trained using a combination of open source relevance-pair datasets with permissive, enterprise-friendly license, and IBM collected and generated datasets. While maintaining competitive scores on academic benchmarks such as BEIR, this model also performs well on many enterprise use cases. This model is developed using retrieval oriented pretraining, contrastive finetuning and knowledge distillation for improved performance.
|
| 20 |
+
|
| 21 |
+
- **Developers:** Granite Embedding Team, IBM
|
| 22 |
+
- **GitHub Repository:** [ibm-granite/granite-embedding-models](https://github.com/ibm-granite/granite-embedding-models)
|
| 23 |
+
- **Paper:** [Techincal Report](https://arxiv.org/abs/2502.20204)
|
| 24 |
+
- **Release Date**: February 26th, 2025
|
| 25 |
+
- **License:** [Apache 2.0](https://www.apache.org/licenses/LICENSE-2.0)
|
| 26 |
+
|
| 27 |
+
**Supported Languages:**
|
| 28 |
+
English.
|
| 29 |
+
|
| 30 |
+
**Intended use:**
|
| 31 |
+
The model is designed to produce variable length bag-of-word like dictionary, containing expansions of sentence tokens and their corresponding weights, for a given text, which can be used for text similarity, retrieval, and search applications.
|
| 32 |
+
|
| 33 |
+
**Usage with Milvus:**
|
| 34 |
+
The model is compatible with Milvus Vector DB and is very easy to use:
|
| 35 |
+
|
| 36 |
+
First, install the pymilvus library
|
| 37 |
+
```shell
|
| 38 |
+
pip install pymilvus[model]
|
| 39 |
+
```
|
| 40 |
+
|
| 41 |
+
The model can then be used to encode pairs of text and find the similarity between their representations
|
| 42 |
+
|
| 43 |
+
```python
|
| 44 |
+
|
| 45 |
+
from pymilvus import model
|
| 46 |
+
from pymilvus import MilvusClient, DataType
|
| 47 |
+
|
| 48 |
+
client = MilvusClient("./milvus_demo.db")
|
| 49 |
+
|
| 50 |
+
client.drop_collection(collection_name="my_sparse_collection")
|
| 51 |
+
|
| 52 |
+
schema = client.create_schema(
|
| 53 |
+
auto_id=True,
|
| 54 |
+
enable_dynamic_fields=True,
|
| 55 |
+
)
|
| 56 |
+
|
| 57 |
+
schema.add_field(field_name="pk", datatype=DataType.VARCHAR, is_primary=True, max_length=100)
|
| 58 |
+
schema.add_field(field_name="id", datatype=DataType.VARCHAR, is_primary=False, max_length=100)
|
| 59 |
+
schema.add_field(field_name="embeddings", datatype=DataType.SPARSE_FLOAT_VECTOR)
|
| 60 |
+
|
| 61 |
+
index_params = client.prepare_index_params()
|
| 62 |
+
|
| 63 |
+
index_params.add_index(field_name="embeddings",
|
| 64 |
+
index_name="sparse_inverted_index",
|
| 65 |
+
index_type="SPARSE_INVERTED_INDEX",
|
| 66 |
+
metric_type="IP",
|
| 67 |
+
params={"drop_ratio_build": 0.2})
|
| 68 |
+
client.create_collection(
|
| 69 |
+
collection_name="my_sparse_collection",
|
| 70 |
+
schema=schema,
|
| 71 |
+
index_params=index_params
|
| 72 |
+
)
|
| 73 |
+
|
| 74 |
+
embeddings_model = model.sparse.SpladeEmbeddingFunction(
|
| 75 |
+
model_name="ibm-granite/granite-embedding-30m-sparse",
|
| 76 |
+
device="cpu",
|
| 77 |
+
batch_size=2,
|
| 78 |
+
k_tokens_query=50,
|
| 79 |
+
k_tokens_document=192
|
| 80 |
+
)
|
| 81 |
+
|
| 82 |
+
# Prepare documents to be ingested
|
| 83 |
+
docs = [
|
| 84 |
+
"Artificial intelligence was founded as an academic discipline in 1956.",
|
| 85 |
+
"Alan Turing was the first person to conduct substantial research in AI.",
|
| 86 |
+
"Born in Maida Vale, London, Turing was raised in southern England.",
|
| 87 |
+
]
|
| 88 |
+
|
| 89 |
+
# SpladeEmbeddingFunction.encode_documents returns sparse matrix or sparse array depending
|
| 90 |
+
# on the milvus-model version. reshape(1,-1) ensures the format is correct for ingestion.
|
| 91 |
+
doc_vector = [{"embeddings": doc_emb.reshape(1,-1), "id": f"item_{i}"} for i, doc_emb in enumerate(embeddings_model.encode_documents(docs))]
|
| 92 |
+
|
| 93 |
+
|
| 94 |
+
client.insert(
|
| 95 |
+
collection_name="my_sparse_collection",
|
| 96 |
+
data=doc_vector
|
| 97 |
+
)
|
| 98 |
+
|
| 99 |
+
# Prepare search parameters
|
| 100 |
+
search_params = {
|
| 101 |
+
"params": {"drop_ratio_search": 0.2}, # Additional optional search parameters
|
| 102 |
+
}
|
| 103 |
+
|
| 104 |
+
# Prepare the query vector
|
| 105 |
+
|
| 106 |
+
queries = [
|
| 107 |
+
"When was artificial intelligence founded",
|
| 108 |
+
"Where was Turing born?"
|
| 109 |
+
]
|
| 110 |
+
query_vector = embeddings_model.encode_documents(queries)
|
| 111 |
+
|
| 112 |
+
res = client.search(
|
| 113 |
+
collection_name="my_sparse_collection",
|
| 114 |
+
data=query_vector,
|
| 115 |
+
limit=1, #top k documents to return
|
| 116 |
+
output_fields=["id"],
|
| 117 |
+
search_params=search_params,
|
| 118 |
+
)
|
| 119 |
+
|
| 120 |
+
for r in res:
|
| 121 |
+
print(r)
|
| 122 |
+
|
| 123 |
+
```
|
| 124 |
+
|
| 125 |
+
**Usage with Sentence Transformers:**
|
| 126 |
+
|
| 127 |
+
First install the Sentence Transformers library:
|
| 128 |
+
|
| 129 |
+
```bash
|
| 130 |
+
pip install -U sentence-transformers
|
| 131 |
+
```
|
| 132 |
+
|
| 133 |
+
Then you can load this model and run inference.
|
| 134 |
+
```python
|
| 135 |
+
|
| 136 |
+
from sentence_transformers import SparseEncoder
|
| 137 |
+
|
| 138 |
+
# Download from the 🤗 Hub
|
| 139 |
+
model = SparseEncoder("ibm-granite/granite-embedding-30m-sparse")
|
| 140 |
+
|
| 141 |
+
# Run inference
|
| 142 |
+
docs = [
|
| 143 |
+
"Artificial intelligence was founded as an academic discipline in 1956.",
|
| 144 |
+
"Alan Turing was the first person to conduct substantial research in AI.",
|
| 145 |
+
"Born in Maida Vale, London, Turing was raised in southern England.",
|
| 146 |
+
]
|
| 147 |
+
docs_embeddings = model.encode_document(docs, max_active_dims=192)
|
| 148 |
+
print(docs_embeddings.shape)
|
| 149 |
+
# [3, 50265]
|
| 150 |
+
|
| 151 |
+
queries = ["When was artificial intelligence founded", "Where was Turing born?"]
|
| 152 |
+
queries_embeddings = model.encode_query(queries, max_active_dims=50)
|
| 153 |
+
print(queries_embeddings.shape)
|
| 154 |
+
# [2, 50265]
|
| 155 |
+
|
| 156 |
+
# Get the similarity scores for the embeddings
|
| 157 |
+
similarities = model.similarity(queries_embeddings, docs_embeddings)
|
| 158 |
+
print(similarities.shape)
|
| 159 |
+
# [2, 3]
|
| 160 |
+
|
| 161 |
+
for i, query in enumerate(queries):
|
| 162 |
+
best_doc_index = similarities[i].argmax().item()
|
| 163 |
+
|
| 164 |
+
print(f"Query: {query}")
|
| 165 |
+
print(f"Best doc associate: Similarity: {similarities[i][best_doc_index]:.4f}, Doc: {docs[best_doc_index]}")
|
| 166 |
+
intersection = model.intersection(queries_embeddings[i], docs_embeddings[best_doc_index])
|
| 167 |
+
decoded_intersection = model.decode(intersection, top_k=10)
|
| 168 |
+
print("Top 10 tokens influencing the similarity:")
|
| 169 |
+
for token, score in decoded_intersection:
|
| 170 |
+
print(f"Token: {token}, Score: {score:.4f}")
|
| 171 |
+
|
| 172 |
+
# Query: When was artificial intelligence founded
|
| 173 |
+
# Best doc associate: Similarity: 12.3641, Doc: Artificial intelligence was founded as an academic discipline in 1956.
|
| 174 |
+
# Top 10 tokens influencing the similarity:
|
| 175 |
+
# Token: ĠAI, Score: 2.7591
|
| 176 |
+
# Token: Ġintelligence, Score: 2.2971
|
| 177 |
+
# Token: Ġartificial, Score: 1.7654
|
| 178 |
+
# Token: Ġfounded, Score: 1.3254
|
| 179 |
+
# Token: Ġinvention, Score: 0.9808
|
| 180 |
+
# Token: Ġlearning, Score: 0.4847
|
| 181 |
+
# Token: Ġcomputer, Score: 0.4789
|
| 182 |
+
# Token: Ġrobot, Score: 0.3466
|
| 183 |
+
# Token: Ġestablishment, Score: 0.3371
|
| 184 |
+
# Token: Ġscientific, Score: 0.2804
|
| 185 |
+
# Query: Where was Turing born?
|
| 186 |
+
# Best doc associate: Similarity: 17.1359, Doc: Born in Maida Vale, London, Turing was raised in southern England.
|
| 187 |
+
# Top 10 tokens influencing the similarity:
|
| 188 |
+
# Token: uring, Score: 2.9761
|
| 189 |
+
# Token: ĠTuring, Score: 2.4544
|
| 190 |
+
# Token: Ġborn, Score: 2.4314
|
| 191 |
+
# Token: ing, Score: 1.7760
|
| 192 |
+
# Token: ure, Score: 1.7626
|
| 193 |
+
# Token: Ġcomput, Score: 1.3356
|
| 194 |
+
# Token: Ġraised, Score: 1.3285
|
| 195 |
+
# Token: able, Score: 1.1940
|
| 196 |
+
# Token: Ġphilosopher, Score: 0.4118
|
| 197 |
+
# Token: Ġmachine, Score: 0.3977
|
| 198 |
+
|
| 199 |
+
```
|
| 200 |
+
|
| 201 |
+
**Evaluation:**
|
| 202 |
+
|
| 203 |
+
Granite-Embedding-30m-Sparse is competive in performance to the naver/splade-v3-distilbert despite being half the parameter size. We also compare the sparse model with similar sized dense embedding counterpart `ibm-granite/granite-embedding-30m-english`. The performance of the models on MTEB Retrieval (i.e., BEIR) is reported below.
|
| 204 |
+
To maintain consistency with results reported by `naver/splade-v3-distilbert`, we do not include CQADupstack and MS-MARCO in the table below.
|
| 205 |
+
|
| 206 |
+
| Model | Paramters (M)| Vocab Size | BEIR Retrieval (13) |
|
| 207 |
+
|---------------------------------|:------------:|:-------------------:|:-------------------: |
|
| 208 |
+
|naver/splade-v3-distilbert |67 |30522 |50.0 |
|
| 209 |
+
|granite-embedding-30m-english |30 |50265 |50.6 |
|
| 210 |
+
|granite-embedding-30m-sparse |30 |50265 |50.8 |
|
| 211 |
+
|
| 212 |
+
|
| 213 |
+
**Model Architecture:**
|
| 214 |
+
Granite-Embedding-30m-Sparse is based on an encoder-only RoBERTa like transformer architecture, trained internally at IBM Research.
|
| 215 |
+
|
| 216 |
+
| Model | granite-embedding-30m-sparse |
|
| 217 |
+
| :--------- | :-------:|
|
| 218 |
+
| Embedding size | **384** |
|
| 219 |
+
| Number of layers | **6** |
|
| 220 |
+
| Number of attention heads | **12** |
|
| 221 |
+
| Intermediate size | **1536** |
|
| 222 |
+
| Activation Function | **GeLU** |
|
| 223 |
+
| Vocabulary Size | **50265**|
|
| 224 |
+
| Max. Sequence Length | **512** |
|
| 225 |
+
| # Parameters | **30M** |
|
| 226 |
+
|
| 227 |
+
|
| 228 |
+
**Training Data:**
|
| 229 |
+
Overall, the training data consists of four key sources: (1) unsupervised title-body paired data scraped from the web, (2) publicly available paired with permissive, enterprise-friendly license, (3) IBM-internal paired data targetting specific technical domains, and (4) IBM-generated synthetic data. The data is listed below:
|
| 230 |
+
|
| 231 |
+
| **Dataset** | **Num. Pairs** |
|
| 232 |
+
|----------------------------------------------------|:---------------:|
|
| 233 |
+
| SPECTER citation triplets | 684,100 |
|
| 234 |
+
| Stack Exchange Duplicate questions (titles) | 304,525 |
|
| 235 |
+
| Stack Exchange Duplicate questions (bodies) | 250,519 |
|
| 236 |
+
| Stack Exchange Duplicate questions (titles+bodies) | 250,460 |
|
| 237 |
+
| Natural Questions (NQ) | 100,231 |
|
| 238 |
+
| SQuAD2.0 | 87,599 |
|
| 239 |
+
| PAQ (Question, Answer) pairs | 64,371,441 |
|
| 240 |
+
| Stack Exchange (Title, Answer) pairs | 4,067,139 |
|
| 241 |
+
| Stack Exchange (Title, Body) pairs | 23,978,013 |
|
| 242 |
+
| Stack Exchange (Title+Body, Answer) pairs | 187,195 |
|
| 243 |
+
| S2ORC Citation pairs (Titles) | 52,603,982 |
|
| 244 |
+
| S2ORC (Title, Abstract) | 41,769,185 |
|
| 245 |
+
| S2ORC (Citations, abstracts) | 52,603,982 |
|
| 246 |
+
| WikiAnswers Duplicate question pairs | 77,427,422 |
|
| 247 |
+
| SearchQA | 582,261 |
|
| 248 |
+
| HotpotQA | 85,000 |
|
| 249 |
+
| Fever | 109,810 |
|
| 250 |
+
| Arxiv | 2,358,545 |
|
| 251 |
+
| Wikipedia | 20,745,403 |
|
| 252 |
+
| PubMed | 20,000,000 |
|
| 253 |
+
| Miracl En Pairs | 9,016 |
|
| 254 |
+
| DBPedia Title-Body Pairs | 4,635,922 |
|
| 255 |
+
| Synthetic: Query-Wikipedia Passage | 1,879,093 |
|
| 256 |
+
| Synthetic: Fact Verification | 9,888 |
|
| 257 |
+
| IBM Internal Triples | 40,290 |
|
| 258 |
+
| IBM Internal Title-Body Pairs | 1,524,586 |
|
| 259 |
+
|
| 260 |
+
Notably, we do not use the popular MS-MARCO retrieval dataset in our training corpus due to its non-commercial license.
|
| 261 |
+
|
| 262 |
+
**Infrastructure:**
|
| 263 |
+
We train Granite Embedding Models using IBM's computing cluster, Cognitive Compute Cluster, which is outfitted with NVIDIA A100 80gb GPUs. This cluster provides a scalable and efficient infrastructure for training our models over multiple GPUs.
|
| 264 |
+
|
| 265 |
+
**Ethical Considerations and Limitations:**
|
| 266 |
+
The data used to train the base language model was filtered to remove text containing hate, abuse, and profanity. Granite-Embedding-30m-Sparse is trained only for English texts, and has a context length of 512 tokens (longer texts will be truncated to this size).
|
| 267 |
+
|
| 268 |
+
**Resources**
|
| 269 |
+
- ⭐️ Learn about the latest updates with Granite: https://www.ibm.com/granite
|
| 270 |
+
- 📄 Get started with tutorials, best practices, and prompt engineering advice: https://www.ibm.com/granite/docs/
|
| 271 |
+
- 💡 Learn about the latest Granite learning resources: https://ibm.biz/granite-learning-resources
|
| 272 |
+
|
| 273 |
+
## Citation
|
| 274 |
+
```
|
| 275 |
+
@misc{awasthy2025graniteembeddingmodels,
|
| 276 |
+
title={Granite Embedding Models},
|
| 277 |
+
author={Parul Awasthy and Aashka Trivedi and Yulong Li and Mihaela Bornea and David Cox and Abraham Daniels and Martin Franz and Gabe Goodhart and Bhavani Iyer and Vishwajeet Kumar and Luis Lastras and Scott McCarley and Rudra Murthy and Vignesh P and Sara Rosenthal and Salim Roukos and Jaydeep Sen and Sukriti Sharma and Avirup Sil and Kate Soule and Arafat Sultan and Radu Florian},
|
| 278 |
+
year={2025},
|
| 279 |
+
eprint={2502.20204},
|
| 280 |
+
archivePrefix={arXiv},
|
| 281 |
+
primaryClass={cs.IR},
|
| 282 |
+
url={https://arxiv.org/abs/2502.20204},
|
| 283 |
+
}
|
| 284 |
+
```
|
config.json
ADDED
|
@@ -0,0 +1,27 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"_name_or_path": "granite-embedding-30m-sparse",
|
| 3 |
+
"architectures": [
|
| 4 |
+
"RobertaForMaskedLM"
|
| 5 |
+
],
|
| 6 |
+
"attention_probs_dropout_prob": 0.1,
|
| 7 |
+
"bos_token_id": 0,
|
| 8 |
+
"classifier_dropout": null,
|
| 9 |
+
"eos_token_id": 2,
|
| 10 |
+
"hidden_act": "gelu",
|
| 11 |
+
"hidden_dropout_prob": 0.1,
|
| 12 |
+
"hidden_size": 384,
|
| 13 |
+
"initializer_range": 0.02,
|
| 14 |
+
"intermediate_size": 1536,
|
| 15 |
+
"layer_norm_eps": 1e-12,
|
| 16 |
+
"max_position_embeddings": 514,
|
| 17 |
+
"model_type": "roberta",
|
| 18 |
+
"num_attention_heads": 12,
|
| 19 |
+
"num_hidden_layers": 6,
|
| 20 |
+
"pad_token_id": 1,
|
| 21 |
+
"position_embedding_type": "absolute",
|
| 22 |
+
"torch_dtype": "bfloat16",
|
| 23 |
+
"transformers_version": "4.48.2",
|
| 24 |
+
"type_vocab_size": 2,
|
| 25 |
+
"use_cache": true,
|
| 26 |
+
"vocab_size": 50265
|
| 27 |
+
}
|
config_sentence_transformers.json
ADDED
|
@@ -0,0 +1,14 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"model_type": "SparseEncoder",
|
| 3 |
+
"__version__": {
|
| 4 |
+
"sentence_transformers": "5.0.0",
|
| 5 |
+
"transformers": "4.50.3",
|
| 6 |
+
"pytorch": "2.6.0+cu124"
|
| 7 |
+
},
|
| 8 |
+
"prompts": {
|
| 9 |
+
"query": "",
|
| 10 |
+
"document": ""
|
| 11 |
+
},
|
| 12 |
+
"default_prompt_name": null,
|
| 13 |
+
"similarity_fn_name": "dot"
|
| 14 |
+
}
|
merges.txt
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
model.safetensors
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:08632803138e24c4ba36ca59e76a78a8cc1a21f29257c5fd87461a3d912e1a66
|
| 3 |
+
size 60705154
|
modules.json
ADDED
|
@@ -0,0 +1,14 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
[
|
| 2 |
+
{
|
| 3 |
+
"idx": 0,
|
| 4 |
+
"name": "0",
|
| 5 |
+
"path": "",
|
| 6 |
+
"type": "sentence_transformers.sparse_encoder.models.MLMTransformer"
|
| 7 |
+
},
|
| 8 |
+
{
|
| 9 |
+
"idx": 1,
|
| 10 |
+
"name": "1",
|
| 11 |
+
"path": "1_SpladePooling",
|
| 12 |
+
"type": "sentence_transformers.sparse_encoder.models.SpladePooling"
|
| 13 |
+
}
|
| 14 |
+
]
|
pytorch_model.bin
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:414e5f24f6a14f6c336c9ca2174c3a9dfb8a803b29ed5fc22cbbdeb696c5c2cf
|
| 3 |
+
size 310011134
|
sentence_bert_config.json
ADDED
|
@@ -0,0 +1,4 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"max_seq_length": 512,
|
| 3 |
+
"do_lower_case": false
|
| 4 |
+
}
|
special_tokens_map.json
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
{"bos_token": "<s>", "eos_token": "</s>", "unk_token": "<unk>", "sep_token": "</s>", "pad_token": "<pad>", "cls_token": "<s>", "mask_token": {"content": "<mask>", "single_word": false, "lstrip": true, "rstrip": false, "normalized": false}}
|
tokenizer.json
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
tokenizer_config.json
ADDED
|
@@ -0,0 +1 @@
|
|
|
|
|
|
|
| 1 |
+
{"unk_token": "<unk>", "bos_token": "<s>", "eos_token": "</s>", "add_prefix_space": false, "errors": "replace", "sep_token": "</s>", "cls_token": "<s>", "pad_token": "<pad>", "mask_token": "<mask>", "trim_offsets": true, "added_tokens_decoder": {"0": {"content": "<s>", "lstrip": false, "normalized": true, "rstrip": false, "single_word": false, "special": true}, "1": {"content": "<pad>", "lstrip": false, "normalized": true, "rstrip": false, "single_word": false, "special": true}, "2": {"content": "</s>", "lstrip": false, "normalized": true, "rstrip": false, "single_word": false, "special": true}, "3": {"content": "<unk>", "lstrip": false, "normalized": true, "rstrip": false, "single_word": false, "special": true}, "50264": {"content": "<mask>", "lstrip": true, "normalized": true, "rstrip": false, "single_word": false, "special": true}}, "additional_special_tokens": [], "clean_up_tokenization_spaces": true, "model_max_length": 512, "special_tokens_map_file": "/dccstor/retrieve-rerank2/models/slate.30m.english.retromae.kd/special_tokens_map.json", "name_or_path": "/dccstor/retrieve-rerank2/models/slate.30m.english.retromae.kd", "tokenizer_class": "RobertaTokenizer"}
|
vocab.json
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
zero_to_fp32.py
ADDED
|
@@ -0,0 +1,578 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
#!/usr/bin/env python
|
| 2 |
+
|
| 3 |
+
# Copyright (c) Microsoft Corporation.
|
| 4 |
+
# SPDX-License-Identifier: Apache-2.0
|
| 5 |
+
|
| 6 |
+
# DeepSpeed Team
|
| 7 |
+
|
| 8 |
+
# This script extracts fp32 consolidated weights from a zero 1, 2 and 3 DeepSpeed checkpoints. It gets
|
| 9 |
+
# copied into the top level checkpoint dir, so the user can easily do the conversion at any point in
|
| 10 |
+
# the future. Once extracted, the weights don't require DeepSpeed and can be used in any
|
| 11 |
+
# application.
|
| 12 |
+
#
|
| 13 |
+
# example: python zero_to_fp32.py . pytorch_model.bin
|
| 14 |
+
|
| 15 |
+
import argparse
|
| 16 |
+
import torch
|
| 17 |
+
import glob
|
| 18 |
+
import math
|
| 19 |
+
import os
|
| 20 |
+
import re
|
| 21 |
+
from collections import OrderedDict
|
| 22 |
+
from dataclasses import dataclass
|
| 23 |
+
|
| 24 |
+
# while this script doesn't use deepspeed to recover data, since the checkpoints are pickled with
|
| 25 |
+
# DeepSpeed data structures it has to be available in the current python environment.
|
| 26 |
+
from deepspeed.utils import logger
|
| 27 |
+
from deepspeed.checkpoint.constants import (DS_VERSION, OPTIMIZER_STATE_DICT, SINGLE_PARTITION_OF_FP32_GROUPS,
|
| 28 |
+
FP32_FLAT_GROUPS, ZERO_STAGE, PARTITION_COUNT, PARAM_SHAPES, BUFFER_NAMES,
|
| 29 |
+
FROZEN_PARAM_SHAPES, FROZEN_PARAM_FRAGMENTS)
|
| 30 |
+
|
| 31 |
+
|
| 32 |
+
@dataclass
|
| 33 |
+
class zero_model_state:
|
| 34 |
+
buffers: dict()
|
| 35 |
+
param_shapes: dict()
|
| 36 |
+
shared_params: list
|
| 37 |
+
ds_version: int
|
| 38 |
+
frozen_param_shapes: dict()
|
| 39 |
+
frozen_param_fragments: dict()
|
| 40 |
+
|
| 41 |
+
|
| 42 |
+
debug = 0
|
| 43 |
+
|
| 44 |
+
# load to cpu
|
| 45 |
+
device = torch.device('cpu')
|
| 46 |
+
|
| 47 |
+
|
| 48 |
+
def atoi(text):
|
| 49 |
+
return int(text) if text.isdigit() else text
|
| 50 |
+
|
| 51 |
+
|
| 52 |
+
def natural_keys(text):
|
| 53 |
+
'''
|
| 54 |
+
alist.sort(key=natural_keys) sorts in human order
|
| 55 |
+
http://nedbatchelder.com/blog/200712/human_sorting.html
|
| 56 |
+
(See Toothy's implementation in the comments)
|
| 57 |
+
'''
|
| 58 |
+
return [atoi(c) for c in re.split(r'(\d+)', text)]
|
| 59 |
+
|
| 60 |
+
|
| 61 |
+
def get_model_state_file(checkpoint_dir, zero_stage):
|
| 62 |
+
if not os.path.isdir(checkpoint_dir):
|
| 63 |
+
raise FileNotFoundError(f"Directory '{checkpoint_dir}' doesn't exist")
|
| 64 |
+
|
| 65 |
+
# there should be only one file
|
| 66 |
+
if zero_stage <= 2:
|
| 67 |
+
file = os.path.join(checkpoint_dir, "mp_rank_00_model_states.pt")
|
| 68 |
+
elif zero_stage == 3:
|
| 69 |
+
file = os.path.join(checkpoint_dir, "zero_pp_rank_0_mp_rank_00_model_states.pt")
|
| 70 |
+
|
| 71 |
+
if not os.path.exists(file):
|
| 72 |
+
raise FileNotFoundError(f"can't find model states file at '{file}'")
|
| 73 |
+
|
| 74 |
+
return file
|
| 75 |
+
|
| 76 |
+
|
| 77 |
+
def get_checkpoint_files(checkpoint_dir, glob_pattern):
|
| 78 |
+
# XXX: need to test that this simple glob rule works for multi-node setup too
|
| 79 |
+
ckpt_files = sorted(glob.glob(os.path.join(checkpoint_dir, glob_pattern)), key=natural_keys)
|
| 80 |
+
|
| 81 |
+
if len(ckpt_files) == 0:
|
| 82 |
+
raise FileNotFoundError(f"can't find {glob_pattern} files in directory '{checkpoint_dir}'")
|
| 83 |
+
|
| 84 |
+
return ckpt_files
|
| 85 |
+
|
| 86 |
+
|
| 87 |
+
def get_optim_files(checkpoint_dir):
|
| 88 |
+
return get_checkpoint_files(checkpoint_dir, "*_optim_states.pt")
|
| 89 |
+
|
| 90 |
+
|
| 91 |
+
def get_model_state_files(checkpoint_dir):
|
| 92 |
+
return get_checkpoint_files(checkpoint_dir, "*_model_states.pt")
|
| 93 |
+
|
| 94 |
+
|
| 95 |
+
def parse_model_states(files):
|
| 96 |
+
zero_model_states = []
|
| 97 |
+
for file in files:
|
| 98 |
+
state_dict = torch.load(file, map_location=device)
|
| 99 |
+
|
| 100 |
+
if BUFFER_NAMES not in state_dict:
|
| 101 |
+
raise ValueError(f"{file} is not a model state checkpoint")
|
| 102 |
+
buffer_names = state_dict[BUFFER_NAMES]
|
| 103 |
+
if debug:
|
| 104 |
+
print("Found buffers:", buffer_names)
|
| 105 |
+
|
| 106 |
+
# recover just the buffers while restoring them to fp32 if they were saved in fp16
|
| 107 |
+
buffers = {k: v.float() for k, v in state_dict["module"].items() if k in buffer_names}
|
| 108 |
+
param_shapes = state_dict[PARAM_SHAPES]
|
| 109 |
+
|
| 110 |
+
# collect parameters that are included in param_shapes
|
| 111 |
+
param_names = []
|
| 112 |
+
for s in param_shapes:
|
| 113 |
+
for name in s.keys():
|
| 114 |
+
param_names.append(name)
|
| 115 |
+
|
| 116 |
+
# update with frozen parameters
|
| 117 |
+
frozen_param_shapes = state_dict.get(FROZEN_PARAM_SHAPES, None)
|
| 118 |
+
if frozen_param_shapes is not None:
|
| 119 |
+
if debug:
|
| 120 |
+
print(f"Found frozen_param_shapes: {frozen_param_shapes}")
|
| 121 |
+
param_names += list(frozen_param_shapes.keys())
|
| 122 |
+
|
| 123 |
+
# handle shared params
|
| 124 |
+
shared_params = [[k, v] for k, v in state_dict["shared_params"].items()]
|
| 125 |
+
|
| 126 |
+
ds_version = state_dict.get(DS_VERSION, None)
|
| 127 |
+
|
| 128 |
+
frozen_param_fragments = state_dict.get(FROZEN_PARAM_FRAGMENTS, None)
|
| 129 |
+
|
| 130 |
+
z_model_state = zero_model_state(buffers=buffers,
|
| 131 |
+
param_shapes=param_shapes,
|
| 132 |
+
shared_params=shared_params,
|
| 133 |
+
ds_version=ds_version,
|
| 134 |
+
frozen_param_shapes=frozen_param_shapes,
|
| 135 |
+
frozen_param_fragments=frozen_param_fragments)
|
| 136 |
+
zero_model_states.append(z_model_state)
|
| 137 |
+
|
| 138 |
+
return zero_model_states
|
| 139 |
+
|
| 140 |
+
|
| 141 |
+
def parse_optim_states(files, ds_checkpoint_dir):
|
| 142 |
+
|
| 143 |
+
total_files = len(files)
|
| 144 |
+
state_dicts = []
|
| 145 |
+
for f in files:
|
| 146 |
+
state_dicts.append(torch.load(f, map_location=device))
|
| 147 |
+
|
| 148 |
+
if not ZERO_STAGE in state_dicts[0][OPTIMIZER_STATE_DICT]:
|
| 149 |
+
raise ValueError(f"{files[0]} is not a zero checkpoint")
|
| 150 |
+
zero_stage = state_dicts[0][OPTIMIZER_STATE_DICT][ZERO_STAGE]
|
| 151 |
+
world_size = state_dicts[0][OPTIMIZER_STATE_DICT][PARTITION_COUNT]
|
| 152 |
+
|
| 153 |
+
# For ZeRO-2 each param group can have different partition_count as data parallelism for expert
|
| 154 |
+
# parameters can be different from data parallelism for non-expert parameters. So we can just
|
| 155 |
+
# use the max of the partition_count to get the dp world_size.
|
| 156 |
+
|
| 157 |
+
if type(world_size) is list:
|
| 158 |
+
world_size = max(world_size)
|
| 159 |
+
|
| 160 |
+
if world_size != total_files:
|
| 161 |
+
raise ValueError(
|
| 162 |
+
f"Expected {world_size} of '*_optim_states.pt' under '{ds_checkpoint_dir}' but found {total_files} files. "
|
| 163 |
+
"Possibly due to an overwrite of an old checkpoint, or a checkpoint didn't get saved by one or more processes."
|
| 164 |
+
)
|
| 165 |
+
|
| 166 |
+
# the groups are named differently in each stage
|
| 167 |
+
if zero_stage <= 2:
|
| 168 |
+
fp32_groups_key = SINGLE_PARTITION_OF_FP32_GROUPS
|
| 169 |
+
elif zero_stage == 3:
|
| 170 |
+
fp32_groups_key = FP32_FLAT_GROUPS
|
| 171 |
+
else:
|
| 172 |
+
raise ValueError(f"unknown zero stage {zero_stage}")
|
| 173 |
+
|
| 174 |
+
if zero_stage <= 2:
|
| 175 |
+
fp32_flat_groups = [state_dicts[i][OPTIMIZER_STATE_DICT][fp32_groups_key] for i in range(len(state_dicts))]
|
| 176 |
+
elif zero_stage == 3:
|
| 177 |
+
# if there is more than one param group, there will be multiple flattened tensors - one
|
| 178 |
+
# flattened tensor per group - for simplicity merge them into a single tensor
|
| 179 |
+
#
|
| 180 |
+
# XXX: could make the script more memory efficient for when there are multiple groups - it
|
| 181 |
+
# will require matching the sub-lists of param_shapes for each param group flattened tensor
|
| 182 |
+
|
| 183 |
+
fp32_flat_groups = [
|
| 184 |
+
torch.cat(state_dicts[i][OPTIMIZER_STATE_DICT][fp32_groups_key], 0) for i in range(len(state_dicts))
|
| 185 |
+
]
|
| 186 |
+
|
| 187 |
+
return zero_stage, world_size, fp32_flat_groups
|
| 188 |
+
|
| 189 |
+
|
| 190 |
+
def _get_fp32_state_dict_from_zero_checkpoint(ds_checkpoint_dir):
|
| 191 |
+
"""
|
| 192 |
+
Returns fp32 state_dict reconstructed from ds checkpoint
|
| 193 |
+
|
| 194 |
+
Args:
|
| 195 |
+
- ``ds_checkpoint_dir``: path to the deepspeed checkpoint folder (where the optimizer files are)
|
| 196 |
+
|
| 197 |
+
"""
|
| 198 |
+
print(f"Processing zero checkpoint '{ds_checkpoint_dir}'")
|
| 199 |
+
|
| 200 |
+
optim_files = get_optim_files(ds_checkpoint_dir)
|
| 201 |
+
zero_stage, world_size, fp32_flat_groups = parse_optim_states(optim_files, ds_checkpoint_dir)
|
| 202 |
+
print(f"Detected checkpoint of type zero stage {zero_stage}, world_size: {world_size}")
|
| 203 |
+
|
| 204 |
+
model_files = get_model_state_files(ds_checkpoint_dir)
|
| 205 |
+
|
| 206 |
+
zero_model_states = parse_model_states(model_files)
|
| 207 |
+
print(f'Parsing checkpoint created by deepspeed=={zero_model_states[0].ds_version}')
|
| 208 |
+
|
| 209 |
+
if zero_stage <= 2:
|
| 210 |
+
return _get_fp32_state_dict_from_zero2_checkpoint(world_size, fp32_flat_groups, zero_model_states)
|
| 211 |
+
elif zero_stage == 3:
|
| 212 |
+
return _get_fp32_state_dict_from_zero3_checkpoint(world_size, fp32_flat_groups, zero_model_states)
|
| 213 |
+
|
| 214 |
+
|
| 215 |
+
def _zero2_merge_frozen_params(state_dict, zero_model_states):
|
| 216 |
+
if zero_model_states[0].frozen_param_shapes is None or len(zero_model_states[0].frozen_param_shapes) == 0:
|
| 217 |
+
return
|
| 218 |
+
|
| 219 |
+
frozen_param_shapes = zero_model_states[0].frozen_param_shapes
|
| 220 |
+
frozen_param_fragments = zero_model_states[0].frozen_param_fragments
|
| 221 |
+
|
| 222 |
+
if debug:
|
| 223 |
+
num_elem = sum(s.numel() for s in frozen_param_shapes.values())
|
| 224 |
+
print(f'rank 0: {FROZEN_PARAM_SHAPES}.numel = {num_elem}')
|
| 225 |
+
|
| 226 |
+
wanted_params = len(frozen_param_shapes)
|
| 227 |
+
wanted_numel = sum(s.numel() for s in frozen_param_shapes.values())
|
| 228 |
+
avail_numel = sum([p.numel() for p in frozen_param_fragments.values()])
|
| 229 |
+
print(f'Frozen params: Have {avail_numel} numels to process.')
|
| 230 |
+
print(f'Frozen params: Need {wanted_numel} numels in {wanted_params} params')
|
| 231 |
+
|
| 232 |
+
total_params = 0
|
| 233 |
+
total_numel = 0
|
| 234 |
+
for name, shape in frozen_param_shapes.items():
|
| 235 |
+
total_params += 1
|
| 236 |
+
unpartitioned_numel = shape.numel()
|
| 237 |
+
total_numel += unpartitioned_numel
|
| 238 |
+
|
| 239 |
+
state_dict[name] = frozen_param_fragments[name]
|
| 240 |
+
|
| 241 |
+
if debug:
|
| 242 |
+
print(f"{name} full shape: {shape} unpartitioned numel {unpartitioned_numel} ")
|
| 243 |
+
|
| 244 |
+
print(f"Reconstructed Frozen fp32 state dict with {total_params} params {total_numel} elements")
|
| 245 |
+
|
| 246 |
+
|
| 247 |
+
def _zero2_merge_trainable_params(state_dict, world_size, fp32_flat_groups, zero_model_states):
|
| 248 |
+
param_shapes = zero_model_states[0].param_shapes
|
| 249 |
+
|
| 250 |
+
# Reconstruction protocol:
|
| 251 |
+
#
|
| 252 |
+
# XXX: document this
|
| 253 |
+
|
| 254 |
+
if debug:
|
| 255 |
+
for i in range(world_size):
|
| 256 |
+
for j in range(len(fp32_flat_groups[0])):
|
| 257 |
+
print(f"{FP32_FLAT_GROUPS}[{i}][{j}].shape={fp32_flat_groups[i][j].shape}")
|
| 258 |
+
|
| 259 |
+
# XXX: memory usage doubles here (zero2)
|
| 260 |
+
num_param_groups = len(fp32_flat_groups[0])
|
| 261 |
+
merged_single_partition_of_fp32_groups = []
|
| 262 |
+
for i in range(num_param_groups):
|
| 263 |
+
merged_partitions = [sd[i] for sd in fp32_flat_groups]
|
| 264 |
+
full_single_fp32_vector = torch.cat(merged_partitions, 0)
|
| 265 |
+
merged_single_partition_of_fp32_groups.append(full_single_fp32_vector)
|
| 266 |
+
avail_numel = sum(
|
| 267 |
+
[full_single_fp32_vector.numel() for full_single_fp32_vector in merged_single_partition_of_fp32_groups])
|
| 268 |
+
|
| 269 |
+
if debug:
|
| 270 |
+
wanted_params = sum([len(shapes) for shapes in param_shapes])
|
| 271 |
+
wanted_numel = sum([sum(shape.numel() for shape in shapes.values()) for shapes in param_shapes])
|
| 272 |
+
# not asserting if there is a mismatch due to possible padding
|
| 273 |
+
print(f"Have {avail_numel} numels to process.")
|
| 274 |
+
print(f"Need {wanted_numel} numels in {wanted_params} params.")
|
| 275 |
+
|
| 276 |
+
# params
|
| 277 |
+
# XXX: for huge models that can't fit into the host's RAM we will have to recode this to support
|
| 278 |
+
# out-of-core computing solution
|
| 279 |
+
total_numel = 0
|
| 280 |
+
total_params = 0
|
| 281 |
+
for shapes, full_single_fp32_vector in zip(param_shapes, merged_single_partition_of_fp32_groups):
|
| 282 |
+
offset = 0
|
| 283 |
+
avail_numel = full_single_fp32_vector.numel()
|
| 284 |
+
for name, shape in shapes.items():
|
| 285 |
+
|
| 286 |
+
unpartitioned_numel = shape.numel()
|
| 287 |
+
total_numel += unpartitioned_numel
|
| 288 |
+
total_params += 1
|
| 289 |
+
|
| 290 |
+
if debug:
|
| 291 |
+
print(f"{name} full shape: {shape} unpartitioned numel {unpartitioned_numel} ")
|
| 292 |
+
state_dict[name] = full_single_fp32_vector.narrow(0, offset, unpartitioned_numel).view(shape)
|
| 293 |
+
offset += unpartitioned_numel
|
| 294 |
+
|
| 295 |
+
# Z2 started to align to 2*world_size to improve nccl performance. Therefore both offset and
|
| 296 |
+
# avail_numel can differ by anywhere between 0..2*world_size. Due to two unrelated complex
|
| 297 |
+
# paddings performed in the code it's almost impossible to predict the exact numbers w/o the
|
| 298 |
+
# live optimizer object, so we are checking that the numbers are within the right range
|
| 299 |
+
align_to = 2 * world_size
|
| 300 |
+
|
| 301 |
+
def zero2_align(x):
|
| 302 |
+
return align_to * math.ceil(x / align_to)
|
| 303 |
+
|
| 304 |
+
if debug:
|
| 305 |
+
print(f"original offset={offset}, avail_numel={avail_numel}")
|
| 306 |
+
|
| 307 |
+
offset = zero2_align(offset)
|
| 308 |
+
avail_numel = zero2_align(avail_numel)
|
| 309 |
+
|
| 310 |
+
if debug:
|
| 311 |
+
print(f"aligned offset={offset}, avail_numel={avail_numel}")
|
| 312 |
+
|
| 313 |
+
# Sanity check
|
| 314 |
+
if offset != avail_numel:
|
| 315 |
+
raise ValueError(f"consumed {offset} numels out of {avail_numel} - something is wrong")
|
| 316 |
+
|
| 317 |
+
print(f"Reconstructed fp32 state dict with {total_params} params {total_numel} elements")
|
| 318 |
+
|
| 319 |
+
|
| 320 |
+
def _get_fp32_state_dict_from_zero2_checkpoint(world_size, fp32_flat_groups, zero_model_states):
|
| 321 |
+
state_dict = OrderedDict()
|
| 322 |
+
|
| 323 |
+
# buffers
|
| 324 |
+
buffers = zero_model_states[0].buffers
|
| 325 |
+
state_dict.update(buffers)
|
| 326 |
+
if debug:
|
| 327 |
+
print(f"added {len(buffers)} buffers")
|
| 328 |
+
|
| 329 |
+
_zero2_merge_frozen_params(state_dict, zero_model_states)
|
| 330 |
+
|
| 331 |
+
_zero2_merge_trainable_params(state_dict, world_size, fp32_flat_groups, zero_model_states)
|
| 332 |
+
|
| 333 |
+
# recover shared parameters
|
| 334 |
+
for pair in zero_model_states[0].shared_params:
|
| 335 |
+
if pair[1] in state_dict:
|
| 336 |
+
state_dict[pair[0]] = state_dict[pair[1]]
|
| 337 |
+
|
| 338 |
+
return state_dict
|
| 339 |
+
|
| 340 |
+
|
| 341 |
+
def zero3_partitioned_param_info(unpartitioned_numel, world_size):
|
| 342 |
+
remainder = unpartitioned_numel % world_size
|
| 343 |
+
padding_numel = (world_size - remainder) if remainder else 0
|
| 344 |
+
partitioned_numel = math.ceil(unpartitioned_numel / world_size)
|
| 345 |
+
return partitioned_numel, padding_numel
|
| 346 |
+
|
| 347 |
+
|
| 348 |
+
def _zero3_merge_frozen_params(state_dict, world_size, zero_model_states):
|
| 349 |
+
if zero_model_states[0].frozen_param_shapes is None or len(zero_model_states[0].frozen_param_shapes) == 0:
|
| 350 |
+
return
|
| 351 |
+
|
| 352 |
+
if debug:
|
| 353 |
+
for i in range(world_size):
|
| 354 |
+
num_elem = sum(s.numel() for s in zero_model_states[i].frozen_param_fragments.values())
|
| 355 |
+
print(f'rank {i}: {FROZEN_PARAM_SHAPES}.numel = {num_elem}')
|
| 356 |
+
|
| 357 |
+
frozen_param_shapes = zero_model_states[0].frozen_param_shapes
|
| 358 |
+
wanted_params = len(frozen_param_shapes)
|
| 359 |
+
wanted_numel = sum(s.numel() for s in frozen_param_shapes.values())
|
| 360 |
+
avail_numel = sum([p.numel() for p in zero_model_states[0].frozen_param_fragments.values()]) * world_size
|
| 361 |
+
print(f'Frozen params: Have {avail_numel} numels to process.')
|
| 362 |
+
print(f'Frozen params: Need {wanted_numel} numels in {wanted_params} params')
|
| 363 |
+
|
| 364 |
+
total_params = 0
|
| 365 |
+
total_numel = 0
|
| 366 |
+
for name, shape in zero_model_states[0].frozen_param_shapes.items():
|
| 367 |
+
total_params += 1
|
| 368 |
+
unpartitioned_numel = shape.numel()
|
| 369 |
+
total_numel += unpartitioned_numel
|
| 370 |
+
|
| 371 |
+
param_frags = tuple(model_state.frozen_param_fragments[name] for model_state in zero_model_states)
|
| 372 |
+
state_dict[name] = torch.cat(param_frags, 0).narrow(0, 0, unpartitioned_numel).view(shape)
|
| 373 |
+
|
| 374 |
+
partitioned_numel, partitioned_padding_numel = zero3_partitioned_param_info(unpartitioned_numel, world_size)
|
| 375 |
+
|
| 376 |
+
if debug:
|
| 377 |
+
print(
|
| 378 |
+
f"Frozen params: {total_params} {name} full shape: {shape} partition0 numel={partitioned_numel} partitioned_padding_numel={partitioned_padding_numel}"
|
| 379 |
+
)
|
| 380 |
+
|
| 381 |
+
print(f"Reconstructed Frozen fp32 state dict with {total_params} params {total_numel} elements")
|
| 382 |
+
|
| 383 |
+
|
| 384 |
+
def _zero3_merge_trainable_params(state_dict, world_size, fp32_flat_groups, zero_model_states):
|
| 385 |
+
param_shapes = zero_model_states[0].param_shapes
|
| 386 |
+
avail_numel = fp32_flat_groups[0].numel() * world_size
|
| 387 |
+
# Reconstruction protocol: For zero3 we need to zip the partitions together at boundary of each
|
| 388 |
+
# param, re-consolidating each param, while dealing with padding if any
|
| 389 |
+
|
| 390 |
+
# merge list of dicts, preserving order
|
| 391 |
+
param_shapes = {k: v for d in param_shapes for k, v in d.items()}
|
| 392 |
+
|
| 393 |
+
if debug:
|
| 394 |
+
for i in range(world_size):
|
| 395 |
+
print(f"{FP32_FLAT_GROUPS}[{i}].shape={fp32_flat_groups[i].shape}")
|
| 396 |
+
|
| 397 |
+
wanted_params = len(param_shapes)
|
| 398 |
+
wanted_numel = sum(shape.numel() for shape in param_shapes.values())
|
| 399 |
+
# not asserting if there is a mismatch due to possible padding
|
| 400 |
+
avail_numel = fp32_flat_groups[0].numel() * world_size
|
| 401 |
+
print(f"Trainable params: Have {avail_numel} numels to process.")
|
| 402 |
+
print(f"Trainable params: Need {wanted_numel} numels in {wanted_params} params.")
|
| 403 |
+
|
| 404 |
+
# params
|
| 405 |
+
# XXX: for huge models that can't fit into the host's RAM we will have to recode this to support
|
| 406 |
+
# out-of-core computing solution
|
| 407 |
+
offset = 0
|
| 408 |
+
total_numel = 0
|
| 409 |
+
total_params = 0
|
| 410 |
+
for name, shape in param_shapes.items():
|
| 411 |
+
|
| 412 |
+
unpartitioned_numel = shape.numel()
|
| 413 |
+
total_numel += unpartitioned_numel
|
| 414 |
+
total_params += 1
|
| 415 |
+
|
| 416 |
+
partitioned_numel, partitioned_padding_numel = zero3_partitioned_param_info(unpartitioned_numel, world_size)
|
| 417 |
+
|
| 418 |
+
if debug:
|
| 419 |
+
print(
|
| 420 |
+
f"Trainable params: {total_params} {name} full shape: {shape} partition0 numel={partitioned_numel} partitioned_padding_numel={partitioned_padding_numel}"
|
| 421 |
+
)
|
| 422 |
+
|
| 423 |
+
# XXX: memory usage doubles here
|
| 424 |
+
state_dict[name] = torch.cat(
|
| 425 |
+
tuple(fp32_flat_groups[i].narrow(0, offset, partitioned_numel) for i in range(world_size)),
|
| 426 |
+
0).narrow(0, 0, unpartitioned_numel).view(shape)
|
| 427 |
+
offset += partitioned_numel
|
| 428 |
+
|
| 429 |
+
offset *= world_size
|
| 430 |
+
|
| 431 |
+
# Sanity check
|
| 432 |
+
if offset != avail_numel:
|
| 433 |
+
raise ValueError(f"consumed {offset} numels out of {avail_numel} - something is wrong")
|
| 434 |
+
|
| 435 |
+
print(f"Reconstructed Trainable fp32 state dict with {total_params} params {total_numel} elements")
|
| 436 |
+
|
| 437 |
+
|
| 438 |
+
def _get_fp32_state_dict_from_zero3_checkpoint(world_size, fp32_flat_groups, zero_model_states):
|
| 439 |
+
state_dict = OrderedDict()
|
| 440 |
+
|
| 441 |
+
# buffers
|
| 442 |
+
buffers = zero_model_states[0].buffers
|
| 443 |
+
state_dict.update(buffers)
|
| 444 |
+
if debug:
|
| 445 |
+
print(f"added {len(buffers)} buffers")
|
| 446 |
+
|
| 447 |
+
_zero3_merge_frozen_params(state_dict, world_size, zero_model_states)
|
| 448 |
+
|
| 449 |
+
_zero3_merge_trainable_params(state_dict, world_size, fp32_flat_groups, zero_model_states)
|
| 450 |
+
|
| 451 |
+
# recover shared parameters
|
| 452 |
+
for pair in zero_model_states[0].shared_params:
|
| 453 |
+
if pair[1] in state_dict:
|
| 454 |
+
state_dict[pair[0]] = state_dict[pair[1]]
|
| 455 |
+
|
| 456 |
+
return state_dict
|
| 457 |
+
|
| 458 |
+
|
| 459 |
+
def get_fp32_state_dict_from_zero_checkpoint(checkpoint_dir, tag=None):
|
| 460 |
+
"""
|
| 461 |
+
Convert ZeRO 2 or 3 checkpoint into a single fp32 consolidated state_dict that can be loaded with
|
| 462 |
+
``load_state_dict()`` and used for training without DeepSpeed or shared with others, for example
|
| 463 |
+
via a model hub.
|
| 464 |
+
|
| 465 |
+
Args:
|
| 466 |
+
- ``checkpoint_dir``: path to the desired checkpoint folder
|
| 467 |
+
- ``tag``: checkpoint tag used as a unique identifier for checkpoint. If not provided will attempt to load tag in 'latest' file. e.g., ``global_step14``
|
| 468 |
+
|
| 469 |
+
Returns:
|
| 470 |
+
- pytorch ``state_dict``
|
| 471 |
+
|
| 472 |
+
Note: this approach may not work if your application doesn't have sufficient free CPU memory and
|
| 473 |
+
you may need to use the offline approach using the ``zero_to_fp32.py`` script that is saved with
|
| 474 |
+
the checkpoint.
|
| 475 |
+
|
| 476 |
+
A typical usage might be ::
|
| 477 |
+
|
| 478 |
+
from deepspeed.utils.zero_to_fp32 import get_fp32_state_dict_from_zero_checkpoint
|
| 479 |
+
# do the training and checkpoint saving
|
| 480 |
+
state_dict = get_fp32_state_dict_from_zero_checkpoint(checkpoint_dir) # already on cpu
|
| 481 |
+
model = model.cpu() # move to cpu
|
| 482 |
+
model.load_state_dict(state_dict)
|
| 483 |
+
# submit to model hub or save the model to share with others
|
| 484 |
+
|
| 485 |
+
In this example the ``model`` will no longer be usable in the deepspeed context of the same
|
| 486 |
+
application. i.e. you will need to re-initialize the deepspeed engine, since
|
| 487 |
+
``model.load_state_dict(state_dict)`` will remove all the deepspeed magic from it.
|
| 488 |
+
|
| 489 |
+
If you want it all done for you, use ``load_state_dict_from_zero_checkpoint`` instead.
|
| 490 |
+
|
| 491 |
+
"""
|
| 492 |
+
if tag is None:
|
| 493 |
+
latest_path = os.path.join(checkpoint_dir, 'latest')
|
| 494 |
+
if os.path.isfile(latest_path):
|
| 495 |
+
with open(latest_path, 'r') as fd:
|
| 496 |
+
tag = fd.read().strip()
|
| 497 |
+
else:
|
| 498 |
+
raise ValueError(f"Unable to find 'latest' file at {latest_path}")
|
| 499 |
+
|
| 500 |
+
ds_checkpoint_dir = os.path.join(checkpoint_dir, tag)
|
| 501 |
+
|
| 502 |
+
if not os.path.isdir(ds_checkpoint_dir):
|
| 503 |
+
raise FileNotFoundError(f"Directory '{ds_checkpoint_dir}' doesn't exist")
|
| 504 |
+
|
| 505 |
+
return _get_fp32_state_dict_from_zero_checkpoint(ds_checkpoint_dir)
|
| 506 |
+
|
| 507 |
+
|
| 508 |
+
def convert_zero_checkpoint_to_fp32_state_dict(checkpoint_dir, output_file, tag=None):
|
| 509 |
+
"""
|
| 510 |
+
Convert ZeRO 2 or 3 checkpoint into a single fp32 consolidated ``state_dict`` file that can be
|
| 511 |
+
loaded with ``torch.load(file)`` + ``load_state_dict()`` and used for training without DeepSpeed.
|
| 512 |
+
|
| 513 |
+
Args:
|
| 514 |
+
- ``checkpoint_dir``: path to the desired checkpoint folder. (one that contains the tag-folder, like ``global_step14``)
|
| 515 |
+
- ``output_file``: path to the pytorch fp32 state_dict output file (e.g. path/pytorch_model.bin)
|
| 516 |
+
- ``tag``: checkpoint tag used as a unique identifier for checkpoint. If not provided will attempt to load tag in the file named ``latest`` in the checkpoint folder, e.g., ``global_step14``
|
| 517 |
+
"""
|
| 518 |
+
|
| 519 |
+
state_dict = get_fp32_state_dict_from_zero_checkpoint(checkpoint_dir, tag)
|
| 520 |
+
print(f"Saving fp32 state dict to {output_file}")
|
| 521 |
+
torch.save(state_dict, output_file)
|
| 522 |
+
|
| 523 |
+
|
| 524 |
+
def load_state_dict_from_zero_checkpoint(model, checkpoint_dir, tag=None):
|
| 525 |
+
"""
|
| 526 |
+
1. Put the provided model to cpu
|
| 527 |
+
2. Convert ZeRO 2 or 3 checkpoint into a single fp32 consolidated ``state_dict``
|
| 528 |
+
3. Load it into the provided model
|
| 529 |
+
|
| 530 |
+
Args:
|
| 531 |
+
- ``model``: the model object to update
|
| 532 |
+
- ``checkpoint_dir``: path to the desired checkpoint folder. (one that contains the tag-folder, like ``global_step14``)
|
| 533 |
+
- ``tag``: checkpoint tag used as a unique identifier for checkpoint. If not provided will attempt to load tag in the file named ``latest`` in the checkpoint folder, e.g., ``global_step14``
|
| 534 |
+
|
| 535 |
+
Returns:
|
| 536 |
+
- ``model`: modified model
|
| 537 |
+
|
| 538 |
+
Make sure you have plenty of CPU memory available before you call this function. If you don't
|
| 539 |
+
have enough use the ``zero_to_fp32.py`` utility to do the conversion. You will find it
|
| 540 |
+
conveniently placed for you in the checkpoint folder.
|
| 541 |
+
|
| 542 |
+
A typical usage might be ::
|
| 543 |
+
|
| 544 |
+
from deepspeed.utils.zero_to_fp32 import load_state_dict_from_zero_checkpoint
|
| 545 |
+
model = load_state_dict_from_zero_checkpoint(trainer.model, checkpoint_dir)
|
| 546 |
+
# submit to model hub or save the model to share with others
|
| 547 |
+
|
| 548 |
+
Note, that once this was run, the ``model`` will no longer be usable in the deepspeed context
|
| 549 |
+
of the same application. i.e. you will need to re-initialize the deepspeed engine, since
|
| 550 |
+
``model.load_state_dict(state_dict)`` will remove all the deepspeed magic from it.
|
| 551 |
+
|
| 552 |
+
"""
|
| 553 |
+
logger.info(f"Extracting fp32 weights")
|
| 554 |
+
state_dict = get_fp32_state_dict_from_zero_checkpoint(checkpoint_dir, tag)
|
| 555 |
+
|
| 556 |
+
logger.info(f"Overwriting model with fp32 weights")
|
| 557 |
+
model = model.cpu()
|
| 558 |
+
model.load_state_dict(state_dict, strict=False)
|
| 559 |
+
|
| 560 |
+
return model
|
| 561 |
+
|
| 562 |
+
|
| 563 |
+
if __name__ == "__main__":
|
| 564 |
+
|
| 565 |
+
parser = argparse.ArgumentParser()
|
| 566 |
+
parser.add_argument("checkpoint_dir",
|
| 567 |
+
type=str,
|
| 568 |
+
help="path to the desired checkpoint folder, e.g., path/checkpoint-12")
|
| 569 |
+
parser.add_argument(
|
| 570 |
+
"output_file",
|
| 571 |
+
type=str,
|
| 572 |
+
help="path to the pytorch fp32 state_dict output file (e.g. path/checkpoint-12/pytorch_model.bin)")
|
| 573 |
+
parser.add_argument("-d", "--debug", action='store_true', help="enable debug")
|
| 574 |
+
args = parser.parse_args()
|
| 575 |
+
|
| 576 |
+
debug = args.debug
|
| 577 |
+
|
| 578 |
+
convert_zero_checkpoint_to_fp32_state_dict(args.checkpoint_dir, args.output_file)
|