File size: 16,564 Bytes
13af35f
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
296d63c
 
 
 
 
 
 
 
 
13af35f
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
---
tags:
- sentence-transformers
- sentence-similarity
- feature-extraction
- dense
- generated_from_trainer
- dataset_size:363
- loss:CosineSimilarityLoss
base_model: sentence-transformers/all-MiniLM-L6-v2
widget:
- source_sentence: \section{5. Correspondencia con constantes físicas}
  sentences:
  - \section{7. Simulación Python  Malla Icosaédrica y Autovalores}
  - \textbf{Interpretación:} Cada modo $n$ representa un posible estado de partícula,
    resonancia o nodo cognitivo.
  - rroc_V
- source_sentence: '\[

    S_{\rm eff} = \int d^4x \left[ \frac{R}{16 \pi G} + \lambda \log(r) + \mathcal{L}_{\rm
    matter} \right]

    \]'
  sentences:
  - 'Sea $H$ la matriz discreta sobre la red icosaédrica. Los autovalores $\{E_n\}$
    y vectores propios $\{\Psi_n\}$ cumplen:'
  - '\begin{lstlisting}[language=Python]

    import numpy as np

    import networkx as nx

    from scipy.linalg import eigh

    import matplotlib.pyplot as plt'
  - \section{6. Aplicaciones en resonancia y cognición}
- source_sentence: \section{6. Aplicaciones en resonancia y cognición}
  sentences:
  - '# Visualizar malla

    pos = nx.spring_layout(G, seed=42)

    nx.draw(G, pos, with_labels=True, node_color=''cyan'', edge_color=''gray'')

    plt.show()

    \end{lstlisting}'
  - '\begin{lstlisting}[language=Python]

    import numpy as np

    import networkx as nx

    from scipy.linalg import eigh

    import matplotlib.pyplot as plt'
  - \section{5. Correspondencia con constantes físicas}
- source_sentence: \textbf{Interpretación:} Cada modo $n$ representa un posible estado
    de partícula, resonancia o nodo cognitivo.
  sentences:
  - '\begin{lstlisting}[language=Python]

    import numpy as np

    import networkx as nx

    from scipy.linalg import eigh

    import matplotlib.pyplot as plt'
  - ln(phi)
  - '# Visualizar malla

    pos = nx.spring_layout(G, seed=42)

    nx.draw(G, pos, with_labels=True, node_color=''cyan'', edge_color=''gray'')

    plt.show()

    \end{lstlisting}'
- source_sentence: "donde:\n\\begin{itemize}\n    \\item $\\psi_i$ son espinores icosaédricos.\n\
    \    \\item $r_{ij}$ es la distancia entre nodos $i$ y $j$.\n    \\item $A,B,C$\
    \ son acoplamientos gauge discretos.\n\\end{itemize}"
  sentences:
  - "\\begin{abstract}\nEsta versión extendida del \\textbf{Resonance of Reality Framework\
    \ (RRF)} presenta:\n\\begin{itemize}\n    \\item Hamiltoniano discreto icosaédrico\
    \ con modos normales.\n    \\item Corrección logarítmica gravitatoria y acoplamientos\
    \ gauge explícitos.\n    \\item Correspondencia con constantes físicas fundamentales.\n\
    \    \\item Ejemplo de simulación Python que visualiza la malla icosaédrica y\
    \ autovalores.\n\\end{itemize}\n\\end{abstract}"
  - "\\begin{itemize}\n    \\item Cada nodo $\\psi_i$ como \\textbf{átomo de experiencia}.\n\
    \    \\item Patrones icosaédricos y $\\phi$ guían frecuencia de resonancia.\n\
    \    \\item Protocolos musicales y visuales para plasticidad neuronal.\n\\end{itemize}"
  - "\\begin{itemize}\n    \\item Cada nodo $\\psi_i$ como \\textbf{átomo de experiencia}.\n\
    \    \\item Patrones icosaédricos y $\\phi$ guían frecuencia de resonancia.\n\
    \    \\item Protocolos musicales y visuales para plasticidad neuronal.\n\\end{itemize}"
pipeline_tag: sentence-similarity
library_name: sentence-transformers
---

# SentenceTransformer based on sentence-transformers/all-MiniLM-L6-v2

This is a [sentence-transformers](https://www.SBERT.net) model finetuned from [sentence-transformers/all-MiniLM-L6-v2](https://huggingface.co/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.

## Model Details

### Model Description
- **Model Type:** Sentence Transformer
- **Base model:** [sentence-transformers/all-MiniLM-L6-v2](https://huggingface.co/sentence-transformers/all-MiniLM-L6-v2) <!-- at revision c9745ed1d9f207416be6d2e6f8de32d1f16199bf -->
- **Maximum Sequence Length:** 256 tokens
- **Output Dimensionality:** 384 dimensions
- **Similarity Function:** Cosine Similarity
<!-- - **Training Dataset:** Unknown -->
<!-- - **Language:** Unknown -->
<!-- - **License:** Unknown -->

### Model Sources

- **Documentation:** [Sentence Transformers Documentation](https://sbert.net)
- **Repository:** [Sentence Transformers on GitHub](https://github.com/UKPLab/sentence-transformers)
- **Hugging Face:** [Sentence Transformers on Hugging Face](https://huggingface.co/models?library=sentence-transformers)

### Full Model Architecture

```
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()
)
```

## Usage

### Direct Usage (Sentence Transformers)

First install the Sentence Transformers library:

```bash
pip install -U sentence-transformers
```

Then you can load this model and run inference.
```python
from sentence_transformers import SentenceTransformer

# Download from the 🤗 Hub
model = SentenceTransformer("sentence_transformers_model_id")
# Run inference
sentences = [
    'donde:\n\\begin{itemize}\n    \\item $\\psi_i$ son espinores icosaédricos.\n    \\item $r_{ij}$ es la distancia entre nodos $i$ y $j$.\n    \\item $A,B,C$ son acoplamientos gauge discretos.\n\\end{itemize}',
    '\\begin{itemize}\n    \\item Cada nodo $\\psi_i$ como \\textbf{átomo de experiencia}.\n    \\item Patrones icosaédricos y $\\phi$ guían frecuencia de resonancia.\n    \\item Protocolos musicales y visuales para plasticidad neuronal.\n\\end{itemize}',
    '\\begin{abstract}\nEsta versión extendida del \\textbf{Resonance of Reality Framework (RRF)} presenta:\n\\begin{itemize}\n    \\item Hamiltoniano discreto icosaédrico con modos normales.\n    \\item Corrección logarítmica gravitatoria y acoplamientos gauge explícitos.\n    \\item Correspondencia con constantes físicas fundamentales.\n    \\item Ejemplo de simulación Python que visualiza la malla icosaédrica y autovalores.\n\\end{itemize}\n\\end{abstract}',
]
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.7950, 0.7297],
#         [0.7950, 1.0000, 0.7343],
#         [0.7297, 0.7343, 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.*
-->

## Training Details

### Training Dataset

#### Unnamed Dataset

* Size: 363 training samples
* Columns: <code>sentence_0</code>, <code>sentence_1</code>, and <code>label</code>
* Approximate statistics based on the first 363 samples:
  |         | sentence_0                                                                          | sentence_1                                                                         | label                                                         |
  |:--------|:------------------------------------------------------------------------------------|:-----------------------------------------------------------------------------------|:--------------------------------------------------------------|
  | type    | string                                                                              | string                                                                             | float                                                         |
  | details | <ul><li>min: 16 tokens</li><li>mean: 65.29 tokens</li><li>max: 127 tokens</li></ul> | <ul><li>min: 3 tokens</li><li>mean: 38.02 tokens</li><li>max: 127 tokens</li></ul> | <ul><li>min: 0.0</li><li>mean: 0.5</li><li>max: 1.0</li></ul> |
* Samples:
  | sentence_0                                                                                                                                                                               | sentence_1                                                                                                                                                                                                                                      | label                           |
  |:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------------------------------|
  | <code>Sea $H$ la matriz discreta sobre la red icosaédrica. Los autovalores $\{E_n\}$ y vectores propios $\{\Psi_n\}$ cumplen:</code>                                                     | <code># Crear grafo icosaédrico<br>G = nx.icosahedral_graph()<br>n = G.number_of_nodes()</code>                                                                                                                                                 | <code>0.4647801650468898</code> |
  | <code>\[<br>i \hbar \frac{\partial \Psi}{\partial t} = H \Psi<br>\]</code>                                                                                                               | <code>\begin{align*}<br>\alpha_{\rm fine} &\approx f(E_n, \text{geometría icosaédrica}) \\<br>m_\nu &\approx g(\text{acoplamientos SU(2)/SU(3) discretos}) \\<br>\Lambda &\approx h(\text{energía de vacío logarítmica})<br>\end{align*}</code> | <code>0.4930957329947213</code> |
  | <code>\title{Resonance of Reality Framework (RRF) Extendido\\<br>Hamiltoniano Icosaédrico, Gravedad Logarítmica y Simulación}<br>\author{Antony Padilla Morales}<br>\date{\today}</code> | <code>donde:<br>\begin{itemize}<br>    \item $\psi_i$ son espinores icosaédricos.<br>    \item $r_{ij}$ es la distancia entre nodos $i$ y $j$.<br>    \item $A,B,C$ son acoplamientos gauge discretos.<br>\end{itemize}</code>                  | <code>0.5762137786115148</code> |
* Loss: [<code>CosineSimilarityLoss</code>](https://sbert.net/docs/package_reference/sentence_transformer/losses.html#cosinesimilarityloss) with these parameters:
  ```json
  {
      "loss_fct": "torch.nn.modules.loss.MSELoss"
  }
  ```

### Training Hyperparameters
#### Non-Default Hyperparameters

- `per_device_train_batch_size`: 16
- `per_device_eval_batch_size`: 16
- `multi_dataset_batch_sampler`: round_robin

#### All Hyperparameters
<details><summary>Click to expand</summary>

- `overwrite_output_dir`: False
- `do_predict`: False
- `eval_strategy`: no
- `prediction_loss_only`: True
- `per_device_train_batch_size`: 16
- `per_device_eval_batch_size`: 16
- `per_gpu_train_batch_size`: None
- `per_gpu_eval_batch_size`: None
- `gradient_accumulation_steps`: 1
- `eval_accumulation_steps`: None
- `torch_empty_cache_steps`: None
- `learning_rate`: 5e-05
- `weight_decay`: 0.0
- `adam_beta1`: 0.9
- `adam_beta2`: 0.999
- `adam_epsilon`: 1e-08
- `max_grad_norm`: 1
- `num_train_epochs`: 3
- `max_steps`: -1
- `lr_scheduler_type`: linear
- `lr_scheduler_kwargs`: {}
- `warmup_ratio`: 0.0
- `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`: False
- `fp16`: False
- `fp16_opt_level`: O1
- `half_precision_backend`: auto
- `bf16_full_eval`: False
- `fp16_full_eval`: False
- `tf32`: None
- `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`: False
- `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`: batch_sampler
- `multi_dataset_batch_sampler`: round_robin
- `router_mapping`: {}
- `learning_rate_mapping`: {}

</details>

### Framework Versions
- Python: 3.12.12
- Sentence Transformers: 5.1.1
- Transformers: 4.57.0
- PyTorch: 2.8.0+cu126
- Accelerate: 1.10.1
- Datasets: 4.0.0
- Tokenizers: 0.22.1

## Citation

### BibTeX

#### Sentence Transformers
```bibtex
@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{antony_padilla_morales_2025,
	author       = { Antony Padilla Morales },
	title        = { RRFSAVANTMADE (Revision 13af35f) },
	year         = 2025,
	url          = { https://huggingface.co/antonypamo/RRFSAVANTMADE },
	doi          = { 10.57967/hf/7034 },
	publisher    = { Hugging Face }
}
```

<!--
## 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.*
-->