Downloads · 30 days
7
6% of all-time downloads
dimickkatarina/st-finetuned-cosqa
st-finetuned-cosqa is a sentence similarity model from dimickkatarina. Use it when you need a score for how close two texts are. It is set up for sentence-transformers.
This is a sentence-transformers model finetuned from sentence-transformers/all-MiniLM-L6-v2. It maps sentences & paragraphs to a 384-dimensional dense vector space and can be used for semantic textual similarity, sema…
Downloads · 30 days
7
6% of all-time downloads
All-time downloads
110
Public
Parameters
22.7M
90.9 MB on disk
Likes
0
Public
Click a slice to open those files.
.safetensors90.9 MB · 99%
From the Hugging Face model README
This is a sentence-transformers model finetuned from sentence-transformers/all-MiniLM-L6-v2. 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, 'architecture': '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("dimickkatarina/st-finetuned-cosqa")
# Run inference
sentences = [
'bottom 5 rows in python',
'def table_top_abs(self):\n """Returns the absolute position of table top"""\n table_height = np.array([0, 0, self.table_full_size[2]])\n return string_to_array(self.floor.get("pos")) + table_height',
'def refresh(self, document):\n\t\t""" Load a new copy of a document from the database. does not\n\t\t\treplace the old one """\n\t\ttry:\n\t\t\told_cache_size = self.cache_size\n\t\t\tself.cache_size = 0\n\t\t\tobj = self.query(type(document)).filter_by(mongo_id=document.mongo_id).one()\n\t\tfinally:\n\t\t\tself.cache_size = old_cache_size\n\t\tself.cache_write(obj)\n\t\treturn obj',
]
embeddings = model.encode(sentences)
print(embeddings.shape)
# [3, 384]
# Get the similarity scores for the embeddings
similarities = model.similarity(embeddings, embeddings)
print(similarities)
# tensor([[ 1.0000, 0.5112, -0.0912],
# [ 0.5112, 1.0000, -0.0497],
# [-0.0912, -0.0497, 1.0000]])
<!--
### Direct Usage (Transformers)
<details><summary>Click to see the direct usage in Transformers</summary>
</details>
-->
<!--
### Downstream Usage (Sentence Transformers)
You can finetune this model on your own dataset.
<details><summary>Click to expand</summary>
</details>
-->
<!--
### Out-of-Scope Use
*List how the model may foreseeably be misused and address what users ought not to do with the model.*
-->
<!--
## Bias, Risks and Limitations
*What are the known or foreseeable issues stemming from this model? You could also flag here known failure cases or weaknesses of the model.*
-->
<!--
### Recommendations
*What are recommendations with respect to the foreseeable issues? For example, filtering explicit content.*
-->
| anchor | positive | |
|---|---|---|
| type | string | string |
| details | <ul><li>min: 6 tokens</li><li>mean: 9.67 tokens</li><li>max: 21 tokens</li></ul> | <ul><li>min: 40 tokens</li><li>mean: 86.17 tokens</li><li>max: 256 tokens</li></ul> |
| anchor | positive |
|---|---|
| <code>1d array in char datatype in python</code> | <code>def _convert_to_array(array_like, dtype):<br> """<br> Convert Matrix attributes which are array-like or buffer to array.<br> """<br> if isinstance(array_like, bytes):<br> return np.frombuffer(array_like, dtype=dtype)<br> return np.asarray(array_like, dtype=dtype)</code> |
| <code>python condition non none</code> | <code>def _not(condition=None, **kwargs):<br> """<br> Return the opposite of input condition.<br><br> :param condition: condition to process.<br><br> :result: not condition.<br> :rtype: bool<br> """<br><br> result = True<br><br> if condition is not None:<br> result = not run(condition, **kwargs)<br><br> return result</code> |
| <code>accessing a column from a matrix in python</code> | <code>def get_column(self, X, column):<br> """Return a column of the given matrix.<br><br> Args:<br> X: numpy.ndarray or pandas.DataFrame.<br> column: int or str.<br><br> Returns:<br> np.ndarray: Selected column.<br> """<br> if isinstance(X, pd.DataFrame):<br> return X[column].values<br><br> return X[:, column]</code> |
{
"scale": 20.0,
"similarity_fct": "cos_sim",
"gather_across_devices": false
}
per_device_train_batch_size: 64learning_rate: 2e-05num_train_epochs: 4warmup_ratio: 0.1dataloader_drop_last: Truebatch_sampler: no_duplicatesoverwrite_output_dir: Falsedo_predict: Falseeval_strategy: noprediction_loss_only: Trueper_device_train_batch_size: 64per_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: 2e-05weight_decay: 0.0adam_beta1: 0.9adam_beta2: 0.999adam_epsilon: 1e-08max_grad_norm: 1.0num_train_epochs: 4max_steps: -1lr_scheduler_type: linearlr_scheduler_kwargs: {}warmup_ratio: 0.1warmup_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: 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: Truedataloader_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}parallelism_config: Nonedeepspeed: Nonelabel_smoothing_factor: 0.0optim: adamw_torch_fusedoptim_args: Noneadafactor: Falsegroup_by_length: Falselength_column_name: lengthproject: huggingfacetrackio_space_id: trackioddp_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: Falseresume_from_checkpoint: Nonehub_model_id: Nonehub_strategy: every_savehub_private_repo: Nonehub_always_push: Falsehub_revision: Nonegradient_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: Noneinclude_tokens_per_second: Falseinclude_num_input_tokens_seen: noneftune_noise_alpha: Noneoptim_target_modules: Nonebatch_eval_metrics: Falseeval_on_start: Falseuse_liger_kernel: Falseliger_kernel_config: Noneeval_use_gather_object: Falseaverage_tokens_across_devices: Trueprompts: Nonebatch_sampler: no_duplicatesmulti_dataset_batch_sampler: proportionalrouter_mapping: {}learning_rate_mapping: {}| Epoch | Step | Training Loss |
|---|---|---|
| 0.0714 | 10 | 0.3791 |
| 0.1429 | 20 | 0.3626 |
| 0.2143 | 30 | 0.2615 |
| 0.2857 | 40 | 0.3141 |
| 0.3571 | 50 | 0.2518 |
| 0.4286 | 60 | 0.2634 |
| 0.5 | 70 | 0.2632 |
| 0.5714 | 80 | 0.2297 |
| 0.6429 | 90 | 0.2026 |
| 0.7143 | 100 | 0.2151 |
| 0.7857 | 110 | 0.2281 |
| 0.8571 | 120 | 0.1605 |
| 0.9286 | 130 | 0.1922 |
| 1.0 | 140 | 0.1857 |
| 1.0714 | 150 | 0.1826 |
| 1.1429 | 160 | 0.2142 |
| 1.2143 | 170 | 0.1679 |
| 1.2857 | 180 | 0.1761 |
| 1.3571 | 190 | 0.2048 |
| 1.4286 | 200 | 0.1439 |
| 1.5 | 210 | 0.1792 |
| 1.5714 | 220 | 0.1937 |
| 1.6429 | 230 | 0.1797 |
| 1.7143 | 240 | 0.1374 |
| 1.7857 | 250 | 0.1577 |
| 1.8571 | 260 | 0.1594 |
| 1.9286 | 270 | 0.1582 |
| 2.0 | 280 | 0.1464 |
| 2.0714 | 290 | 0.1189 |
| 2.1429 | 300 | 0.1257 |
| 2.2143 | 310 | 0.1501 |
| 2.2857 | 320 | 0.1827 |
| 2.3571 | 330 | 0.1559 |
| 2.4286 | 340 | 0.1348 |
| 2.5 | 350 | 0.1298 |
| 2.5714 | 360 | 0.1445 |
| 2.6429 | 370 | 0.1417 |
| 2.7143 | 380 | 0.1865 |
| 2.7857 | 390 | 0.1613 |
| 2.8571 | 400 | 0.1433 |
| 2.9286 | 410 | 0.1402 |
| 3.0 | 420 | 0.1409 |
| 3.0714 | 430 | 0.1219 |
| 3.1429 | 440 | 0.1423 |
| 3.2143 | 450 | 0.1426 |
| 3.2857 | 460 | 0.1336 |
| 3.3571 | 470 | 0.1163 |
| 3.4286 | 480 | 0.1122 |
| 3.5 | 490 | 0.153 |
| 3.5714 | 500 | 0.1288 |
| 3.6429 | 510 | 0.1352 |
| 3.7143 | 520 | 0.1629 |
| 3.7857 | 530 | 0.1074 |
| 3.8571 | 540 | 0.149 |
| 3.9286 | 550 | 0.1315 |
| 4.0 | 560 | 0.1227 |
@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",
}
@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}
}
<!--
## Glossary
*Clearly define terms in order to be accessible across audiences.*
-->
<!--
## Model Card Authors
*Lists the people who create the model card, providing recognition and accountability for the detailed work that goes into its construction.*
-->
<!--
## Model Card Contact
*Provides a way for people who have updates to the Model Card, suggestions, or questions, to contact the Model Card authors.*
-->