Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks
Paper • 1908.10084 • Published • 12
This is a sentence-transformers model finetuned from sentence-transformers/all-MiniLM-L6-v2 on the train dataset. It maps sentences & paragraphs to a 384-dimensional dense vector space and can be used for semantic textual similarity, semantic search, paraphrase mining, text classification, clustering, and more.
SentenceTransformer(
(0): Transformer({'max_seq_length': 256, 'do_lower_case': False}) with Transformer model: BertModel
(1): Pooling({'word_embedding_dimension': 384, '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()
)
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("TONKKrongyuth/finetune-all-minilm-L6-v2-proofwiki_wo-theorem")
# Run inference
sentences = [
':$\\displaystyle \\sum_{n \\mathop = 1}^\\infty \\dfrac 1 {x_n \\map {J_0 } {x_n} } = 0 \\cdotp 38479 \\ldots$where::$x_n$ is the $n$th [[Definition:Zero of Function|zero]] of the [[Definition:Bessel Function of the First Kind|order $1$ Bessel function of the first kind]]:$\\map {J_0 } {x_n}$ is the [[Definition:Bessel Function of the First Kind|order $0$ Bessel function of the first kind]] of $x_n$.',
"A '''Bessel function of the first kind of order $n$''' is a [[Definition:Bessel Function|Bessel function]] which is [[Definition:Non-Singular Point|non-singular]] at the [[Definition:Origin|origin]]It is usually denoted $\\map {J_n} x$, where $x$ is the [[Definition:Dependent Variable|dependent variable]] of the instance of '''[[Definition:Bessel's Equation|Bessel's equation]]''' to which $\\map {J_n} x$ forms a [[Definition:Solution of Differential Equation|solution]].",
"=== [[Definition:Prime Number/Definition 1|Definition 1]] ==={{:Definition:Prime Number/Definition 1}}=== [[Definition:Prime Number/Definition 2|Definition 2]] ==={{:Definition:Prime Number/Definition 2}}=== [[Definition:Prime Number/Definition 3|Definition 3]] ==={{:Definition:Prime Number/Definition 3}}=== [[Definition:Prime Number/Definition 4|Definition 4]] ==={{:Definition:Prime Number/Definition 4}}=== [[Definition:Prime Number/Definition 5|Definition 5]] ==={{:Definition:Prime Number/Definition 5}}=== [[Definition:Prime Number/Definition 6|Definition 6]] ==={{:Definition:Prime Number/Definition 6}}=== [[Definition:Prime Number/Definition 7|Definition 7]] ==={{:Definition:Prime Number/Definition 7}}=== Euclid's Definition ==={{EuclidSaid}}:''{{:Definition:Euclid's Definitions - Book VII/11 - Prime Number}}''{{EuclidDefRefNocat|VII|11|Prime Number}}",
]
embeddings = model.encode(sentences)
print(embeddings.shape)
# [3, 384]
# Get the similarity scores for the embeddings
similarities = model.similarity(embeddings, embeddings)
print(similarities.shape)
# [3, 3]
theorems_content, refs_content, and score| theorems_content | refs_content | score | |
|---|---|---|---|
| type | string | string | float |
| details |
|
|
|
| theorems_content | refs_content | score |
|---|---|---|
Let $C_n$ be the [[Definition:Cyclic Group |
cyclic group]] of [[Definition:Order of Structure | order]] $n$.Let $C_n = \gen a$, that is, that $C_n$ is [[Definition:Generator of Cyclic Group |
Let $T = \struct {S, \tau}$ be a [[Definition:Topological Space |
topological space]] where $\tau$ is the [[Definition:Discrete Topology | discrete topology]] on $S$.Then $T$ is a [[Definition:Scattered Space |
Let $A \subseteq \R$ be the [[Definition:Set |
set]] of all points on $\R$ defined as::$A := \set 0 \cup \set {\dfrac 1 n : n \in \Z_{>0} }$Let $\struct {A, \tau_d}$ be the [[Definition:Integer Reciprocal Space | integer reciprocal space]] with [[Definition:Zero (Number) |
CosineSimilarityLoss with these parameters:{
"loss_fct": "torch.nn.modules.loss.MSELoss"
}
theorems_content, refs_content, and score| theorems_content | refs_content | score | |
|---|---|---|---|
| type | string | string | float |
| details |
|
|
|
| theorems_content | refs_content | score |
|---|---|---|
Let $F$ be a [[Definition:Field (Abstract Algebra) |
field]].Then $F$ is a [[Definition:Principal Ideal Domain | principal ideal domain]]. |
:$G$ is a [[Definition:Left Ideal |
left ideal]] of $\struct {\map {\MM_S} 2, +, \times}$. | $J$ is a '''left ideal of $R$''' {{iff}}::$\forall j \in J: \forall r \in R: r \circ j \in J$that is, {{iff}}::$\forall r \in R: r \circ J \subseteq J$ |
Let $S$ be a [[Definition:Set |
set]].Let $T \subseteq S$ be a given [[Definition:Subset | subset]] of $S$.Let $\powerset S$ denote the [[Definition:Power Set |
CosineSimilarityLoss with these parameters:{
"loss_fct": "torch.nn.modules.loss.MSELoss"
}
eval_strategy: epochpush_to_hub: Truehub_model_id: TONKKrongyuth/finetune-all-minilm-L6-v2-proofwiki_wo-theoremoverwrite_output_dir: Falsedo_predict: Falseeval_strategy: epochprediction_loss_only: Trueper_device_train_batch_size: 8per_device_eval_batch_size: 8per_gpu_train_batch_size: Noneper_gpu_eval_batch_size: Nonegradient_accumulation_steps: 1eval_accumulation_steps: Nonetorch_empty_cache_steps: Nonelearning_rate: 5e-05weight_decay: 0.0adam_beta1: 0.9adam_beta2: 0.999adam_epsilon: 1e-08max_grad_norm: 1.0num_train_epochs: 3max_steps: -1lr_scheduler_type: linearlr_scheduler_kwargs: {}warmup_ratio: 0.0warmup_steps: 0log_level: passivelog_level_replica: warninglog_on_each_node: Truelogging_nan_inf_filter: Truesave_safetensors: Truesave_on_each_node: Falsesave_only_model: Falserestore_callback_states_from_checkpoint: Falseno_cuda: Falseuse_cpu: Falseuse_mps_device: Falseseed: 42data_seed: Nonejit_mode_eval: Falseuse_ipex: Falsebf16: Falsefp16: Falsefp16_opt_level: O1half_precision_backend: autobf16_full_eval: Falsefp16_full_eval: Falsetf32: Nonelocal_rank: 0ddp_backend: Nonetpu_num_cores: Nonetpu_metrics_debug: Falsedebug: []dataloader_drop_last: Falsedataloader_num_workers: 0dataloader_prefetch_factor: Nonepast_index: -1disable_tqdm: Falseremove_unused_columns: Truelabel_names: Noneload_best_model_at_end: Falseignore_data_skip: Falsefsdp: []fsdp_min_num_params: 0fsdp_config: {'min_num_params': 0, 'xla': False, 'xla_fsdp_v2': False, 'xla_fsdp_grad_ckpt': False}fsdp_transformer_layer_cls_to_wrap: Noneaccelerator_config: {'split_batches': False, 'dispatch_batches': None, 'even_batches': True, 'use_seedable_sampler': True, 'non_blocking': False, 'gradient_accumulation_kwargs': None}deepspeed: Nonelabel_smoothing_factor: 0.0optim: adamw_torchoptim_args: Noneadafactor: Falsegroup_by_length: Falselength_column_name: lengthddp_find_unused_parameters: Noneddp_bucket_cap_mb: Noneddp_broadcast_buffers: Falsedataloader_pin_memory: Truedataloader_persistent_workers: Falseskip_memory_metrics: Trueuse_legacy_prediction_loop: Falsepush_to_hub: Trueresume_from_checkpoint: Nonehub_model_id: TONKKrongyuth/finetune-all-minilm-L6-v2-proofwiki_wo-theoremhub_strategy: every_savehub_private_repo: Nonehub_always_push: Falsegradient_checkpointing: Falsegradient_checkpointing_kwargs: Noneinclude_inputs_for_metrics: Falseinclude_for_metrics: []eval_do_concat_batches: Truefp16_backend: autopush_to_hub_model_id: Nonepush_to_hub_organization: Nonemp_parameters: auto_find_batch_size: Falsefull_determinism: Falsetorchdynamo: Noneray_scope: lastddp_timeout: 1800torch_compile: Falsetorch_compile_backend: Nonetorch_compile_mode: Nonedispatch_batches: Nonesplit_batches: Noneinclude_tokens_per_second: Falseinclude_num_input_tokens_seen: Falseneftune_noise_alpha: Noneoptim_target_modules: Nonebatch_eval_metrics: Falseeval_on_start: Falseuse_liger_kernel: Falseeval_use_gather_object: Falseaverage_tokens_across_devices: Falseprompts: Nonebatch_sampler: batch_samplermulti_dataset_batch_sampler: proportional| Epoch | Step | Training Loss | train loss |
|---|---|---|---|
| 1.0 | 2617 | 0.0357 | 0.0275 |
| 2.0 | 5234 | 0.0171 | 0.0247 |
| 3.0 | 7851 | 0.0097 | 0.0237 |
@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",
}
Base model
sentence-transformers/all-MiniLM-L6-v2