The Y-Test: Fairly Comparing Experimental Setups with Unequal Effort
Bibliographic record
Abstract
Evolutionary Computation has been dogged by a central statistical issue: how does one fairly compare the performance of two techniques which differ in the amount of work required? While Koza's computational effort statistic attempts to answer this problem, it is a point statistic and has other statistical problems. We present the j-test, a statistical test which takes as input a set of outcomes from the observed runs of two processes A and B. The j-test synthetically performs a work-balanced comparison between k runs of A and / runs of B. We show that by choosing k and / appropriately, we can compensate for the fact that one of the processes is computationally more efficient than the other.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.160 | 0.455 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.004 | 0.003 |
| Bibliometrics | 0.004 | 0.004 |
| Science and technology studies | 0.002 | 0.010 |
| Scholarly communication | 0.004 | 0.010 |
| Open science | 0.005 | 0.007 |
| Research integrity | 0.005 | 0.005 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".