Blind Variation, Selective Retention: Improving Creative Idea Generation in AI Scientists
Organizations: Stanford University
Abstract
Scientific discovery requires ideas that are original, useful, and non-obvious. Yet AI scientists are typically given as much task information as possible during idea generation, which can anchor generation toward familiar approaches. Inspired by the cognitive framework of Blind Variation and Selective Retention (BVSR), we propose a discovery framework that separates these two roles of information: it generates proposals under deliberately limited task information to broaden exploration, then learns from proposals previously verified on the same task and their outcomes to retain promising candidates for costly empirical evaluation. We evaluate BVSR across five proposer models and 12 scientific tasks. Limiting task information substantially increases proposal originality and non-obviousness, and produces a larger share of highly creative and high-utility proposals than existing state-of-the-art prompting-based baselines. Learning from prior proposal outcomes on the task further improves candidate selection, discarding half of the candidates while retaining most top-performing proposals. When incorporated into existing AI-scientist workflows, BVSR achieves stronger discoveries across gene expression analysis, drug response prediction, anomaly detection, scaling law discovery, and brain activity prediction. These results suggest that effective AI scientists should use information differently across stages of discovery: constrain task-specific information during exploration while exploiting accumulated empirical experience on the task.
Figures & tables
| Method | Creativity ( ) | Utility ( ) | Originality ( ) | Non-obviousness ( ) |
|---|---|---|---|---|
| BV (Limited Information) | ||||
| BV (Full Information) | ||||
| Analogical Reasoning | ||||
| Cross-Domain | ||||
| No-Domain |
| Task | Ours | SimpleTES | Best Baseline |
|---|---|---|---|
| Gene Expression Analysis | 0.918 | 0.906 | 0.853 [ 60 ] |
| Anomaly Detection | 0.679 | 0.629 | 0.491 [ 23 ] |
| Scaling Law Discovery | 0.967 | 0.940 | N/A |
Appendix figures & tables4 assets
Supplementary material from the paper’s appendix.
Appendix
| Domain | Task | Data and Setup | Task Score | Reference Baseline | Time Limit |
| Biology | SVG | DBiT-seq mouse eye; 2,500 spots, 1,050 genes (50 genes 21 variants) | Kendall correlation in variant groups, scaled | SPARK-X 0.8531 | 900 s |
| LabelProj | GTEx v9; 197,618 reference and 11,508 query nuclei, 53 cell types | Accuracy and three F1 scores, scaled | scANVI+scArches 0.773 | 2,400 s | |
| PertPred | NeurIPS 2023 PBMC; 402 training, 151 query profiles; 5,317 genes | Five row-wise metrics, scaled | NN, pseudo-labels 0.465 | 1,500 s | |
| CCC | TNBC; 42,512 cells, 29 cell types; 812 truth pairs, 166 positive | AUPRC and top-5% odds ratio, scaled | Product specificity 0.120 | 2,400 s | |
| Machine Learning | MLS-Anomaly | Cardio, Thyroid, Satellite, Shuttle; parameters | AUROC, F1 vs. baselines; geometric mean | Isolation Forest 0.4912 | 300 s |
| MLS-Calibration | Four fixed classifiers on MNIST, Fashion-MNIST, Madelon, Breast Cancer | ECE, Brier, NLL vs. baselines; geometric mean | Temperature scaling 0.2935 | 180 s |
Research Idea Generation
Research idea generation uses computational methods, especially language models, to propose and assess new questions, hypotheses, and research directions.
See all 68 papers