Upload folder using huggingface_hub
Browse files- README.md +233 -0
- adapter_config.json +31 -0
- adapter_model.safetensors +3 -0
- checkpoint_complete +0 -0
README.md
ADDED
|
@@ -0,0 +1,233 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
tags:
|
| 3 |
+
- clawpathy
|
| 4 |
+
- tinker
|
| 5 |
+
- lora
|
| 6 |
+
- sft
|
| 7 |
+
base_model: Qwen/Qwen3-4B-Instruct-2507
|
| 8 |
+
library_name: tinker
|
| 9 |
+
---
|
| 10 |
+
|
| 11 |
+
# clawpathy-4b-v2-coding
|
| 12 |
+
|
| 13 |
+
Trained with [Clawpathy](https://github.com/clawpathy) using the Tinker platform.
|
| 14 |
+
|
| 15 |
+
## Training Details
|
| 16 |
+
|
| 17 |
+
| Parameter | Value |
|
| 18 |
+
|---|---|
|
| 19 |
+
| **Base model** | Qwen/Qwen3-4B-Instruct-2507 |
|
| 20 |
+
| **Method** | Supervised Fine-Tuning |
|
| 21 |
+
| **Dataset** | Alibaba-Apsara/Superior-Reasoning-SFT-gpt-oss-120b |
|
| 22 |
+
| **LoRA rank** | 32 |
|
| 23 |
+
| **Learning rate** | 0.00018 |
|
| 24 |
+
| **Steps** | 50 |
|
| 25 |
+
| **Final loss** | 0.356419 |
|
| 26 |
+
| **Tinker sampler path** | `tinker://d2b68c3d-145e-552e-9804-57f662d4c543:train:0/sampler_weights/clawpathy-a2902b1a-841-final` |
|
| 27 |
+
| **Tinker state path** | `tinker://d2b68c3d-145e-552e-9804-57f662d4c543:train:0/weights/clawpathy-a2902b1a-841-state` |
|
| 28 |
+
|
| 29 |
+
## Evaluation
|
| 30 |
+
|
| 31 |
+
{
|
| 32 |
+
"job_id": "a2902b1a-841",
|
| 33 |
+
"model": "Trained: Qwen/Qwen3-4B-Instruct-2507 (job a2902b1a-841)",
|
| 34 |
+
"eval_type": "benchmark",
|
| 35 |
+
"benchmarks": [
|
| 36 |
+
"Dataset SFT-match (50)",
|
| 37 |
+
"MMLU (0-shot, 200)"
|
| 38 |
+
],
|
| 39 |
+
"benchmark_names": [
|
| 40 |
+
"Dataset SFT-match (50)",
|
| 41 |
+
"MMLU (0-shot, 200)"
|
| 42 |
+
],
|
| 43 |
+
"domain": "general",
|
| 44 |
+
"accuracy": 0.455,
|
| 45 |
+
"metrics": {
|
| 46 |
+
"dataset_sft_match/token_f1": 0.0756,
|
| 47 |
+
"dataset_sft_match/exact_match": 0.0,
|
| 48 |
+
"dataset_sft_match/evaluated": 50,
|
| 49 |
+
"dataset_sft_match/split": "train",
|
| 50 |
+
"dataset_sft_match/format": "instruction",
|
| 51 |
+
"dataset_sft_match/examples": [
|
| 52 |
+
{
|
| 53 |
+
"expected": "<think>\nWe need to parse the problem: \"Find the sum of the first six terms of an arithmetic sequence in which the sum of any number of terms is equal to four times the square of th",
|
| 54 |
+
"output": "</think>\n\nWe need to parse the problem: \"Find the sum of the first six terms of an arithmetic sequence in which the sum of any number of terms is equal to four times the square of ",
|
| 55 |
+
"token_f1": 0.184,
|
| 56 |
+
"exact": false
|
| 57 |
+
},
|
| 58 |
+
{
|
| 59 |
+
"expected": "<think>\nWe need to compute S = sum_{n=1}^{\u221e} 1/(n * sinh(n\u03c0))^2, i.e., sum_{n=1}\u221e 1/(n^2 sinh^2(n\u03c0)). Then express it as S = (2/3) A - (11\u03c0^2)/180, where A = sum_{n=1}^{\u221e} (-1)^{n-",
|
| 60 |
+
"output": "</think>\n\nWe need to compute the infinite series:\n\n\\[\nS = \\sum_{n=1}^{\\infty} \\frac{1}{(n \\sinh(n\\pi))^2}\n\\]\n\nand express it in the form:\n\n\\[\nS = \\frac{2}{3}A - \\frac{11\\pi^2}{180}",
|
| 61 |
+
"token_f1": 0.014,
|
| 62 |
+
"exact": false
|
| 63 |
+
},
|
| 64 |
+
{
|
| 65 |
+
"expected": "<think>\nWe need to find the maximum value of:\n\nS = a/(3a^2 + b^2 + 2ac) + b/(3b^2 + c^2 + 2ab) + c/(3c^2 + a^2 + 2bc),\n\nfor positive real numbers a,b,c.\n\nWe need to find sup of S.\n",
|
| 66 |
+
"output": "</think>\n\nWe need to find the maximum of the expression:\n\n\\[\nS = \\frac{a}{3a^2 + b^2 + 2ac} + \\frac{b}{3b^2 + c^2 + 2ab} + \\frac{c}{3c^2 + a^2 + 2bc}\n\\]\n\nfor positive real numbers ",
|
| 67 |
+
"token_f1": 0.0238,
|
| 68 |
+
"exact": false
|
| 69 |
+
},
|
| 70 |
+
{
|
| 71 |
+
"expected": "<think>\nWe need to parse the problem: We have a function f defined as f(x) = (x^2 + a) / (x^2 + x - 1) for all x \u2260 1. And f is continuous everywhere (including at x=1). The denomin",
|
| 72 |
+
"output": "</think>\n\nWe need to find a value of a such that f is continuous at x=1. The function is defined as f(x) = (x^2 + a)/(x^2 + x - 1) for x \u2260 1. At x=1, the denominator is 1^2 + 1 - 1",
|
| 73 |
+
"token_f1": 0.0912,
|
| 74 |
+
"exact": false
|
| 75 |
+
},
|
| 76 |
+
{
|
| 77 |
+
"expected": "<think>\nWe need to \"Sketch the curve y = x / (1 + x^6 (sin x)^2)\". This is a request for a description of the graph, not a precise plot. The answer should be a description: key fea",
|
| 78 |
+
"output": "</think>\nWe need to sketch the curve y = x / (1 + x^6 sin^2 x). The user says \"Sketch the curve\" and \"Let's think step by step and output the final answer within \\boxed{}.\" So they",
|
| 79 |
+
"token_f1": 0.0556,
|
| 80 |
+
"exact": false
|
| 81 |
+
},
|
| 82 |
+
{
|
| 83 |
+
"expected": "<think>\nWe need to solve the equation \\([ \\frac{2x^2}{x^2 + 1} ] = x\\). Here [a] denotes floor function (greatest integer \u2264 a). So we need to find real numbers x such that floor of",
|
| 84 |
+
"output": "</think>\n\nWe need to solve the equation:\n\n\\[\n\\left[\\frac{2x^2}{x^2 + 1}\\right] = x,\n\\]\n\nwhere \\([a]\\) denotes the floor function (largest integer \u2264 a). So we need integer x such th",
|
| 85 |
+
"token_f1": 0.1606,
|
| 86 |
+
"exact": false
|
| 87 |
+
},
|
| 88 |
+
{
|
| 89 |
+
"expected": "<think>\nWe need to prove that if a polynomial f(x) = x^4 + a1 x^3 + a2 x^2 + a3 x + a4 has a root x0, and also its derivative f'(x) = 4x^3 + 3 a1 x^2 + 2 a2 x + a3 vanishes at x0, ",
|
| 90 |
+
"output": "</think>\n\nWe need to prove that if a quartic polynomial \\(P(x) = x^4 + a_1 x^3 + a_2 x^2 + a_3 x + a_4\\) satisfies both:\n\n\\[\nP(x_0) = 0 \\quad\\text{and}\\quad P'(x_0) = 0,\n\\]\n\nthen \\",
|
| 91 |
+
"token_f1": 0.0801,
|
| 92 |
+
"exact": false
|
| 93 |
+
},
|
| 94 |
+
{
|
| 95 |
+
"expected": "<think>\nWe need to find all n such that for any integer matrices X, Y of size n\u00d7n, if X^{2021}=I_n and Y^{2021}=-I_n, then X and Y must commute: XY = YX. Equivalent: The condition ",
|
| 96 |
+
"output": "</think>\n\nWe need to find all n such that for every X, Y in M_n(Z) (n x n integer matrices) satisfying X^2021 = I_n and Y^2021 = -I_n, we have XY = YX.\n\nInterpretation: For each n,",
|
| 97 |
+
"token_f1": 0.0124,
|
| 98 |
+
"exact": false
|
| 99 |
+
},
|
| 100 |
+
{
|
| 101 |
+
"expected": "<think>\nWe need to determine the maximum total number of real roots among three quadratics: \n\nP1(x) = a x^2 + b x + c\nP2(x) = b x^2 + c x + a\nP3(x) = c x^2 + a x + b\n\nwhere a,b,c >",
|
| 102 |
+
"output": "</think>\n\nWe need to find the maximum total number of real roots among the three quadratic polynomials:\n\nP1(x) = a x^2 + b x + c\nP2(x) = b x^2 + c x + a\nP3(x) = c x^2 + a x + b\n\nwh",
|
| 103 |
+
"token_f1": 0.0619,
|
| 104 |
+
"exact": false
|
| 105 |
+
},
|
| 106 |
+
{
|
| 107 |
+
"expected": "<think>\nWe need to find the area of triangle ABC given points in 3D space: A = (4,0,0), B = (0,3,0), C = (0,0,5). The area of triangle with vertices at points is half the magnitude",
|
| 108 |
+
"output": "</think>\n\nWe need to compute the area of triangle ABC with vertices A=(4,0,0), B=(0,3,0), C=(0,0,5). This is a triangle in 3D space. The area of a triangle given three points can b",
|
| 109 |
+
"token_f1": 0.1399,
|
| 110 |
+
"exact": false
|
| 111 |
+
}
|
| 112 |
+
],
|
| 113 |
+
"mmlu/accuracy": 0.455,
|
| 114 |
+
"mmlu/evaluated": 200,
|
| 115 |
+
"mmlu/correct": 91,
|
| 116 |
+
"mmlu/split": "validation",
|
| 117 |
+
"mmlu/limit": 200,
|
| 118 |
+
"mmlu/examples": [
|
| 119 |
+
{
|
| 120 |
+
"question": "The cyclic subgroup of Z_24 generated by 18 has order",
|
| 121 |
+
"gold": "A",
|
| 122 |
+
"pred": "",
|
| 123 |
+
"raw": "The cyclic subgroup of Z_24 generated by 18 is the set of all integer multiples ",
|
| 124 |
+
"correct": false
|
| 125 |
+
},
|
| 126 |
+
{
|
| 127 |
+
"question": "Find the order of the factor group Z_6/<3>.",
|
| 128 |
+
"gold": "B",
|
| 129 |
+
"pred": "C",
|
| 130 |
+
"raw": "The factor group Z_6/<3> is the quotient group of Z_6 by the subgroup generated ",
|
| 131 |
+
"correct": false
|
| 132 |
+
},
|
| 133 |
+
{
|
| 134 |
+
"question": "Statement 1 | A permutation that is a product of m even permutations and n odd permutations is an even permutation if and only if n is even. Statement 2 | Every",
|
| 135 |
+
"gold": "A",
|
| 136 |
+
"pred": "",
|
| 137 |
+
"raw": "",
|
| 138 |
+
"correct": false
|
| 139 |
+
},
|
| 140 |
+
{
|
| 141 |
+
"question": "Find the order of the factor group (Z_4 x Z_12)/(<2> x <2>)",
|
| 142 |
+
"gold": "C",
|
| 143 |
+
"pred": "B",
|
| 144 |
+
"raw": "We need to find the order of the factor group (Z_4 x Z_12)/(<2> x <2>).\n\nFirst, ",
|
| 145 |
+
"correct": false
|
| 146 |
+
},
|
| 147 |
+
{
|
| 148 |
+
"question": "Find the maximum possible order for some element of Z_4 x Z_6.",
|
| 149 |
+
"gold": "C",
|
| 150 |
+
"pred": "C",
|
| 151 |
+
"raw": "The maximum possible order of an element in Z_4 x Z_6 is lcm(4,6) = 12. So answe",
|
| 152 |
+
"correct": true
|
| 153 |
+
},
|
| 154 |
+
{
|
| 155 |
+
"question": "Statement 1 | The symmetric group S_3 is cyclic. Statement 2 | Every group is isomorphic to some group of permutations.",
|
| 156 |
+
"gold": "D",
|
| 157 |
+
"pred": "A",
|
| 158 |
+
"raw": "The symmetric group S_3 is the group of all permutations of 3 elements. It has o",
|
| 159 |
+
"correct": false
|
| 160 |
+
},
|
| 161 |
+
{
|
| 162 |
+
"question": "Statement 1 | If a and b are elements of finite order in an Abelian group, then |ab| is the lcm (|a|,|b|). Statement 2 | If g is a group element and g^n = e, th",
|
| 163 |
+
"gold": "B",
|
| 164 |
+
"pred": "A",
|
| 165 |
+
"raw": "We need to evaluate the two statements.\n\nStatement 1: If a and b are elements of",
|
| 166 |
+
"correct": false
|
| 167 |
+
},
|
| 168 |
+
{
|
| 169 |
+
"question": "Statement 1 | If f is a homomorphism from G to K and H is normal in G then f(H) is normal in K. Statement 2 | If f is a homomorphism from G to a group and H is ",
|
| 170 |
+
"gold": "D",
|
| 171 |
+
"pred": "",
|
| 172 |
+
"raw": "",
|
| 173 |
+
"correct": false
|
| 174 |
+
},
|
| 175 |
+
{
|
| 176 |
+
"question": "Find the maximum possible order for an element of S_n for n = 7.",
|
| 177 |
+
"gold": "B",
|
| 178 |
+
"pred": "A",
|
| 179 |
+
"raw": "The maximum possible order of an element in the symmetric group S_n is the least",
|
| 180 |
+
"correct": false
|
| 181 |
+
},
|
| 182 |
+
{
|
| 183 |
+
"question": "Statement 1 | Every integral domain has a field of quotients. Statement 2 | A polynomial of degree n over a ring can have at most n zeros counting multiplicity.",
|
| 184 |
+
"gold": "C",
|
| 185 |
+
"pred": "",
|
| 186 |
+
"raw": "",
|
| 187 |
+
"correct": false
|
| 188 |
+
}
|
| 189 |
+
]
|
| 190 |
+
},
|
| 191 |
+
"results": [
|
| 192 |
+
{
|
| 193 |
+
"benchmark": "dataset_sft_match/token_f1",
|
| 194 |
+
"score": 0.0756
|
| 195 |
+
},
|
| 196 |
+
{
|
| 197 |
+
"benchmark": "dataset_sft_match/exact_match",
|
| 198 |
+
"score": 0.0
|
| 199 |
+
},
|
| 200 |
+
{
|
| 201 |
+
"benchmark": "dataset_sft_match/evaluated",
|
| 202 |
+
"score": 50.0
|
| 203 |
+
},
|
| 204 |
+
{
|
| 205 |
+
"benchmark": "mmlu/accuracy",
|
| 206 |
+
"score": 0.455
|
| 207 |
+
},
|
| 208 |
+
{
|
| 209 |
+
"benchmark": "mmlu/evaluated",
|
| 210 |
+
"score": 200.0
|
| 211 |
+
},
|
| 212 |
+
{
|
| 213 |
+
"benchmark": "mmlu/correct",
|
| 214 |
+
"score": 91.0
|
| 215 |
+
},
|
| 216 |
+
{
|
| 217 |
+
"benchmark": "mmlu/limit",
|
| 218 |
+
"score": 200.0
|
| 219 |
+
}
|
| 220 |
+
],
|
| 221 |
+
"code_eval": null,
|
| 222 |
+
"stored_eval": null,
|
| 223 |
+
"dataset_id": "Alibaba-Apsara/Superior-Reasoning-SFT-gpt-oss-120b",
|
| 224 |
+
"status": "completed",
|
| 225 |
+
"requested_eval_tasks": [],
|
| 226 |
+
"executed_eval_tasks": [
|
| 227 |
+
"dataset_sft_match",
|
| 228 |
+
"internal/mmlu_0_shot"
|
| 229 |
+
],
|
| 230 |
+
"task_errors": {},
|
| 231 |
+
"is_proxy": false,
|
| 232 |
+
"is_complete": true
|
| 233 |
+
}
|
adapter_config.json
ADDED
|
@@ -0,0 +1,31 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{
|
| 2 |
+
"alpha_pattern": {},
|
| 3 |
+
"auto_mapping": null,
|
| 4 |
+
"base_model_name_or_path": null,
|
| 5 |
+
"bias": "none",
|
| 6 |
+
"corda_config": null,
|
| 7 |
+
"eva_config": null,
|
| 8 |
+
"exclude_modules": null,
|
| 9 |
+
"fan_in_fan_out": false,
|
| 10 |
+
"inference_mode": false,
|
| 11 |
+
"init_lora_weights": true,
|
| 12 |
+
"layer_replication": null,
|
| 13 |
+
"layers_pattern": null,
|
| 14 |
+
"layers_to_transform": null,
|
| 15 |
+
"loftq_config": {},
|
| 16 |
+
"lora_alpha": 32,
|
| 17 |
+
"lora_bias": false,
|
| 18 |
+
"lora_dropout": 0,
|
| 19 |
+
"megatron_config": null,
|
| 20 |
+
"megatron_core": "megatron.core",
|
| 21 |
+
"modules_to_save": null,
|
| 22 |
+
"peft_type": "LORA",
|
| 23 |
+
"r": 32,
|
| 24 |
+
"rank_pattern": {},
|
| 25 |
+
"revision": null,
|
| 26 |
+
"target_modules": "all-linear",
|
| 27 |
+
"task_type": "CAUSAL_LM",
|
| 28 |
+
"trainable_token_indices": null,
|
| 29 |
+
"use_dora": false,
|
| 30 |
+
"use_rslora": false
|
| 31 |
+
}
|
adapter_model.safetensors
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:4e43ec1e481fd18c0b639b4a2d648c6b6b72c58a85f3e853d985b5ae7f44c0b0
|
| 3 |
+
size 284084608
|
checkpoint_complete
ADDED
|
File without changes
|