The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
Error code: DatasetGenerationError
Exception: CastError
Message: Couldn't cast
aime24: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double, pass8: double (... 17 chars omitted)
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
child 5, pass8: double
child 6, pass16: double
aime25: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double, pass8: double (... 17 chars omitted)
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
child 5, pass8: double
child 6, pass16: double
amc23: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double, pass8: double (... 17 chars omitted)
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
child 5, pass8: double
child 6, pass16: double
math500: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double>
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
minerva: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double>
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
olympiadbench: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double>
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
samples: list<item: string>
child 0, item: string
problem: string
answer: string
ntok: list<item: int64>
child 0, item: int64
finish: list<item: string>
child 0, item: string
to
{'problem': Value('string'), 'answer': Value('string'), 'samples': List(Value('string')), 'finish': List(Value('string')), 'ntok': List(Value('int64'))}
because column names don't match
Traceback: Traceback (most recent call last):
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1835, in _prepare_split_single
for key, table in generator:
^^^^^^^^^
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 621, in wrapped
for item in generator(*args, **kwargs):
~~~~~~~~~^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/packaged_modules/json/json.py", line 361, in _generate_tables
self._cast_table(pa_table, json_field_paths=json_field_paths),
~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/packaged_modules/json/json.py", line 132, in _cast_table
pa_table = table_cast(pa_table, self.info.features.arrow_schema)
File "/usr/local/lib/python3.14/site-packages/datasets/table.py", line 2381, in table_cast
return cast_table_to_schema(table, schema)
File "/usr/local/lib/python3.14/site-packages/datasets/table.py", line 2309, in cast_table_to_schema
raise CastError(
...<3 lines>...
)
datasets.table.CastError: Couldn't cast
aime24: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double, pass8: double (... 17 chars omitted)
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
child 5, pass8: double
child 6, pass16: double
aime25: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double, pass8: double (... 17 chars omitted)
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
child 5, pass8: double
child 6, pass16: double
amc23: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double, pass8: double (... 17 chars omitted)
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
child 5, pass8: double
child 6, pass16: double
math500: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double>
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
minerva: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double>
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
olympiadbench: struct<pass1: double, n: int64, mean_tokens: double, truncated: double, pass4: double>
child 0, pass1: double
child 1, n: int64
child 2, mean_tokens: double
child 3, truncated: double
child 4, pass4: double
samples: list<item: string>
child 0, item: string
problem: string
answer: string
ntok: list<item: int64>
child 0, item: int64
finish: list<item: string>
child 0, item: string
to
{'problem': Value('string'), 'answer': Value('string'), 'samples': List(Value('string')), 'finish': List(Value('string')), 'ntok': List(Value('int64'))}
because column names don't match
The above exception was the direct cause of the following exception:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1379, in compute_config_parquet_and_info_response
parquet_operations, partial, estimated_dataset_info = stream_convert_to_parquet(
~~~~~~~~~~~~~~~~~~~~~~~~~^
builder, max_dataset_size_bytes=max_dataset_size_bytes
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
)
^
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 956, in stream_convert_to_parquet
builder._prepare_split(split_generator=splits_generators[split], file_format="parquet")
~~~~~~~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1702, in _prepare_split
for job_id, done, content in self._prepare_split_single(
~~~~~~~~~~~~~~~~~~~~~~~~~~^
gen_kwargs=gen_kwargs, job_id=job_id, **_prepare_split_args
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
):
^
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1887, in _prepare_split_single
raise DatasetGenerationError("An error occurred while generating the dataset") from e
datasets.exceptions.DatasetGenerationError: An error occurred while generating the datasetNeed help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
problem string | answer string | samples list | finish list | ntok list |
|---|---|---|---|---|
Every morning Aya goes for a $9$-kilometer-long walk and stops at a coffee shop afterwards. When she walks at a constant speed of $s$ kilometers per hour, the walk takes her 4 hours, including $t$ minutes spent in the coffee shop. When she walks $s+2$ kilometers per hour, the walk takes her 2 hours and 24 minutes, incl... | 204 | [
"Let $w$ be the time Aya spends walking in hours. Given that she walks at a speed of $s$ km/h for 4 hours, we have:\n\\[ s = \\frac{9}{4} \\text{ km/h} \\]\n\\[ w = 4 \\text{ hours} \\]\n\nWhen walking at $s + 2$ km/h for 2 hours and 24 minutes (which is 2.4 hours in decimal form), we have:\n\\[ s + 2 = \\frac{9}{2... | [
"stop",
"stop",
"stop",
"length",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop"
] | [
376,
455,
547,
4096,
1024,
502,
454,
266,
495,
340,
420,
473,
638,
877,
834,
531
] |
Let $ABC$ be a triangle inscribed in circle $\omega$. Let the tangents to $\omega$ at $B$ and $C$ intersect at point $D$, and let $\overline{AD}$ intersect $\omega$ at $P$. If $AB=5$, $BC=9$, and $AC=10$, $AP$ can be written as the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime integers. Find $m + n$. | 113 | [
"By Ptolemy's Theorem for cyclic quadrilateral $ABPC$, we have:\n\\[ AB \\cdot PC + AC \\cdot PB = AP \\cdot BC. \\]\nThis gives us:\n\\[ 5 \\cdot PC + 10 \\cdot PB = AP \\cdot 9. \\]\nLet $AP = x$, then:\n\\[ 5 \\cdot PC + 10 \\cdot PB = 9x. \\]\n\nUsing the Angle Bisector Theorem in $\\triangle APD$, we have:\n\\... | [
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"length",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop"
] | [
617,
886,
291,
511,
452,
162,
388,
153,
4096,
313,
444,
558,
276,
562,
661,
779
] |
Each vertex of a regular octagon is independently colored either red or blue with equal probability. The probability that the octagon can then be rotated so that all of the blue vertices end up at positions where there were originally red vertices is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integ... | 371 | [
"- **Case 1**: 0 blue vertices. The probability of this happening is $\\left(\\frac{1}{2}\\right)^8 = \\frac{1}{256}$.\n- **Case 2**: 4 blue vertices. There are $\\binom{8}{4} = 70$ ways to choose which vertices are blue. The probability that the octagon can be rotated such that blue vertices are at positions of re... | [
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop"
] | [
520,
493,
524,
219,
461,
278,
550,
231,
386,
355,
408,
478,
330,
355,
561,
383
] |
Define $f(x)=|| x|-\tfrac{1}{2}|$ and $g(x)=|| x|-\tfrac{1}{4}|$. Find the number of intersections of the graphs of \[y=4 g(f(\sin (2 \pi x))) \quad\text{ and }\quad x=4 g(f(\cos (3 \pi y))).\] | 385 | [
"First, we analyze the function $f(x) = ||x| - \\tfrac{1}{2}|$. The function $f(x)$ is defined piecewise as:\n\\[\nf(x) = \n\\begin{cases} \n\\tfrac{1}{2} - x & \\text{if } x \\geq \\tfrac{1}{2}, \\\\\nx - \\tfrac{1}{2} & \\text{if } x < \\tfrac{1}{2}.\n\\end{cases}\n\\]\nThis function is symmetric about $x = \\tfr... | [
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop"
] | [
694,
563,
813,
658,
815,
572,
576,
1061,
666,
1199,
578,
779,
529,
599,
775,
905
] |
Let $p$ be the least prime number for which there exists a positive integer $n$ such that $n^{4}+1$ is divisible by $p^{2}$. Find the least positive integer $m$ such that $m^{4}+1$ is divisible by $p^{2}$. | 110 | [
"\n1. **Identify the given conditions**: We need to find the smallest prime number \\( p \\) such that there exists a positive integer \\( n \\) for which \\( n^4 + 1 \\) is divisible by \\( p^2 \\).\n\n2. **Check the smallest primes**: Start with the smallest prime numbers and verify if they satisfy the condition.... | [
"stop",
"length",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"stop",
"length",
"stop",
"stop",
"length"
] | [
1236,
4096,
989,
2302,
1350,
1491,
1486,
668,
1169,
1594,
1713,
947,
4096,
1888,
1518,
4096
] |
"Let $ABCD$ be a tetrahedron such that $AB=CD= \\sqrt{41}$, $AC=BD= \\sqrt{80}$, and $BC=AD= \\sqrt{(...TRUNCATED) | 104 | ["Let $a$, $b$, and $c$ be the areas of triangles $ABC$, $ACD$, and $BCD$, respectively. We use the (...TRUNCATED) | ["stop","stop","stop","stop","stop","stop","stop","length","stop","stop","length","stop","stop","sto(...TRUNCATED) | [
564,
666,
405,
421,
201,
797,
1554,
4096,
738,
738,
4096,
749,
748,
501,
1132,
558
] |
"Let $\\mathcal{B}$ be the set of rectangular boxes with surface area $54$ and volume $23$. Let $r$ (...TRUNCATED) | 721 | ["Let the dimensions of the box be $a$, $b$, and $c$. Then the surface area and volume of the box ar(...TRUNCATED) | ["stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","length","stop"(...TRUNCATED) | [
471,
781,
402,
504,
422,
560,
400,
468,
477,
640,
353,
375,
4096,
460,
390,
313
] |
"There exist real numbers $x$ and $y$, both greater than 1, such that $\\log_x\\left(y^x\\right)=\\l(...TRUNCATED) | 025 | ["Let $u = \\log_x(y^x)$ and $v = \\log_y(x^{4y})$. We know that $u = v = 10$. Using the change of b(...TRUNCATED) | ["stop","stop","stop","stop","stop","length","stop","stop","stop","stop","stop","stop","stop","stop"(...TRUNCATED) | [
398,
525,
364,
280,
721,
4096,
267,
416,
705,
401,
190,
211,
382,
262,
498,
719
] |
"Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take tur(...TRUNCATED) | 809 | ["\n1. **Understanding the Problem:**\n Alice and Bob play a game where a pile of \\( n \\) tokens(...TRUNCATED) | ["stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","(...TRUNCATED) | [
718,
981,
406,
609,
627,
566,
1337,
752,
914,
681,
546,
1396,
792,
551,
785,
1171
] |
"Jen enters a lottery by picking $4$ distinct numbers from $S=\\{1,2,3,\\cdots,9,10\\}.$ $4$ numbers(...TRUNCATED) | 116 | ["Define the events:\n- $A$: Jen wins a prize (at least two numbers match the randomly chosen number(...TRUNCATED) | ["stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","stop","(...TRUNCATED) | [
582,
430,
433,
451,
466,
437,
428,
317,
527,
576,
322,
667,
490,
501,
367,
480
] |
AdaptiveSFT: baseline SFT-loss runs
Full fine-tuning runs of seven token-level SFT objectives (and the untrained base model) swept over learning rates, with their checkpoints, training logs, sampled eval outputs and scores, plus the exact training and eval sets. Code: https://github.com/jiarui-liu/adaptive-reasoning-loss (framework arl/, the commit of each run is in the tables).
Layout
data/sft/v1/<set>.jsonl training sets ({prompt, response[, source]})
data/sft/v1/eval_sets/<bench>.jsonl eval sets ({problem, answer, kind, ...})
runs/<grid>/<method>_lr<lr>/
final/ checkpoint (safetensors + tokenizer), loads with transformers / vLLM
args.json all training arguments
train_log.jsonl one row per optimizer step: loss, nll, grad norm, lr, tokens, method statistics
train.log, eval.log raw stdout of training / evaluation
train.sbatch, eval.sbatch the exact slurm scripts that produced the run
eval/<bench>.jsonl every sample per eval problem, finish reasons, token counts
eval/scores.json pass@1 / pass@k, mean length, truncation rate per bench
base rows evaluate the untrained starting model (no final/). Data builders: experiments/data/ (build_sets.py for the math sets, build_tulu.py for the Tulu subset and IFEval / GSM8K / MMLU / HumanEval+). Prompt formats: math sets use Problem: {prompt}\n\nSolution:\n; tulu3_50k uses <|user|>\n{prompt}\n<|assistant|>\n (arl/data.py).
Methods
| method | per-token objective |
|---|---|
| nll | standard cross-entropy |
| dft | NLL weighted by the model's own (stop-gradient) probability of the target token |
| focal | focal loss, down-weights tokens the model is already confident on |
| trimsft | NLL with part of the tokens trimmed from the loss |
| prift | weights from the frozen starting model's probabilities (mode mass) |
| asft | DFT weighting plus a KL anchor to the frozen starting model |
| psft | PPO-style clipped ratio against the model a few steps ago (reference refreshed every 4 steps) |
Scores are pass@1 in % (mean over samples). Runs appear here once their evaluation has finished.
s1_numina_q17
math reasoning distillation: Qwen3-1.7B-Base on numina_cot_20k (20k NuminaMath-CoT problems, one CoT solution each), 3 epochs, 64 seqs/step, max 4096 tokens; eval on math benchmarks
| run | method | model | lr | method args | aime24 | aime25 | amc23 | math500 | minerva | olympiadbench | code commit |
|---|---|---|---|---|---|---|---|---|---|---|---|
nll_lr5e-6 |
nll | Qwen3-1.7B-Base | 5e-06 | {} |
1.7 | 1.9 | 26.6 | 52.5 | 17.9 | 22.6 | 28b0306 (inferred from start time) |
nll_lr1e-5 |
nll | Qwen3-1.7B-Base | 1e-05 | {} |
1.7 | 1.0 | 27.0 | 52.8 | 17.6 | 22.4 | 28b0306 (inferred from start time) |
nll_lr2e-5 |
nll | Qwen3-1.7B-Base | 2e-05 | {} |
1.0 | 2.1 | 26.9 | 50.0 | 16.5 | 21.7 | 28b0306 (inferred from start time) |
nll_lr5e-5 |
nll | Qwen3-1.7B-Base | 5e-05 | {} |
1.0 | 0.8 | 22.8 | 47.0 | 16.2 | 17.8 | 28b0306 (inferred from start time) |
Sources and licenses
Base model: Qwen/Qwen3-1.7B-Base (Apache-2.0). Training data are subsets of AI-MO/NuminaMath-CoT, open-r1/OpenR1-Math-220k and allenai/tulu-3-sft-mixture (ODC-BY; sub-sources keep their own licenses). Eval sets: MATH-500, Minerva Math, OlympiadBench, AMC23, AIME24/25, IFEval, GSM8K, MMLU, HumanEval+.
- Downloads last month
- 48