ModernBERT Embed base Legal Matryoshka
This is a sentence-transformers model finetuned from nomic-ai/modernbert-embed-base on the json dataset. It maps sentences & paragraphs to a 768-dimensional dense vector space and can be used for semantic textual similarity, semantic search, paraphrase mining, text classification, clustering, and more.
Model Details
Model Description
- Model Type: Sentence Transformer
- Base model: nomic-ai/modernbert-embed-base
- Maximum Sequence Length: 8192 tokens
- Output Dimensionality: 768 dimensions
- Similarity Function: Cosine Similarity
- Training Dataset:
- Language: en
- License: apache-2.0
Model Sources
Full Model Architecture
SentenceTransformer(
(0): Transformer({'max_seq_length': 8192, 'do_lower_case': False, 'architecture': 'ModernBertModel'})
(1): Pooling({'word_embedding_dimension': 768, 'pooling_mode_cls_token': False, 'pooling_mode_mean_tokens': True, 'pooling_mode_max_tokens': False, 'pooling_mode_mean_sqrt_len_tokens': False, 'pooling_mode_weightedmean_tokens': False, 'pooling_mode_lasttoken': False, 'include_prompt': True})
(2): Normalize()
)
Usage
Direct Usage (Sentence Transformers)
First install the Sentence Transformers library:
pip install -U sentence-transformers
Then you can load this model and run inference.
from sentence_transformers import SentenceTransformer
# Download from the 🤗 Hub
model = SentenceTransformer("Sri1999/modernbert-embed-base-legal-matryoshka-2")
# Run inference
sentences = [
'qualifications for mentors). Importantly, firms need not individually qualify as small businesses \nto serve as mentors in the program. See 13 C.F.R. § 125.9(b) (“Any concern that demonstrates a \ncommitment and the ability to assist small business concerns may act as a mentor and receive \nbenefits as set forth in this section. This includes other than small businesses.”). All mentor-',
'Do firms need to qualify as small businesses to serve as mentors in the program?',
"Where in the statutory language does the term 'build up' appear?",
]
embeddings = model.encode(sentences)
print(embeddings.shape)
# [3, 768]
# Get the similarity scores for the embeddings
similarities = model.similarity(embeddings, embeddings)
print(similarities)
# tensor([[1.0000, 0.7567, 0.0796],
# [0.7567, 1.0000, 0.0936],
# [0.0796, 0.0936, 1.0000]])
Evaluation
Metrics
Information Retrieval
| Metric | Value |
|---|
| cosine_accuracy@1 | 0.541 |
| cosine_accuracy@3 | 0.5858 |
| cosine_accuracy@5 | 0.6677 |
| cosine_accuracy@10 | 0.7527 |
| cosine_precision@1 | 0.541 |
| cosine_precision@3 | 0.5049 |
| cosine_precision@5 | 0.3845 |
| cosine_precision@10 | 0.2269 |
| cosine_recall@1 | 0.2003 |
| cosine_recall@3 | 0.5067 |
| cosine_recall@5 | 0.6282 |
| cosine_recall@10 | 0.7353 |
| cosine_ndcg@10 | 0.6431 |
| cosine_mrr@10 | 0.5877 |
| cosine_map@100 | 0.6279 |
Information Retrieval
| Metric | Value |
|---|
| cosine_accuracy@1 | 0.5348 |
| cosine_accuracy@3 | 0.5734 |
| cosine_accuracy@5 | 0.66 |
| cosine_accuracy@10 | 0.728 |
| cosine_precision@1 | 0.5348 |
| cosine_precision@3 | 0.4946 |
| cosine_precision@5 | 0.3784 |
| cosine_precision@10 | 0.2204 |
| cosine_recall@1 | 0.1996 |
| cosine_recall@3 | 0.4997 |
| cosine_recall@5 | 0.619 |
| cosine_recall@10 | 0.7181 |
| cosine_ndcg@10 | 0.6315 |
| cosine_mrr@10 | 0.5786 |
| cosine_map@100 | 0.619 |
Information Retrieval
| Metric | Value |
|---|
| cosine_accuracy@1 | 0.5008 |
| cosine_accuracy@3 | 0.558 |
| cosine_accuracy@5 | 0.6445 |
| cosine_accuracy@10 | 0.7048 |
| cosine_precision@1 | 0.5008 |
| cosine_precision@3 | 0.4719 |
| cosine_precision@5 | 0.3638 |
| cosine_precision@10 | 0.215 |
| cosine_recall@1 | 0.1883 |
| cosine_recall@3 | 0.4799 |
| cosine_recall@5 | 0.593 |
| cosine_recall@10 | 0.696 |
| cosine_ndcg@10 | 0.6073 |
| cosine_mrr@10 | 0.5502 |
| cosine_map@100 | 0.5938 |
Information Retrieval
| Metric | Value |
|---|
| cosine_accuracy@1 | 0.4405 |
| cosine_accuracy@3 | 0.4853 |
| cosine_accuracy@5 | 0.5811 |
| cosine_accuracy@10 | 0.6522 |
| cosine_precision@1 | 0.4405 |
| cosine_precision@3 | 0.4101 |
| cosine_precision@5 | 0.3236 |
| cosine_precision@10 | 0.1963 |
| cosine_recall@1 | 0.166 |
| cosine_recall@3 | 0.4162 |
| cosine_recall@5 | 0.5305 |
| cosine_recall@10 | 0.6337 |
| cosine_ndcg@10 | 0.5441 |
| cosine_mrr@10 | 0.488 |
| cosine_map@100 | 0.532 |
Information Retrieval
| Metric | Value |
|---|
| cosine_accuracy@1 | 0.34 |
| cosine_accuracy@3 | 0.3756 |
| cosine_accuracy@5 | 0.4467 |
| cosine_accuracy@10 | 0.5116 |
| cosine_precision@1 | 0.34 |
| cosine_precision@3 | 0.3163 |
| cosine_precision@5 | 0.2461 |
| cosine_precision@10 | 0.1524 |
| cosine_recall@1 | 0.1321 |
| cosine_recall@3 | 0.3261 |
| cosine_recall@5 | 0.4084 |
| cosine_recall@10 | 0.4986 |
| cosine_ndcg@10 | 0.4248 |
| cosine_mrr@10 | 0.3788 |
| cosine_map@100 | 0.4234 |
Training Details
Training Dataset
json
- Dataset: json
- Size: 5,822 training samples
- Columns: positive and anchor
- Approximate statistics based on the first 1000 samples:
| positive | anchor |
|---|
| type | string | string |
| details | min: 28 tokensmean: 97.74 tokensmax: 170 tokens | min: 7 tokensmean: 16.92 tokensmax: 38 tokens |
- Samples:
| positive | anchor |
|---|
| from her; that other classmates (but not plaintiff) publicly exposed the allegations against defendant on social media; that, in July 2022, defendant filed a defamation lawsuit against several classmates (but not plaintiff); and that, since filing suit, defendant threatened to add plaintiff to his defamation suit.2 In support of the last allegation, plaintiff attached a letter from | Who did the defendant threaten to add to the defamation suit since filing it? |
| request instead of pursuing the assigned FOIA request. Hence, the assignment of a FOIA request would not add to the agency’s burden in administering the requester-specific provisions of the 50 statute, as compared to the submission of a new FOIA request: Both a new FOIA request and an assigned FOIA request would require de novo determinations regarding fee status, fee waivers, | How does the submission of a new FOIA request compare to the assignment of a FOIA request in terms of burden? |
| (c) Responsibility for Rules Violations. A lawyer shall beis responsible for another lawyer’s violation of the Rules of Professional Conduct if: (1) – (2) [No Change] Comment Subdivision (a) applies to lawyers who have managerial authority over the professional work of a firm. See terminology. This includes members of a partnership, the shareholders in a law firm | What responsibility does a lawyer have under section (c)? |
- Loss: MatryoshkaLoss with these parameters:
{
"loss": "MultipleNegativesRankingLoss",
"matryoshka_dims": [
768,
512,
256,
128,
64
],
"matryoshka_weights": [
1,
1,
1,
1,
1
],
"n_dims_per_step": -1
}
Training Hyperparameters
Non-Default Hyperparameters
eval_strategy: epoch
per_device_train_batch_size: 32
per_device_eval_batch_size: 16
gradient_accumulation_steps: 16
learning_rate: 2e-05
num_train_epochs: 4
lr_scheduler_type: cosine
warmup_ratio: 0.1
bf16: True
tf32: True
load_best_model_at_end: True
optim: adamw_torch_fused
batch_sampler: no_duplicates
All Hyperparameters
overwrite_output_dir: False
do_predict: False
eval_strategy: epoch
prediction_loss_only: True
per_device_train_batch_size: 32
per_device_eval_batch_size: 16
per_gpu_train_batch_size: None
per_gpu_eval_batch_size: None
gradient_accumulation_steps: 16
eval_accumulation_steps: None
torch_empty_cache_steps: None
learning_rate: 2e-05
weight_decay: 0.0
adam_beta1: 0.9
adam_beta2: 0.999
adam_epsilon: 1e-08
max_grad_norm: 1.0
num_train_epochs: 4
max_steps: -1
lr_scheduler_type: cosine
lr_scheduler_kwargs: {}
warmup_ratio: 0.1
warmup_steps: 0
log_level: passive
log_level_replica: warning
log_on_each_node: True
logging_nan_inf_filter: True
save_safetensors: True
save_on_each_node: False
save_only_model: False
restore_callback_states_from_checkpoint: False
no_cuda: False
use_cpu: False
use_mps_device: False
seed: 42
data_seed: None
jit_mode_eval: False
bf16: True
fp16: False
fp16_opt_level: O1
half_precision_backend: auto
bf16_full_eval: False
fp16_full_eval: False
tf32: True
local_rank: 0
ddp_backend: None
tpu_num_cores: None
tpu_metrics_debug: False
debug: []
dataloader_drop_last: False
dataloader_num_workers: 0
dataloader_prefetch_factor: None
past_index: -1
disable_tqdm: False
remove_unused_columns: True
label_names: None
load_best_model_at_end: True
ignore_data_skip: False
fsdp: []
fsdp_min_num_params: 0
fsdp_config: {'min_num_params': 0, 'xla': False, 'xla_fsdp_v2': False, 'xla_fsdp_grad_ckpt': False}
fsdp_transformer_layer_cls_to_wrap: None
accelerator_config: {'split_batches': False, 'dispatch_batches': None, 'even_batches': True, 'use_seedable_sampler': True, 'non_blocking': False, 'gradient_accumulation_kwargs': None}
parallelism_config: None
deepspeed: None
label_smoothing_factor: 0.0
optim: adamw_torch_fused
optim_args: None
adafactor: False
group_by_length: False
length_column_name: length
project: huggingface
trackio_space_id: trackio
ddp_find_unused_parameters: None
ddp_bucket_cap_mb: None
ddp_broadcast_buffers: False
dataloader_pin_memory: True
dataloader_persistent_workers: False
skip_memory_metrics: True
use_legacy_prediction_loop: False
push_to_hub: False
resume_from_checkpoint: None
hub_model_id: None
hub_strategy: every_save
hub_private_repo: None
hub_always_push: False
hub_revision: None
gradient_checkpointing: False
gradient_checkpointing_kwargs: None
include_inputs_for_metrics: False
include_for_metrics: []
eval_do_concat_batches: True
fp16_backend: auto
push_to_hub_model_id: None
push_to_hub_organization: None
mp_parameters:
auto_find_batch_size: False
full_determinism: False
torchdynamo: None
ray_scope: last
ddp_timeout: 1800
torch_compile: False
torch_compile_backend: None
torch_compile_mode: None
include_tokens_per_second: False
include_num_input_tokens_seen: no
neftune_noise_alpha: None
optim_target_modules: None
batch_eval_metrics: False
eval_on_start: False
use_liger_kernel: False
liger_kernel_config: None
eval_use_gather_object: False
average_tokens_across_devices: True
prompts: None
batch_sampler: no_duplicates
multi_dataset_batch_sampler: proportional
router_mapping: {}
learning_rate_mapping: {}
Training Logs
| Epoch | Step | Training Loss | dim_768_cosine_ndcg@10 | dim_512_cosine_ndcg@10 | dim_256_cosine_ndcg@10 | dim_128_cosine_ndcg@10 | dim_64_cosine_ndcg@10 |
|---|
| 0.8791 | 10 | 5.7589 | - | - | - | - | - |
| 1.0 | 12 | - | 0.6123 | 0.5983 | 0.5682 | 0.4764 | 0.3672 |
| 1.7033 | 20 | 2.6609 | - | - | - | - | - |
| 2.0 | 24 | - | 0.6367 | 0.6266 | 0.6057 | 0.5281 | 0.4200 |
| 2.5275 | 30 | 1.8268 | - | - | - | - | - |
| 3.0 | 36 | - | 0.6419 | 0.6317 | 0.6085 | 0.5454 | 0.4234 |
| 3.3516 | 40 | 1.6484 | - | - | - | - | - |
| 4.0 | 48 | - | 0.6431 | 0.6315 | 0.6073 | 0.5441 | 0.4248 |
- The bold row denotes the saved checkpoint.
Framework Versions
- Python: 3.11.14
- Sentence Transformers: 5.2.0
- Transformers: 4.57.3
- PyTorch: 2.5.1+cu121
- Accelerate: 1.12.0
- Datasets: 4.4.2
- Tokenizers: 0.22.1
Citation
BibTeX
Sentence Transformers
@inproceedings{reimers-2019-sentence-bert,
title = "Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks",
author = "Reimers, Nils and Gurevych, Iryna",
booktitle = "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing",
month = "11",
year = "2019",
publisher = "Association for Computational Linguistics",
url = "https://arxiv.org/abs/1908.10084",
}
MatryoshkaLoss
@misc{kusupati2024matryoshka,
title={Matryoshka Representation Learning},
author={Aditya Kusupati and Gantavya Bhatt and Aniket Rege and Matthew Wallingford and Aditya Sinha and Vivek Ramanujan and William Howard-Snyder and Kaifeng Chen and Sham Kakade and Prateek Jain and Ali Farhadi},
year={2024},
eprint={2205.13147},
archivePrefix={arXiv},
primaryClass={cs.LG}
}
MultipleNegativesRankingLoss
@misc{henderson2017efficient,
title={Efficient Natural Language Response Suggestion for Smart Reply},
author={Matthew Henderson and Rami Al-Rfou and Brian Strope and Yun-hsuan Sung and Laszlo Lukacs and Ruiqi Guo and Sanjiv Kumar and Balint Miklos and Ray Kurzweil},
year={2017},
eprint={1705.00652},
archivePrefix={arXiv},
primaryClass={cs.CL}
}