Dataset Viewer
Auto-converted to Parquet Duplicate
question
stringlengths
675
690
answer
stringclasses
1 value
task_config
stringclasses
1 value
task_source
stringclasses
1 value
prompt
listlengths
1
1
model_responses
listlengths
0
0
model_responses__eval_is_correct
listlengths
0
0
all_other_columns
stringlengths
125
128
original_split
stringclasses
1 value
length
int64
5
8
letters
stringlengths
5
8
source
stringlengths
5
5
model_responses__best_of_n_atags
listlengths
4
4
model_responses__best_of_n_atags__finish_reason_length_flags
listlengths
4
4
model_responses__best_of_n_atags__length_partial_responses
listlengths
4
4
prompt__best_of_n_atags__metadata
dict
model_responses__best_of_n_atags__metadata
dict
model_responses__best_of_n_atags__eval_is_correct
listlengths
4
4
model_responses__best_of_n_atags__eval_extracted_answers
listlengths
4
4
model_responses__best_of_n_atags__eval_extraction_metadata
stringlengths
235
594
model_responses__best_of_n_atags__eval_evaluation_metadata
stringlengths
296
530
model_responses__best_of_n_atags__internal_answers__eval_is_correct
listlengths
4
4
model_responses__best_of_n_atags__internal_answers__eval_extracted_answers
listlengths
4
4
model_responses__best_of_n_atags__internal_answers__eval_extraction_metadata
stringlengths
383
19.6k
model_responses__best_of_n_atags__internal_answers__eval_evaluation_metadata
stringlengths
161
9.96k
model_responses__best_of_n_atags__metrics
dict
eval_date
stringdate
2025-11-27 00:00:00
2025-11-27 00:00:00
split
stringclasses
1 value
revision_name
stringclasses
1 value
model_path
stringclasses
1 value
checkpoint_step
int64
0
0
stage_name
stringclasses
1 value
stage_number
int64
1
1
timestamp
stringdate
2025-11-27 22:28:37
2025-11-27 22:28:37
eval_repo_id
stringclasses
1 value
Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>. ### Problem Given a list of letters, rearrange the letters to create a valid English word. You should satisfy the following conditions: 1) Only use the lette...
letter_countdown_5o
letter_countdown
[ { "content": "Answer the following problem. Explain your reasoning step by step. When you are finished, give your answer in this format: <answer> (your answer) </answer>.\n\n ### Problem\n\n\nGiven a list of letters, rearrange the letters to create a valid English word. You should satisfy the following conditi...
[]
[]
{"letters": "tansd", "source": "stand", "length": 5, "task_config": "letter_countdown_5o", "task_source": "letter_countdown"}
test
5
tansd
stand
[ "<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed using only the given letters and is at least 5 characters long.\n\nThe input letters are: ['t', 'a', 'n', 's', 'd']\n\nLet's try to form words step-by-step:\n1. Check if \"stand\" can be formed: The letters available ...
[ false, false, false, false ]
[ "", "", "", "" ]
{ "api_url": "http://10.32.36.237:9080/v1", "backend": "litellm", "chat_template_applied": true, "generation_params": { "chat_template_applied": true, "max_tokens": 16384, "n": 1, "repetition_penalty": 1.1, "temperature": 0.7, "top_k": 20, "top_p": 0.8 }, "model_name": "hosted_vl...
{ "backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100", "n_responses": 4 }
[ true, true, false, true ]
[ "stand", "stand", "sandy", "stand" ]
[{"extraction_type": "final", "total_spans_found": 5, "non_overlapping_spans": 5, "span_start": 5399, "span_end": 5406, "original_span": "stand"}, {"extraction_type": "final", "total_spans_found": 2, "non_overlapping_spans": 2, "span_start": 2623, "span_end": 2630, "original_span": "stand"}, {"extraction_type": "final"...
[{"is_correct": true, "final_answer": "stand", "errors": "", "length": 5}, {"is_correct": true, "final_answer": "stand", "errors": "", "length": 5}, {"is_correct": false, "final_answer": "sandy", "errors": "cannot_be_formed_from_letters", "length": 5}, {"is_correct": true, "final_answer": "stand", "errors": "", "length...
[ [ false, false, true, true, true ], [ false, true ], [ false ], [ true, true, true ] ]
[ [ "sand", "sand", "stand", "stand", "stand" ], [ "sand", "stand" ], [ "sandy" ], [ "stand", "stand", "stand" ] ]
[[{"pattern_used": "answer tag", "confidence": 1.0, "position": 1451, "span_text": "sand", "extraction_type": "internal", "span_start": 1451, "span_end": 1457, "original_span": "sand"}, {"pattern_used": "answer tag", "confidence": 1.0, "position": 3027, "span_text": "sand", "extraction_type": "internal", "span_start": ...
[[{"is_correct": false, "final_answer": "sand", "errors": "length_constraint_violated", "length": 4}, {"is_correct": false, "final_answer": "sand", "errors": "length_constraint_violated", "length": 4}, {"is_correct": true, "final_answer": "stand", "errors": "", "length": 5}, {"is_correct": true, "final_answer": "stand"...
{ "flips_by": [ 0, 0, 0, 0 ], "flips_total": 0, "num_correct": 3, "pass_at_n": 1, "percent_correct": 0.75, "total_responses": 4 }
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241134
TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o-eval_rl
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"ftusf\", \"source\": \"stuff\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
ftusf
stuff
["<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ false, false, false, false ]
[ "fast", "funds", "funds", "funds" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 6, \"non_overlapping_spans\": 6, \"span_st(...TRUNCATED)
"[{\"is_correct\": false, \"final_answer\": \"fast\", \"errors\": \"length_constraint_violated, cann(...TRUNCATED)
[[false,false,false,false,false,false],[false,false,false,false,false],[false,false,false,false,fals(...TRUNCATED)
[["fast","fasts","fast","fast","fast","fast"],["fish","fists","funds","funds","funds"],["fuss","fund(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 926, \"span_text\": \"fast\(...TRUNCATED)
"[[{\"is_correct\": false, \"final_answer\": \"fast\", \"errors\": \"length_constraint_violated, can(...TRUNCATED)
{"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"total_res(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241144
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"daidv\", \"source\": \"david\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
daidv
david
["<think>\n<sample>\nTo solve this problem, we need to form the longest possible valid English word (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ true, true, true, false ]
[ "david", "david", "david", "avid" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 6, \"non_overlapping_spans\": 6, \"span_st(...TRUNCATED)
"[{\"is_correct\": true, \"final_answer\": \"david\", \"errors\": \"\", \"length\": 5}, {\"is_correc(...TRUNCATED)
[[true,true,true,false,true,true],[false,false,false,true,false,false,false,true,true],[true,true,tr(...TRUNCATED)
[["david","david","david","avid","david","david"],["vids","avid","vids","david","davids","avid","did(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 956, \"span_text\": \"david(...TRUNCATED)
"[[{\"is_correct\": true, \"final_answer\": \"david\", \"errors\": \"\", \"length\": 5}, {\"is_corre(...TRUNCATED)
{"flips_by":[1,1,0,1],"flips_total":3,"num_correct":3,"pass_at_n":1,"percent_correct":0.75,"total_re(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241147
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"viedr\", \"source\": \"drive\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
viedr
drive
["<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ false, false, true, false ]
[ "dive", "drier", "drive", "dive" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 8, \"non_overlapping_spans\": 8, \"span_st(...TRUNCATED)
"[{\"is_correct\": false, \"final_answer\": \"dive\", \"errors\": \"length_constraint_violated\", \"(...TRUNCATED)
[[false,false,false,false,false,true,false,false],[false,false,false],[false,false,true,true,true],[(...TRUNCATED)
[["vider","river","dive","dive","red","diver","dive","dive"],["drier","drier","drier"],["vied","rive(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 715, \"span_text\": \"vider(...TRUNCATED)
"[[{\"is_correct\": false, \"final_answer\": \"vider\", \"errors\": \"not_a_valid_word\", \"length\"(...TRUNCATED)
{"flips_by":[1,0,0,0],"flips_total":1,"num_correct":1,"pass_at_n":1,"percent_correct":0.25,"total_re(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241148
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"enreg\", \"source\": \"green\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
enreg
green
["<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ false, true, true, false ]
[ "regen", "reneg", "genre", "regen" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 6, \"non_overlapping_spans\": 6, \"span_st(...TRUNCATED)
"[{\"is_correct\": false, \"final_answer\": \"regen\", \"errors\": \"not_a_valid_word\", \"length\":(...TRUNCATED)
[[false,false,true,false,false,false],[true,true,true,true],[true,false,true,false,false,true,true,t(...TRUNCATED)
[["regen","regen","reneg","energ","regen","regen"],["reneg","reneg","reneg","reneg"],["genre","gerne(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 808, \"span_text\": \"regen(...TRUNCATED)
"[[{\"is_correct\": false, \"final_answer\": \"regen\", \"errors\": \"not_a_valid_word\", \"length\"(...TRUNCATED)
{"flips_by":[1,0,2,0],"flips_total":3,"num_correct":2,"pass_at_n":1,"percent_correct":0.5,"total_res(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241150
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"chtma\", \"source\": \"match\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
chtma
match
["<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ false, false, false, false ]
[ "math", "chat", "chmod", "chart" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 10, \"non_overlapping_spans\": 10, \"span_(...TRUNCATED)
"[{\"is_correct\": false, \"final_answer\": \"math\", \"errors\": \"length_constraint_violated\", \"(...TRUNCATED)
[[false,false,false,false,false,false,false,false,false,false],[false],[false,false,false],[false,fa(...TRUNCATED)
[["math","math","math","none","math","chmod","math","chart","math","math"],["chat"],["chmod","charte(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 671, \"span_text\": \"math\(...TRUNCATED)
"[[{\"is_correct\": false, \"final_answer\": \"math\", \"errors\": \"length_constraint_violated\", \(...TRUNCATED)
{"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"total_res(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241151
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"demlo\", \"source\": \"model\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
demlo
model
["<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ false, false, false, false ]
[ "mold", "dome", "molded", "demol" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 3, \"non_overlapping_spans\": 3, \"span_st(...TRUNCATED)
"[{\"is_correct\": false, \"final_answer\": \"mold\", \"errors\": \"length_constraint_violated\", \"(...TRUNCATED)
[[false,false,false],[false,false,false],[false,false,false,false,false],[false,false,false,false,fa(...TRUNCATED)
[["mold","mold","mold"],["dome","dome","dome"],["demol","medal","medal","old","molded"],["demol","de(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 651, \"span_text\": \"mold\(...TRUNCATED)
"[[{\"is_correct\": false, \"final_answer\": \"mold\", \"errors\": \"length_constraint_violated\", \(...TRUNCATED)
{"flips_by":[0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"total_res(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241153
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"rttsu\", \"source\": \"trust\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
rttsu
trust
["<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ false, true, true, false ]
[ "rust", "strut", "trust", "rust" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 5, \"non_overlapping_spans\": 5, \"span_st(...TRUNCATED)
"[{\"is_correct\": false, \"final_answer\": \"rust\", \"errors\": \"length_constraint_violated\", \"(...TRUNCATED)
[[false,true,false,false,false],[true,false,true,false,true,true],[false,true,true,true,true],[false(...TRUNCATED)
[["rust","strut","rust","rust","rust"],["trust","rusty","sturt","rusty","strut","strut"],["rusty","s(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 569, \"span_text\": \"rust\(...TRUNCATED)
"[[{\"is_correct\": false, \"final_answer\": \"rust\", \"errors\": \"length_constraint_violated\", \(...TRUNCATED)
{"flips_by":[1,2,0,1],"flips_total":4,"num_correct":2,"pass_at_n":1,"percent_correct":0.5,"total_res(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241154
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"nraeg\", \"source\": \"range\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
nraeg
range
["<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ true, true, false, true ]
[ "range", "range", "grain", "range" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 4, \"non_overlapping_spans\": 4, \"span_st(...TRUNCATED)
"[{\"is_correct\": true, \"final_answer\": \"range\", \"errors\": \"\", \"length\": 5}, {\"is_correc(...TRUNCATED)
[ [ true, true, true, true ], [ true, true, false, false, true, true ], [ true, false, false ], [ true, true, true ] ]
[["range","range","range","range"],["range","anger","rang","rang","range","range"],["range","rang","(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 919, \"span_text\": \"range(...TRUNCATED)
"[[{\"is_correct\": true, \"final_answer\": \"range\", \"errors\": \"\", \"length\": 5}, {\"is_corre(...TRUNCATED)
{"flips_by":[0,1,1,0],"flips_total":2,"num_correct":3,"pass_at_n":1,"percent_correct":0.75,"total_re(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241156
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
"Answer the following problem. Explain your reasoning step by step. When you are finished, give your(...TRUNCATED)
letter_countdown_5o
letter_countdown
[{"content":"Answer the following problem. Explain your reasoning step by step. When you are finishe(...TRUNCATED)
[]
[]
"{\"letters\": \"reatd\", \"source\": \"trade\", \"length\": 5, \"task_config\": \"letter_countdown_(...TRUNCATED)
test
5
reatd
trade
["<think>\n<sample>\nTo solve this problem, we need to find a valid English word that can be formed (...TRUNCATED)
[ false, false, false, false ]
[ "", "", "", "" ]
{"api_url":"http://10.32.36.237:9080/v1","backend":"litellm","chat_template_applied":true,"generatio(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@check(...TRUNCATED)
[ true, true, true, false ]
[ "rated", "rated", "tared", "read" ]
"[{\"extraction_type\": \"final\", \"total_spans_found\": 6, \"non_overlapping_spans\": 6, \"span_st(...TRUNCATED)
"[{\"is_correct\": true, \"final_answer\": \"rated\", \"errors\": \"\", \"length\": 5}, {\"is_correc(...TRUNCATED)
[[false,true,true,true,true,true],[true,false,true,true,true],[false,true,false,false,true,true],[tr(...TRUNCATED)
[["read","rated","derat","dater","rated","rated"],["rated","dated","rated","rated","rated"],["read",(...TRUNCATED)
"[[{\"pattern_used\": \"answer tag\", \"confidence\": 1.0, \"position\": 1258, \"span_text\": \"read(...TRUNCATED)
"[[{\"is_correct\": false, \"final_answer\": \"read\", \"errors\": \"length_constraint_violated\", \(...TRUNCATED)
{"flips_by":[0,1,1,1],"flips_total":3,"num_correct":3,"pass_at_n":1,"percent_correct":0.75,"total_re(...TRUNCATED)
2025-11-27
test
main
TAUR-dev/M-1119_newmodels__qwen7b_sft1k_ours-rl@checkpoint-step-100
0
eval_rl
1
2025-11-27T22:28:37.241157
"TAUR-dev/D-EVAL__standard_eval_v3__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdo(...TRUNCATED)
End of preview. Expand in Data Studio

Experiment Tracker: FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o

Experiment Description: Evaluation experiment for task letter_countdown_5o from FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL

Start Time: 2025-11-27T21:30:08.355893

Tracker Dataset: TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1

Stages Completed

Total stages: 1

Models Created

Dataset Configurations

This tracker dataset contains the following configurations with immediate upload as stages complete:

Training Data (Complete Datasets)

Hyperparameters (Complete Configurations)

Logs (Stage-Specific)

Evaluation Results (Complete with Annotations)

Metadata

  • experiment_metadata: Timeline and stage information

Usage

Load specific configurations with:

from datasets import load_dataset

# Load experiment metadata
metadata = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'experiment_metadata')

# Load complete training datasets
sft_data = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'training_data__sft')
sft_metadata = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'training_data__sft_metadata')

# Load complete configurations
sft_hyperparams = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'hyperparameters__sft')
rl_hyperparams = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'hyperparameters__rl')

# Load stage-specific logs
sft_logs = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'logs__sft')
rl_logs = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'logs__rl')

# Load evaluation results with annotations
sft_eval_results = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'evals_eval_sft')
rl_eval_results = load_dataset('TAUR-dev/D-ExpTracker__FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o__v1', 'evals_eval_rl')

Models

Registry

All models from this experiment are automatically registered in the SkillFactory Model Registry with:

  • Complete training configuration (hyperparameters, datasets, methods)
  • Experiment lineage (links back to this tracker dataset)
  • Stage-specific metadata (SFT vs RL training details)
  • Structured input data references (training datasets and configurations)

Registry entries follow the naming pattern: Model - FinEval_16k_fulleval_3arg_OT_ours_1k_atstep100-RL-letter_countdown_5o - {stage_name} - {SFT/RL}


Generated by SkillFactory Experiment Management System All artifacts uploaded immediately as stages complete with perfect data provenance

Downloads last month
3