mlsanityData to 14 Oct 2026

Scientific Discovery under Validation Congestion via Multi-Fidelity Pairwise Rankings

arXiv 2610.01827 ↗First posted 1 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Modern computational methods can now propose candidate molecules, materials, and other scientific designs at an unprecedented scale, creating a validation congestion where candidates are abundant, but experimental capacity to physically evaluate them remains scarce. Discovering novel scientific designs has therefore become increasingly dependent on curation: selecting a small set of promising designs for slow and costly experiments. Existing curation methods typically rely on data-driven regression models that predict absolute scores, but training these models requires substantial experimental data to begin with. Yet, useful curation signals do not have to take the form of absolute measurements, as scientific design discovery is often comparative in nature. Here, we propose that curation can instead be primarily driven by expert pairwise rankings, which are substantially easier to gather. The expertise can come from computational tools or human input of multiple levels of fidelity, ranging from empirical rules of thumb to agentic workflows and experienced scientists. We introduce PRISMS, a framework that uses pairwise rankings from one or more experts, potentially spanning multiple levels of expertise, to identify the most promising candidates without relying on data-hungry regressors. When experts differ in fidelity and cost, PRISMS escalates pairwise queries from lower- to higher-fidelity rankers based on a Fisher-information criterion. In iterative screening that selects designs from fixed drug discovery libraries, PRISMS achieves 50% top-10 discovery recall in ~42% fewer rounds than regression-only active learning, and in ~15% fewer rounds than the ranking-based method with no selective escalation. In optimization that generates new designs without restriction to a predefined library, PRISMS achieves ~18.8% higher hypervolume than the Bayesian optimization baseline.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 50 references that are in the map. First posted on arXiv 1 Oct 2026.

Builds on

10 of 50 references.

References · 10

  1. 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 765
  2. 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 307
  3. 2018Multi-Objective De Novo Drug Design with Conditional Graph Generative Modelcited by 101
  4. 2017Preferential Bayesian Optimizationcited by 74
  5. 2015Spectral MLE: Top-K Rank Aggregation from Pairwise Comparisonscited by 34
  6. 2020Olympus: a benchmarking framework for noisy optimization and experiment planningcited by 29
  7. 2022Autoinverse: Uncertainty Aware Inversion of Neural Networkscited by 16
  8. 2024Consolidating Ranking and Relevance Predictions of Large Language Models through Post-Processingcited by 9
  9. 2024Diagnosing and fixing common problems in Bayesian optimization for molecule designcited by 9
  10. 2024AFBench: A Large-scale Benchmark for Airfoil Designcited by 7

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Science Edge Evaluation: SEE the Missing Step Toward Real Scientific Discovery
  2. 2025MOOSE-Chem3: Toward Experiment-Guided Hypothesis Ranking via Simulated Experimental Feedback
  3. 2024Quality-Weighted Vendi Scores And Their Application To Diverse Experimental Design
  4. 2026MADE: Benchmark Environments for Closed-Loop Materials Discovery
  5. 2026Deciphering Scientific Reasoning Steps from Outcome Data for Molecule Optimization
  6. 2026SciCurateBench: Curating Experimental Data from Heterogeneous Scientific Literature with Verbal-Action Agents
  7. 2025Can Molecular Foundation Models Know What They Don't Know? A Simple Remedy with Preference Optimization
  8. 2026Multi-Persona Debate System for Automated Scientific Hypothesis Generation