Reducing the number of non-naïve participants in Mechanical Turk samples
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Using participants who have been previously exposed to experimental stimuli (referred to as non-naïveté) can reduce effect sizes. The workforce of Amazon's Mechanical Turk is particularly vulnerable to this problem and solutions are usually cost and time inefficient and of mixed effectiveness. In response to this problem and its currently underwhelming solutions, we tested various participant recruitment strategies designed to recruit participants naïve to frequently used experimental stimuli. We collected samples using maximum HIT restrictions (50 for Experiment 1 and 2, 500 for Experiment 2) and TurkPrime's (now CloudResearch) naiveté feature and compared them to samples recruited with standard restrictions (95% HIT approval rating). In these comparisons, we replicated past findings where using nonnaïve (vs. naïve) participants has been shown to reduce effect sizes and affect performance on a variety of tasks (e.g., the Cognitive Reflection Test, a Public Goods Game). We demonstrate that restricting by the maximum number of HITs heavily reduces the number of “experienced” research subjects in samples but necessitates some sacrifice in data quality and collection speed. We discuss the pragmatics of our method, its limitations, and future directions for solving the problem of non-naïveté on Mechanical Turk. For those looking to avoid this issue, we recommend setting a maximum HIT restriction of 50 when recruiting participants.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it