Upload LlamaForCausalLM

README.md

@@ -1,86 +1,46 @@
 ---
 base_model: deepseek-ai/deepseek-math-7b-base
+license: apache-2.0
+pipeline_tag: text-generation
 tags:
 - alignment-handbook
 - generated_from_trainer
 widget:
-  - example_title: Math problem
-    messages:
-      - role: user
-        content: >-
-          For how many values of the constant $k$ will the polynomial
-          $x^{2}+kx+36$ have two distinct integer roots?
-    output:
-      text: >-
-        ### Solution: 
-        
-        1- For the polynomial \\( x^2 + kx + 36 \\) to have two
-        distinct integer roots, let's denote these roots by \\( r_1 \\) and \\(
-        r_2 \\).
-
-
-
-        2- According to Vieta's formulas, the sum of the roots \\( r_1 + r_2 \\)
-        is equal to \\(-k\\), and the product of the roots \\( r_1 \\cdot r_2
-        \\) is equal to 36.
-
-
-
-        3- To find the distinct integer pairs \\((r_1, r_2)\\) whose product is
-        36, we need to determine all pairs of integers \\((r_1, r_2)\\) such
-        that \\( r_1 \\cdot r_2 = 36 \\) and \\( r_1 \\neq r_2 \\).
-
-
-
-        4- From the equation \\( r_1 + r_2 = -k \\), for each valid pair
-        \\((r_1, r_2)\\), we can compute the corresponding value of \\( k \\).
-
-
-
-        5- Finally, since we need the polynomial to have two distinct integer
-        roots, we need to ensure that \\( r_1 \\) and \\( r_2 \\) are distinct.
-
-        Let's start by finding all pairs \\((r_1, r_2)\\) such that \\( r_1
-        \\cdot r_2 = 36 \\). We'll then determine the values of \\( k \\) and
-        ensure the roots are distinct.
-
-        ```python import itertools
-
-        # Find all pairs (r1, r2) such that r1 * r2 = 36 product_36 = 36
-        factor_pairs = []
-
-        for i in range(1, product_36 + 1):
-          if product_36 % i == 0:
-            pair = (i, product_36 // i)
-            if pair[0] != pair[1]: # Ensure distinct pairs
-              factor_pairs.append(pair)
-            
-            # Calculate k for each pair and ensure distinct integer roots
-            valid_k_values = set()
-            for r1, r2 in factor_pairs:
-              if r1 != r2:
-                k = -(r1 + r2)
-                valid_k_values.add(k)
-                
-            print((len(valid_k_values), sorted(valid_k_values)))
-         ```
-         
-         ```output
-         (4, [-37, -20, -15,-13])
-         ```
-         The distinct integer values of \\( k \\) that make the
-        polynomial \\( x^2 + kx + 36 \\) have two distinct integer roots are
-        \\(-37, -20, -15, \\text{and} -13\\).
-
-        Therefore, the number of such values of \\( k \\) is:
-
-        [ \\boxed{4} \\]
-
-pipeline_tag: text-generation
+- example_title: Math problem
+  messages:
+  - role: user
+    content: For how many values of the constant $k$ will the polynomial $x^{2}+kx+36$
+      have two distinct integer roots?
+  output:
+    text: "### Solution: \n1- For the polynomial \\\\( x^2 + kx + 36 \\\\) to have\
+      \ two distinct integer roots, let's denote these roots by \\\\( r_1 \\\\) and\
+      \ \\\\( r_2 \\\\).\n\n\n2- According to Vieta's formulas, the sum of the roots\
+      \ \\\\( r_1 + r_2 \\\\) is equal to \\\\(-k\\\\), and the product of the roots\
+      \ \\\\( r_1 \\\\cdot r_2 \\\\) is equal to 36.\n\n\n3- To find the distinct\
+      \ integer pairs \\\\((r_1, r_2)\\\\) whose product is 36, we need to determine\
+      \ all pairs of integers \\\\((r_1, r_2)\\\\) such that \\\\( r_1 \\\\cdot r_2\
+      \ = 36 \\\\) and \\\\( r_1 \\\\neq r_2 \\\\).\n\n\n4- From the equation \\\\\
+      ( r_1 + r_2 = -k \\\\), for each valid pair \\\\((r_1, r_2)\\\\), we can compute\
+      \ the corresponding value of \\\\( k \\\\).\n\n\n5- Finally, since we need the\
+      \ polynomial to have two distinct integer roots, we need to ensure that \\\\\
+      ( r_1 \\\\) and \\\\( r_2 \\\\) are distinct.\nLet's start by finding all pairs\
+      \ \\\\((r_1, r_2)\\\\) such that \\\\( r_1 \\\\cdot r_2 = 36 \\\\). We'll then\
+      \ determine the values of \\\\( k \\\\) and ensure the roots are distinct.\n\
+      ```python import itertools\n# Find all pairs (r1, r2) such that r1 * r2 = 36\
+      \ product_36 = 36 factor_pairs = []\nfor i in range(1, product_36 + 1):\n  if\
+      \ product_36 % i == 0:\n    pair = (i, product_36 // i)\n    if pair[0] != pair[1]:\
+      \ # Ensure distinct pairs\n      factor_pairs.append(pair)\n    \n    # Calculate\
+      \ k for each pair and ensure distinct integer roots\n    valid_k_values = set()\n\
+      \    for r1, r2 in factor_pairs:\n      if r1 != r2:\n        k = -(r1 + r2)\n\
+      \        valid_k_values.add(k)\n        \n    print((len(valid_k_values), sorted(valid_k_values)))\n\
+      \ ```\n \n ```output\n (4, [-37, -20, -15,-13])\n ```\n The distinct integer\
+      \ values of \\\\( k \\\\) that make the\npolynomial \\\\( x^2 + kx + 36 \\\\\
+      ) have two distinct integer roots are \\\\(-37, -20, -15, \\\\text{and} -13\\\
+      \\).\nTherefore, the number of such values of \\\\( k \\\\) is:\n[ \\\\boxed{4}\
+      \ \\\\]"
 model-index:
 - name: NuminaMath-7B-TIR
   results: []
-license: apache-2.0
 ---
 
 <!-- This model card has been generated automatically according to the information the Trainer had access to. You

config.json

@@ -1,5 +1,5 @@
 {
-  "_name_or_path": "AI-MO/deepseek-math-7b-sft",
+  "_name_or_path": "AI-MO/NuminaMath-7B-TIR-decontaminated",
   "architectures": [
     "LlamaForCausalLM"
   ],
@@ -23,7 +23,7 @@
   "rope_theta": 10000.0,
   "tie_word_embeddings": false,
   "torch_dtype": "bfloat16",
-  "transformers_version": "4.40.1",
+  "transformers_version": "4.42.3",
   "use_cache": true,
   "vocab_size": 102400
 }

generation_config.json

@@ -2,5 +2,5 @@
   "_from_model_config": true,
   "bos_token_id": 100000,
   "eos_token_id": 100001,
-  "transformers_version": "4.40.1"
+  "transformers_version": "4.42.3"
 }

model-00001-of-00003.safetensors

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:0045d1995c101d251cd3491bd94353abd3a006a8a09869b549c852aa6e116376
+oid sha256:281356bc1fed34ed0b0f397584f0dcbfb067a9d01948d2547d7df579da85563f
 size 4987202208

model-00002-of-00003.safetensors

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:03c82865c40e1d7cfb82892b26d0b0f58cef6dbd1404b86835b50b89d193aa7f
+oid sha256:b8124f219a63ead9a2d7d7ac5c7e7f0cda6a8f984c5ab6852cca2ebbc71657f6
 size 4980945440

model-00003-of-00003.safetensors

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:1a27a6a914a53e91f70b55b84adea793998b0e587a5746f9a02f050bb6510732
+oid sha256:6c3210282dad5a2c700dacf79afe4527d07deaab693e716ed4aba1eb8019aedc
 size 3852615520