rewirebio.iobenchmarks
Protocol

Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4

Starting from a uniformly sampled seed set shared by all acquisition functions, a model ensemble is retrained each round on the measured pairs acquired so far and an acquisition function picks the next batch; the score counts how many of the screen's 200 strongest measured pairs are among the 200 strongest of the measured-plus-predicted values.

5 evaluations · 152 results

Overview

An explanatory profile has not yet been reviewed for this record.

Consult the linked sources for architecture or protocol details. Missing evidence is not evidence of a missing capability.

5 recorded evaluations, 152 metric rows. A comparison chart has not yet been validated for these results. The table retains the individual findings and their sources.

View coverage and remaining gaps across all benchmarks

Results

Results are available, but no reviewed comparison panel is linked in this release.

All evaluations

5 evaluations · 152 results. Different protocols are not a single leaderboard.

Filter evaluations

Applied filters: All linked evaluations

Exact evaluated configurations and original reported results
Tested configurationProtocol and datasetFindingEvidence and details
Configuration: NAIAD with MPE acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in Jurkat T cells, gene-level viability (as processed by Qin et al. 2025)
23 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with MPE acquisition on Horlbeck Jurkat (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "MPE", column "Horlbeck Jurkat"
Configuration: NAIAD with MPE acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in Jurkat T cells, gene-level viability (as processed by Qin et al. 2025)
161 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with MPE acquisition on Horlbeck Jurkat (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "MPE", column "Horlbeck Jurkat"
Configuration: NAIAD with MPE acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
14.3 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with MPE acquisition on Horlbeck K562 (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "MPE", column "Horlbeck K562"
Configuration: NAIAD with MPE acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
94 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with MPE acquisition on Horlbeck K562 (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "MPE", column "Horlbeck K562"
Configuration: NAIAD with MPE acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Norman et al. 2019 combinatorial CRISPRa in K562, gene-level viability (as processed by Qin et al. 2025)
14 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with MPE acquisition on Norman (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "MPE", column "Norman"
Configuration: NAIAD with MPE acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Norman et al. 2019 combinatorial CRISPRa in K562, gene-level viability (as processed by Qin et al. 2025)
144 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with MPE acquisition on Norman (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "MPE", column "Norman"
Configuration: NAIAD with MPE acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Simpson et al. 2023 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
27 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with MPE acquisition on Simpson (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "MPE", column "Simpson"
Configuration: NAIAD with MPE acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Simpson et al. 2023 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
144 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with MPE acquisition on Simpson (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "MPE", column "Simpson"
Configuration: NAIAD with UCB acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in Jurkat T cells, gene-level viability (as processed by Qin et al. 2025)
12 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with UCB acquisition on Horlbeck Jurkat (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "UCB", column "Horlbeck Jurkat"
Configuration: NAIAD with UCB acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in Jurkat T cells, gene-level viability (as processed by Qin et al. 2025)
117 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with UCB acquisition on Horlbeck Jurkat (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "UCB", column "Horlbeck Jurkat"
Configuration: NAIAD with UCB acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
4.5 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with UCB acquisition on Horlbeck K562 (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "UCB", column "Horlbeck K562"
Configuration: NAIAD with UCB acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
55 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with UCB acquisition on Horlbeck K562 (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "UCB", column "Horlbeck K562"
Configuration: NAIAD with UCB acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Norman et al. 2019 combinatorial CRISPRa in K562, gene-level viability (as processed by Qin et al. 2025)
2.25 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with UCB acquisition on Norman (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "UCB", column "Norman"
Configuration: NAIAD with UCB acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Norman et al. 2019 combinatorial CRISPRa in K562, gene-level viability (as processed by Qin et al. 2025)
97 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with UCB acquisition on Norman (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "UCB", column "Norman"
Configuration: NAIAD with UCB acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Simpson et al. 2023 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
18.8 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with UCB acquisition on Simpson (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "UCB", column "Simpson"
Configuration: NAIAD with UCB acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Simpson et al. 2023 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
111 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with UCB acquisition on Simpson (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "UCB", column "Simpson"
Configuration: NAIAD with Uncertainty acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in Jurkat T cells, gene-level viability (as processed by Qin et al. 2025)
3.75 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uncertainty acquisition on Horlbeck Jurkat (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "Uncertainty", column "Horlbeck Jurkat"
Configuration: NAIAD with Uncertainty acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in Jurkat T cells, gene-level viability (as processed by Qin et al. 2025)
84 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uncertainty acquisition on Horlbeck Jurkat (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "Uncertainty", column "Horlbeck Jurkat"
Configuration: NAIAD with Uncertainty acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
2 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uncertainty acquisition on Horlbeck K562 (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "Uncertainty", column "Horlbeck K562"
Configuration: NAIAD with Uncertainty acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
45 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uncertainty acquisition on Horlbeck K562 (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "Uncertainty", column "Horlbeck K562"
Configuration: NAIAD with Uncertainty acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Norman et al. 2019 combinatorial CRISPRa in K562, gene-level viability (as processed by Qin et al. 2025)
1 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uncertainty acquisition on Norman (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "Uncertainty", column "Norman"
Configuration: NAIAD with Uncertainty acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Norman et al. 2019 combinatorial CRISPRa in K562, gene-level viability (as processed by Qin et al. 2025)
92 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uncertainty acquisition on Norman (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "Uncertainty", column "Norman"
Configuration: NAIAD with Uncertainty acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Simpson et al. 2023 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
9.5 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uncertainty acquisition on Simpson (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "Uncertainty", column "Simpson"
Configuration: NAIAD with Uncertainty acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Simpson et al. 2023 combinatorial CRISPRi in K562, gene-level viability (as processed by Qin et al. 2025)
74 True positives (the screen's 200 strongest measured gene pairs found among the 200 strongest measured-plus-predicted values, round 4 of active learning)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uncertainty acquisition on Simpson (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 2, row "Uncertainty", column "Simpson"
Configuration: NAIAD with Uniform acquisitionProtocol: Retrospective active learning on a fully measured two-gene CRISPR viability screen: top-200 gene pairs found by round 4
Dataset: Horlbeck et al. 2018 combinatorial CRISPRi in Jurkat T cells, gene-level viability (as processed by Qin et al. 2025)
2.5 Count (marginal gain (P_4 - P_0)/4 in the screen's 200 strongest measured gene pairs found, round 0 to round 4)
count · higher

Uncertainty: Not reported by the source: The table prints no error and does not state the number of runs.

Coverage: Not reported scored / Not reported eligible

Author-reported evaluation · Source checked
Methods, coverage and source

NAIAD with Uniform acquisition on Horlbeck Jurkat (Tables 2 and 3, acquisition functions with NAIAD)

pheno-20261022-qin2025-protocol-al-top200

Aggregation: Not reported

Qin et al. 2025, Active Learning for Efficient Discovery of Optimal Combinatorial Perturbations (ICML 2025, PMLR 267) · Table 3, row "Uniform", column "Horlbeck Jurkat"

Source checking is not independent reproduction. Release 2026-10-23-5347695500ed.

Methods and evaluation design

Procedure, tasks and evaluated configurations

Recorded evaluations

Each evaluation records what was tested and under which conditions.

Explore all linked results

Baseline coverage

Reference methods help show what a model adds beyond simple controls. We track a null control and a conventional method for each protocol.

0 of 2 active baseline roles have published Rewire measurements in this release. Measurements on a selected protocol do not establish coverage of an entire suite.

No execution recipe linked to this protocol. Recipe availability does not establish a completed evaluation.

Author-reported evaluations
106
External evaluations
14

Literature evidence is not a Rewire measurement. Executed but unpublished runs and private review status are not included.

Null control

Proposed control: requires review

Unintegrated representation using protocol preprocessing

Protocol-specific applicability, permitted inputs, access, split, evaluator and execution requirements need review before implementation or execution.

This is a suggested selection rule, not a validated method or a measured score.

Conventional reference

Proposed control: requires review

Protocol-specific conventional integration method

Protocol-specific applicability, permitted inputs, access, split, evaluator and execution requirements need review before implementation or execution.

This is a suggested selection rule, not a validated method or a measured score.

Protocol coverage CSV (gzip) · Model evaluation matrix (gzip) · Source table (gzip) · Release and checksums (gzip)

Coverage is derived from release 2026-10-23-5347695500ed. Source citations describe the original records; they do not validate an unreviewed baseline proposal. No results have been generated by this audit.

Run instructions

No runnable recipe has been reviewed for this protocol. Dataset access, model requirements, licences and compute requirements must be checked against its sources before execution.

Evidence

Source checking verifies the cited claim or transcription. It does not establish independent reproduction.

Evidence table

Inspect claims, sources and review details

Trace each statement to its source and review. A context-only reference supports the record generally; it does not verify an individual field. Source checking does not reproduce an experiment.

One row per statement and cited source. Multiple citations are not independent evaluations. Shared locators are labelled explicitly.

0 evidence rows matching the loaded filters

Claims, original sources and review scope · Release 2026-10-23-5347695500ed
Property and statementOriginal source and locationReview and provenance

No evidence rows match these filters. Choose another scope or clear the search.

Sources and history

Release 2026-10-23-5347695500ed · Record review: source checked

1 source record and release historyDownload this release (gzip)
Technical metadata and extraction receipts

Stable ID: pheno-20261022-qin2025-protocol-al-top200

areas
cells-tissues
contexts
research
protocol
Round 0 trains on a uniformly sampled seed set (100 pairs for Norman, 500 for Simpson and both Horlbeck screens). In each of 4 further rounds the trained ensemble predicts every unmeasured pair, the acquisition function selects 100 (Norman) or 500 (others) more pairs whose measured values are revealed from the screen, and the model is retrained. Acquisition functions: Uniform, Maximum Predicted Effect (MPE), Upper Confidence Bound (UCB, residual from a linear model plus ensemble standard deviation, kappa = 1), Uncertainty (ensemble standard deviation) and Mean-UCB (alpha times ensemble mean plus beta times ensemble standard deviation).
procedure
Fraction Discovered (Appendix D): after training in round i, predictions for all unseen pairs are concatenated with the measured values of the seen pairs to form X_i; X_i,P is the top P values of X_i, Y_i,P the top P measured values across all samples, and P_i = |X_i,P ∩ Y_i,P|. Tables 2, 4, 5, 7 and 8 print P_i at P = 200; Table 3 prints the marginal gain (P_4 - P_0)/4.
version
Qin et al. 2025, PMLR 267, Sections 4.3 and 5.3, Appendices C and D
metric
true-positive-count
metric direction
higher
unit
count
unit detail
gene pairs, out of the 200 strongest measured pairs
metric definition
P_200 = number of the 200 strongest measured gene pairs in the whole screen that are among the 200 strongest values of the combined set of measured (acquired) and predicted (unacquired) pairs. Pairs counted as found need not have been measured.
denominator
200
task
Choose which two-gene combinations to measure next so that the strongest combinations are identified with few measurements
selection
Candidate pool is every pair in the screen; the seed set is drawn uniformly and shared by all acquisition functions
replicates
Tables 4, 5, 7 and 8: three cross-fold replicates with standard error printed. Tables 2 and 3: not stated.
random seeds
Not stated
scope note
Retrospective replay over already-measured screens; no new experiment is run. 'Strongest' is not defined by sign: Appendix C.2 says MPE selects the highest absolute predicted effects, and Appendix D says top P values.
limitations
A pair counts as discovered when it is in the top 200 of the measured-plus-predicted ranking, so the count mixes pairs actually measured with pairs only predicted; it is not the number of strong pairs among those tested.; Ground truth is the 200 strongest measured viability effects in the same screen, not an independently confirmed phenotype or a significance threshold; the 200 are 3.2% of Norman's 6,328 pairs and 0.14% to 0.21% of the other screens.; The measurement budget differs by screen (500 pairs of 6,328 for Norman; 2,500 of 95,703 to 147,658 for the others).; Single-gene effects of every gene are available to the model throughout.; All values come from the NAIAD authors, who also adapted RECOVER and GEARS to this setting.; The paper does not define a cross-fold replicate for the active-learning experiments.
source locator
Section 4.3; Section 5.3; Appendix C; Appendix D 'Fraction Discovered' and 'Marginal Gain'
publication status
peer_reviewed
review
method: source-hash-verification; scope-review; reviewer: claude; reviewer note: Claude (Opus 5.5) review agent, independent of the extraction agent; no human review claimed; date: 2026-10-22; artifact sha256: 983b2da8aed78f0aced27053301c15f0f67ebd0fac706435bb6800e309dd64eb; retrieval url: https://raw.githubusercontent.com/mlresearch/v267/main/assets/qin25g/qin25g.pdf; method note: Re-hashed the PDF in the scratchpad (SHA-256 matches the source record). Read the cited sections in the pdftotext layer of the pinned PDF.; note: Fields checked against the cited locator; nothing found that the source does not state.
Related records

Suggest a correction