CLEVR — CLEVR_RS_nothink

Rejection-sampled from the CLEVR train split. This split holds the accepted items, answer only.

rows	126,032
QA pairs	1,934,167
shards	878
accepted / rejected (whole family)	1,934,167 / 74,925
accept rate	96.3%
verifier	alnum

How the data was produced

A VLM answers every question at temperature 0 with reasoning enabled. Its answer is compared with the official ground truth by the verifier described below; matches go to CLEVR_RS_think and CLEVR_RS_nothink, non-matches go to CLEVR_rejected with the ground truth preserved.

The question field is byte-identical to the prompt the model actually received, including any appended instruction, so the stored training text and the inference-time input cannot drift apart.

How a match is decided

alnum — scene-text recognition protocol

The standard evaluation protocol for scene-text recognition (IIIT5K, CUTE80, SVT, IC13/15, WordArt, Total-Text): fold case and drop every non-alphanumeric character from both sides, then require an exact match. "HELLO!", "hello" and "Hello." are therefore the same answer.

The prediction is additionally tried as its first line and its first paragraph, so a model that gives the right answer and then explains anyway is not penalised for the explanation.

Second pass: model-as-judge

String verifiers cannot judge free-form answers at all, and they under-credit answers that are correct but differently phrased. Every item the verifier rejected is therefore re-examined by the same VLM in a text-only pass that sees the question, the reference and the candidate — no image, no re-generation, it only grades text that was already produced.

The judge is instructed to compare against the reference and never to solve the question itself, so an answer is not promoted merely because the model believes it is true. It answers CORRECT, WRONG, or UNSURE; numbers must agree, and UNSURE is reserved for references that are themselves unusable or ambiguous. UNSURE is never counted as correct — only a CORRECT verdict moves a row into the accepted splits. WRONG and UNSURE both remain in the rejected split, so an unresolved case is never silently promoted to a pass.

Calibration: run over items the string verifier had already accepted, the judge agreed on 59/60. Spot-checking its overturns shows it discriminates rather than rubber-stamps — it keeps \frac{L}{n} rejected against a reference of \frac{L}{n-1}, and returns UNSURE when the model argues no finite answer exists against a numeric reference.

Schema

• image — HF Image() — renders directly in the dataset viewer
• qa — list of {question, answer}
• clean_meta — per-row provenance and the cleaning policy that admitted it
• image_sha256 — content hash of the image

Examples

Three rows taken straight from this split. Images are the original files as stored in the dataset, and long fields are shown in full.

Example 1

field	value
question	Question: Is the shape of the tiny red matte object the same as the small blue rubber thing? Answer the question using a single word or phrase.
answer	yes

Example 2

field	value
question	Question: Are there more blue things that are on the left side of the blue cube than big matte blocks that are on the right side of the matte ball? Answer the question using a single word or phrase.
answer	no

Example 3

field	value
question	How many red matte objects have the same size as the brown cube? Answer the question using a single word or phrase.
answer	0.

Cleaning applied before rejection sampling

• Provenance check. Each QA item records where it came from; items whose recorded source does not resolve to the image they are attached to are dropped.
• Task purity. The pool's InfinityMM slice assigns samples to a family by image match rather than by dataset origin, which pulls unrelated general-VQA questions into benchmark families. Families where that content measured off-task keep only their genuine benchmark QA.
• Multiple-choice normalisation. Where options had been flattened into prose, they are re-rendered as a lettered block and the reference is rewritten to the bare letter, so the task is well posed and the answer is unambiguous.