Evolutionary Intelligence for Scientific Discovery: From Evolutionary Computation to Cumulative Discovery Systems


1 Introduction↩︎

Artificial intelligence (AI) increasingly serves as a general-purpose tool for scientific discovery, transitioning from task-specific automation to systems that organize scientific exploration [1], [2]. By leveraging experimental feedback and human interaction, AI systems can explore scientific problems through discovery cycles. This shift is evident across disciplines, where AI actively investigates candidate spaces in molecular and materials design [3], [4], protein engineering [5], and automated laboratories [6], [7], moving beyond passive data analysis.

Feedback-driven discovery explores open-ended candidate spaces where boundaries are often undefined and emerge as evidence accumulates [1], [8]. Because experimental feedback is costly and physically constrained, every evaluated candidate, including failures, constitutes valuable scientific evidence [9], [10]. Consequently, the evaluation history can reveal hidden structures within the candidate space and support diverse exploratory behaviours [8], [11].

Evolutionary computation (EC) provides a foundational computational framework to support these discovery cycles [12], [13]. Rather than relying on a single-point search, EC maintains populations of scientific candidates that are iteratively updated by evolutionary operators according to feedback. This population-based approach is particularly well suited to open-ended candidate spaces characterized by weak or absent gradients, noisy feedback, and dynamically evolving boundaries [8], [14][16]. By steering exploration toward regions supported by accumulated evidence, EC sustains the creation of diverse scientific candidates across discovery cycles. This approach encompasses various common algorithms, such as classical genetic algorithm, evolution strategies [17][20], natural evolution strategies [21], [22], and quality-diversity search methods [23][26].

Conventionally, EC has advanced AI for scientific discovery primarily by refining candidates for well-defined scientific problems. Extensive research has focused on designing specialized evolutionary operators to steer this candidate refinement [17][19], [21]. However, cumulative discovery relies on more than just finding the best candidate. The entire search trajectory, including failed trials and complex feedback, provides experience that guides later searches [24], [26][28]. Therefore, evolutionary search serves not just to solve single problems, but to accumulate experience across iterative discovery cycles [29], [30].

To capture this transition, this review introduces evolutionary intelligence (EI) for scientific discovery. EI characterizes scientific AI systems that sustain exploration by linking candidate refinement with experience retention across evolutionary cycles. Within this framework, populations of scientific candidates are updated by evolutionary operators and evaluated via experimental or human feedback. Specifically, these evaluated candidates and their corresponding feedback are retained in structured forms to guide subsequent exploration. Unlike single-task search methods that primarily maximize sample efficiency for isolated problems [15], [31], [32], EI treats the entire search trajectory, including failed trials and candidate lineages, as scientific evidence to be structured and reused. By bridging candidate refinement with experience retention, EI provides a structured framework for cumulative discovery [27], [29], [30].

Recent AI systems increasingly embed evolutionary cycles into scientific discovery. Algorithm-discovery platforms, such as FunSearch and AlphaEvolve, refine candidate programs through automated evaluation mechanisms [33], [34]. Foundation-model-assisted evolutionary methods further expand this scope beyond final scientific targets to fundamental research components. These systems actively evolve prompts, code, and hypotheses, alongside reusable skills [8], [35][39]. Concurrently, autonomous laboratories and scientific agents integrate exploration with experimental and human feedback, enabling subsequent candidates to adapt dynamically to accumulated evidence [7], [9], [40][44]. The emergence of such autonomous research systems is increasingly recognized as agentic science [45][49]. As evolutionary search begins to reshape these research components, evaluation metrics need to expand beyond mere candidate quality to explicitly incorporate scientific reliability and human oversight [11], [39], [50][52].

This review examines the transition from EC to EI in scientific discovery. We first introduce a five-dimensional analytical framework designed to analyze diverse scientific AI systems, from foundation-model-assisted program search to closed-loop autonomous laboratories. This framework clarifies how the EI cycle transforms isolated search experiences into structured scientific insights. We further demonstrate how this paradigm operates across diverse discovery modes, from evolving concrete scientific entities to orchestrating automated research workflows. Finally, we outline key challenges regarding evaluation, process traceability, and shared infrastructure, providing a concrete roadmap to advance this transition. Ultimately, this perspective reframes EC from a task-level search tool into an organizing principle for cumulative scientific discovery.

2 From evolutionary computation to evolutionary intelligence↩︎

EC provides a foundational framework for population-based search in scientific discovery. Rather than relying on single-point updates, EC maintains populations of candidates through evolutionary operators that organize reproduction, evaluate outcomes against feedback, and drive selection. Adaptive strategies and archival mechanisms retain historical experience to influence subsequent search trajectories [13], [17], [18], [20], [21]. This organizational logic is well suited to open-ended scientific candidate spaces. In such environments, search often proceeds before boundaries, objectives, or feedback processes are fully defined, aligning with broader biological perspectives on adaptation and the evolution of physical artifacts [12], [53]. By preserving diverse candidate lineages and leveraging quality-diversity principles, EC sustains robust exploration even under weak gradients or noisy feedback [14], [15], [24][26], [54].

While EC provides the search mechanism, many traditional applications treat scientific discovery as black-box optimization over fixed representations. Unlike these approaches, EI broadens the scope of the evolving object. Candidate populations in EC need not be stored exclusively as explicit sets. While genetic algorithms [18] and genetic programming [19] traditionally maintain explicit candidate representations, natural evolution strategies [21], [22] and estimation-of-distribution algorithms [55][57] update probabilistic sampling distributions derived from evaluated candidates. In scientific discovery, evolution can act on scientific targets [4], [5], foundational research components [33], [35], [36], [58], [59], up to the discovery processes themselves [9], [40], [41], [60]. For instance, rather than merely refining a molecular structure, an EI system might concurrently evolve the machine learning model predicting its properties, alongside the experimental batching policy used to test it [43], [44], [61]. This shift from fixed representations to dynamic, multi-level targets allows scientific AI systems to organize exploration flexibly, whether through explicit candidate pools and learned generative models, alongside probabilistic proposal distributions. However, as the evolving objects become more complex and scientifically grounded, the evaluation mechanism needs to evolve beyond simple scalar fitness assignment.

Scientific feedback expands the role of evaluation beyond simple ranking to incorporate diverse physical and computational constraints. In EC practices, evaluation is typically reduced to a scalar objective value used to rank candidates [17], [18], [62]. In scientific discovery, however, feedback encompasses various types of signals. These range from data-driven computational proxies, such as predictive models and uncertainty estimates [3][5], [15], to physical constraints derived from laboratory experiments [7], [9], [10], [40], alongside human-driven reproducibility checks and expert judgement [1], [2], [11]. Consequently, these diverse signals shape not only which candidates are selected, but also how the underlying models, constraints, and experimental priorities are adjusted for the subsequent discovery cycle. These signals generate rich scientific evidence across every cycle, which raises the key question of how such evidence is preserved and utilized over time.

Figure 1: From evolutionary computation (EC) to evolutionary intelligence (EI) for scientific discovery. EC organizes population-based search through evolutionary operators. EI embeds this organization in scientific discovery systems where evolution can act on scientific targets, research components, or discovery processes. The transition from EC to EI shifts the emphasis from candidate refinement against feedback to cumulative scientific discovery.
Table 1: From evolutionary computation to evolutionary intelligence for scientific discovery.
Dimension Evolutionary computation Evolutionary intelligence for scientific discovery
Primary role Population-based search Cumulative scientific discovery
Population Candidate sets or sampling distributions Scientific targets, research components, or discovery processes
Reproduction Mutation, crossover, distributional sampling, and program variation Evolutionary variation, learned generation, foundation-model generation, and human-guided modification
Feedback-based evaluation Fitness functions, objective values, or simulations Computational, experimental, and human feedback
Selection and update Candidate survival and distribution update Updated candidates, proposal distributions, models, constraints, and experimental priorities
Archive and record Elites, non-dominated solutions, diverse behaviours, and search states Successful candidates, failures, lineages, model states, experimental records, and annotations
Experience retention and transfer Adaptation within a search loop and transfer across related tasks Experience reuse across evolutionary cycles and transfer across tasks, models, skills, or experiments

Ultimately, the integration of expanded evolving objects and diverse scientific feedback requires a shift in the temporal scale of experience retention, marking a key transition from isolated search to cumulative scientific discovery. Traditional adaptive or transfer methods typically confine experience utilization within a single search loop [63] or between closely related tasks [64], [65]. By contrast, EI systematically archives the search trajectory, treating failed trials, candidate lineages, and experimental logs as valuable scientific evidence. This structured record reshapes candidate generation and selection pressures in subsequent cycles, enabling knowledge transfer across distinct tasks and scientific domains [28], [66][68], as well as simulation-to-experiment boundaries [65]. Recent foundation-model-assisted agents [8], [33][36] and autonomous laboratories [9], [40], [41] exemplify this paradigm. In these systems, validation, traceability, and human oversight operate as core elements of the EI framework rather than external checks [11], [52], [69]. Fig. 1 and Table 1 summarize this transition from EC to EI for scientific discovery. Fig. 1 illustrates how population-based search becomes embedded within feedback-driven discovery systems, while Table 1 compares their core operations.

3 A five-dimensional framework for evolutionary intelligence↩︎

Figure 2: A five-dimensional framework for evolutionary intelligence. This framework analyzes scientific AI systems by linking five analytical questions to their corresponding system components: the evolving object (what evolves), the source of variation (how candidates change), the selection criterion (why candidates are selected), the feedback environment (where feedback originates), and the time scale of evolution (when evolution occurs).

EI for scientific discovery can be analyzed through five interconnected questions: what evolves, how candidates change, why candidates are selected, where feedback originates, and when evolution occurs. These questions correspond to five components of a discovery system: the evolving object, the source of variation, the selection criterion, the feedback environment, and the time scale of evolution [17]. These components interact closely. The feedback environment influences the selection criteria, which in turn shape the mechanisms of variation, while the time scale determines how accumulated experience is retained and transferred across cycles [28]. This framework, illustrated in Fig. 2, provides a structured approach to analyze how isolated search trajectories are transformed into cumulative scientific insight.

What evolves. Many EC applications typically target fixed representations, ranging from numerical vectors to static programs and predefined policies [17][19], [70], [71]. For scientific discovery, EI broadens this scope across multiple levels. The evolving object may encompass concrete scientific targets, research components, or discovery processes. Specifically, targets range from molecular structures and protein sequences to complex experimental recipes [4], [5], [72], [73]. Research components include computational models and data representations [74][76], as well as prompt templates and testable hypotheses [35], [36], [77]. Furthermore, discovery processes themselves can evolve, including experimental planning protocols, tool-use routines, and human-AI collaborative workflows [7], [40], [41], [60]. This broader view is valuable because these objects frequently overlap in practice. A scientific AI system often adapts multiple components concurrently within a single cycle. For instance, an autonomous materials platform might simultaneously refine candidate compounds, update underlying surrogate models, and adjust experimental batching policies [15], [43], [44], [61]. Similarly, the evolution of reusable skills, such as automating data curation and literature retrieval, functions as a dynamic research component that supports the broader discovery workflow [39], [60].

How candidates change. EC algorithms primarily drive candidate variation through operators such as mutation and crossover, as well as distributional sampling and program transformation [18], [19], [21], [55]. In EI for scientific discovery, candidate variation is also driven by learned generative models, foundation models, and human-guided modification. For instance, large foundation models can propose or revise complex programs and testable hypotheses, and refine prompt templates and experimental plans [8], [33][36], [78], [79]. Domain-specific scientific constraints and prior knowledge can help guide this variation, restricting it to physically or logically plausible regions of the candidate space [50], [76].

Why candidates are selected. Many EC implementations rely on scalar fitness values or predefined objective functions to rank and propagate candidates [17], [18], [62]. In scientific discovery, however, selection criteria expand to encompass multi-dimensional trade-offs, physical feasibility, and domain-specific scientific value. Rather than prioritizing a single metric, selection pressures balance competing objectives, such as predictive accuracy, computational cost, and experimental safety [80], [81]. Furthermore, mechanisms that preserve novelty and diversity penalize premature convergence, keeping alternative hypotheses and unexplored regions of the candidate space viable [23][27]. These criteria adapt as feedback accumulates, while human judgement and expert oversight can steer selection toward scientifically promising regions that lack immediate computational validation [32], [82], [83]. Consequently, selection in EI functions not only to filter candidates, but also to steer the search trajectory toward evolving scientific priorities.

Where feedback originates. EC practices typically derive evaluation feedback from predefined, scalar fitness functions or controlled simulated environments [17], [18], [62]. In scientific discovery, however, the feedback environment includes various types of signals. These range from computational proxies, such as predictive models and uncertainty estimates [3][5], [84], to physical constraints derived from laboratory experiments [7], [9], [10], [40], [85], and human-driven reproducibility checks with expert judgement [1], [2], [11]. These signals do more than merely rank candidates; they influence how models, search constraints, and experimental priorities are adjusted for subsequent discovery cycles. Consequently, the feedback environment in EI serves as a direct link between the computational search and physical experiments.

When evolution occurs. The temporal scale at which evolutionary operations are applied influences whether a system remains confined to local search or supports systematic cumulative discovery. In scientific AI systems, evolution operates at multiple time scales, depending on the latency and cost of feedback. At the design and training stages, evolutionary mechanisms shape model architectures [58], [86] and search configurations [59], [87], and adjust proposal distributions during the learning process [21], [88]. At the inference and experimental stages, foundation-model systems can search over reasoning paths [77], [79], algorithmic programs [33], [34], and testable scientific hypotheses [7], [36], [37], while laboratory feedback refines candidate batches and experimental priorities [9], [40], [89]. Across time scales, archived priors and adaptive search strategies enable knowledge transfer across distinct tasks and scientific domains [28], [66][68]. Consequently, the timing of evolution is more than a scheduling detail; it determines how retained experience shapes future discovery cycles.

Collectively, these five dimensions provide a framework for comparing diverse scientific AI systems across different domains and technical implementations [1], [47]. By examining how a system combines its evolving objects, variation mechanisms, and feedback environments, we can determine whether it is limited to isolated search or capable of systematic cumulative discovery. This perspective shifts the focus from individual algorithms to how the system learns over time. Consequently, it provides a basis for analyzing the EI cycle, which integrates these dimensions to transform isolated search trajectories into scientific insight.

4 The evolutionary intelligence cycle: from experience retention to scientific insight↩︎

The role of search trajectories. EI expands the value of search trajectories. Many EC applications primarily focus on identifying a set of high-performing candidates or a Pareto front [24], [25], [27], [80]. For cumulative discovery, however, the entire search trajectory can serve as a valuable foundation for generating scientific insight. Rather than merely recording final outcomes, EI systems frequently capture detailed evidence. Failed trials often reveal physical and operational constraints, while candidate lineages document specific modifications that preserve or degrade function. Furthermore, experimental records can highlight systematic discrepancies between computational surrogates and physical reality [9], [15], [16], [40]. By archiving these complete search histories, EI translates isolated search trajectories into a structured experience that informs subsequent discovery cycles. This transformation is governed by the EI cycle (Fig. 3), which systematically retains, represents, utilizes, and transfers experience to generate scientific insight.

Figure 3: From experience retention to scientific insight. Evolutionary intelligence (EI) transforms disconnected search trajectories into a coherent knowledge base that informs subsequent discovery cycles. Experience retention captures and structures diverse scientific records. Knowledge representation converts these raw records into interpretable representations. Knowledge utilization actively employs this retained memory to adjust search strategies, selection pressures, programs, and hypotheses, reshaping how candidates are generated, evaluated, and selected. Knowledge transfer enables this archived experience to accumulate scientific value across diverse scientific contexts. Ultimately, this cumulative process aims to produce scientific insight, grounded in systematic validation and traceability.

Experience retention. This mechanism differs from common EC practices of archiving primarily elite solutions or non-dominated fronts [17], [18], [23], [24]. In scientific discovery, EI systems often employ broader archival protocols that record more aspects of the search process. Rather than discarding suboptimal outcomes, these protocols frequently incorporate failed trials, intermediate evolutionary lineages, and raw experimental logs, and human annotations with contextual metadata [6], [9], [10], [40]. By structuring these diverse records into a unified historical record, EI helps preserve a broader range of scientific evidence. This extensive retention provides valuable raw material for subsequent knowledge representation, converting isolated data points into a coherent and traceable scientific record.

Knowledge representation. Raw archival records often require transformation into usable and interpretable forms to guide future exploration. In this phase, EI systems convert accumulated search history into structured representations. These representations range from data-driven probabilistic surrogate models that map candidate features to evaluation indicators [15], [90], [91], to topological mappings of the search space that reveal hidden basins of attraction [24], [27], and domain-specific scientific priors derived from physical laws or expert knowledge [1][3]. This step connects low-level data to higher-level reasoning. By recording both successes and failures, the system builds a structured history that guides future searches toward viable options and prevents repeated mistakes.

Knowledge utilization. This mechanism uses retained experience to steer the ongoing search process. Rather than relying on static rules, EI systems adjust their search strategies using the structured representations built in the previous phase. For instance, data-driven surrogates and uncertainty estimates can guide the generation of new candidates, directing evolutionary variation toward regions of the search space that are promising or uncertain [15], [91], [92]. Topological mappings and novelty metrics change selection pressures, penalizing premature convergence and encouraging the exploration of diverse behaviors [23][25]. Furthermore, foundation models use encoded scientific priors to propose programs and valid hypotheses, reducing reliance on random mutation [7], [33], [35], [36]. Through these mechanisms, knowledge utilization shifts the search from trial-and-error to evidence-driven inquiry, balancing open-ended exploration and targeted refinement as new feedback arrives.

Knowledge transfer. This mechanism enables cumulative discovery by reusing experience across tasks, rather than limiting search to single runs or closely related problems [28], [63], [64]. In EI systems, structured records and adaptive strategies are reused across new scientific contexts. Rather than starting from scratch, these systems use archived priors to accelerate exploration in distinct tasks and scientific domains [1], [7], [41], [47]. This transfer also bridges computational and physical boundaries. For instance, heuristics and data-driven models learned in simulations can be transferred to guide costly physical experiments, helping to connect simulations with physical experiments [15], [65], [68]. Similarly, experimental protocols and design principles can propagate across different length scales or material classes [3], [4], [76]. Systems also extract and reuse modular skills. When they find effective algorithms or prompt templates, they archive these structures for future tasks [35], [36], [39], [60]. Systems can then combine these saved skills to solve new problems. By reusing past results, each discovery cycle builds directly on previous knowledge rather than starting from scratch.

Scientific insight. This phase shifts the focus from finding high-performing candidates to generating interpretable scientific knowledge. While many search processes conclude with a single best candidate or a Pareto front, cumulative discovery systems extract generalized principles from the entire search trajectory. These insights include explicit structure–property relationships, design rules, or testable mechanistic hypotheses that explain why certain candidates succeed while others fail [1], [2], [11]. Because these insights are based on archived failures, diverse search paths, and physical validation, they are highly reliable and traceable [9], [16]. Over time, this new scientific insight feeds back into the broader research community, improving human understanding and providing initial priors for future autonomous discovery systems.

5 Modes of EI-enabled scientific discovery↩︎

To demonstrate the generality of the EI framework, we analyze scientific AI systems based on their evolving object rather than their specific application domains. This approach shows a progression in the scope of evolution: from concrete scientific entities and computational models, through symbolic reasoning processes, to automated research workflows. This classification shows that while specific candidate spaces and feedback mechanisms vary across disciplines, the EI architecture remains consistent [1], [47].

Evolving concrete scientific entities. EI operates on physical or chemical targets, including molecules [5], proteins [72], [73], and materials [4]. Because experimental feedback in these domains is often costly and sparse, systems frequently rely on data-driven surrogate models to guide exploration [15]. EI systems in this context often archive failed synthesis routes and negative characterization data. Rather than discarding these outcomes, the system uses them to identify physically feasible regions. This retained experience allows subsequent search cycles to avoid inaccessible areas and focus on viable spaces, as demonstrated in autonomous materials platforms [43], [44], [61].

Modifying computational models and representations. EI operates on the computational tools used to model scientific entities. Rather than searching directly over physical targets, these systems evolve neural architectures [58], [86] and molecular representations [75], [76], [93][95], and data-driven surrogate models [15]. Adapting these representations can reshape the search space, making previously inaccessible regions easier to explore. At this level, the system records how different representations capture physical or chemical constraints. Because this experience can transfer across related tasks, it enables the system to select representations that favor physically plausible solutions. For example, integrating foundation models into protein and materials design uses pretrained representations to guide the search toward viable biological or chemical structures [50], [96][99].

Evolving symbolic reasoning processes. At a higher level, EI systems target symbolic structures, including executable code, mathematical expressions [33], [34], and mechanistic hypotheses. Unlike physical experiments, the feedback for these symbolic entities can be automatically verified, often relying on massive parallel computing. This automated verification allows systems to evaluate a large volume of candidates. Instead of discarding code that fails a test suite, EI systems often archive these errors. By analyzing these failures, the system can identify recurring logical mistakes or extract partially correct subroutines to guide subsequent modifications [8], [79]. Over successive cycles, these archived code components and corrections enable the system to construct more complex algorithms or mathematical proofs, often resulting in human-readable solutions [36], [37].

Orchestrating automated research workflows. Beyond modifying single components, EI systems can target entire research workflows. These workflows integrate multiple scientific operations, from planning to experimental execution [7], [41]. At this level, the evolving objects are the execution plans for these tasks. Feedback typically evaluates whether the complete workflow successfully produces an outcome, such as a verified hypothesis. Because this requires completing all steps, the feedback is often sparser and more delayed than component-level signals [42], [44]. To manage these processes, EI systems archive successful multi-step protocols. By retaining these execution plans, the system can reuse them to automate complex scientific tasks [39], [51], [60], [100].

In practice, a single scientific workflow often combines multiple modes. For instance, an automated system might evolve the code used to analyze data while simultaneously synthesizing physical materials. Regardless of the objects being modified, the core mechanism remains the same: the system archives past results to guide subsequent steps. As EI systems integrate these modes into complex workflows, evaluation must look beyond the final output. Rather than measuring only the quality of a single result, assessments need to evaluate the reliability of the entire process and the system’s capacity to accumulate experience over time.

6 Evaluation, challenges and roadmap↩︎

Evaluating EI for scientific discovery requires criteria that go beyond the performance of isolated candidates. While candidate quality is a necessary baseline, EI is distinguished by its ability to retain experience, transfer knowledge, and produce interpretable insights across evolutionary cycles. Achieving this cumulative discovery presents several key challenges: defining evaluation metrics, improving process traceability, bridging simulation-to-experiment gaps, and developing shared databases for experience reuse.

Evaluating cumulative discovery beyond candidate refinement. Current evaluation frameworks primarily measure the quality of final candidates within isolated discovery cycles. Such single-cycle metrics are often insufficient to distinguish whether a system accumulates transferable knowledge or merely overfits to a specific task [1], [11]. Consequently, this limitation makes it difficult to separate short-term candidate refinement from systematic cumulative discovery. Addressing this gap requires a shift toward longitudinal metrics. Rather than relying on single-run performance, these metrics need to track how knowledge is utilized and transferred across successive cycles, as well as the emergence of interpretable scientific insights [7], [101].

Traceability of evolutionary processes. When foundation models generate variations, tracing how a specific candidate was derived is often difficult. Without a clear record of the evolutionary process, scientists cannot independently verify or reproduce the results [52], [69]. To address this, systems must record the complete history of candidate modifications, including both successful steps and failed attempts. Additionally, involving human experts to review these records helps ensure that the generated candidates align with known physical or logical rules, turning raw model outputs into trustworthy scientific evidence [11], [79].

Feedback reliability and simulation-to-experiment gaps. The EI cycle depends heavily on feedback, which is often costly, sparse, and noisy. Real-world experiments are slow and expensive, while computational simulations are fast but frequently simplify physical laws [40], [89]. Relying solely on either source can mislead the search. To address this, systems must combine simulations with experiments. They need to measure the gap between simulated predictions and real experimental outcomes, using this difference to continuously correct their models and avoid physically impossible regions [82], [83].

Shared infrastructure for experience reuse. Many current EI systems operate independently, generating large amounts of data that are difficult for other researchers to reuse. The lack of shared data platforms hinders the transfer of knowledge across different scientific domains, length scales, and simulation-to-experiment boundaries [3], [4]. To address this, the community needs standardized databases that systematically record failed experiments, modification histories, and trained models. Developing common data formats and sharing standards would allow new EI systems to begin their searches using previously accumulated experience, enabling cumulative scientific discovery across the broader research community [1], [47].

7 Outlook↩︎

The transition to EI for scientific discovery shifts the focus from automating single tasks to accumulating knowledge over time. Future scientific AI systems will likely integrate foundation models with automated experiments through evolutionary cycles [1], [47]. In these systems, every evaluated candidate and failed experiment contributes to a shared record. This accumulated history allows subsequent searches to build on existing scientific knowledge rather than starting from scratch.

As these systems become more autonomous, the role of human researchers will shift toward setting overall goals and validating results. Scientists remain essential for applying domain expertise and interpreting unexpected experimental outcomes [11], [52]. Therefore, the success of EI should not be judged solely by computational speed, the number of candidates generated, and accuracy. Instead, it depends on the system’s ability to produce experimentally validated insights that withstand scientific scrutiny and help researchers understand the underlying mechanisms.

References↩︎

[1]
H. Wang et al., “Scientific discovery in the age of artificial intelligence,” Nature, vol. 620, no. 7972, pp. 47–60, 2023.
[2]
A. J. Hey, S. Tansley, K. M. Tolle, et al., The fourth paradigm: Data-intensive scientific discovery, vol. 1. Microsoft research Redmond, WA, 2009.
[3]
K. T. Butler, D. W. Davies, H. Cartwright, O. Isayev, and A. Walsh, “Machine learning for molecular and materials science,” Nature, vol. 559, no. 7715, pp. 547–555, 2018.
[4]
A. Merchant, S. Batzner, S. S. Schoenholz, M. Aykol, G. Cheon, and E. D. Cubuk, “Scaling deep learning for materials discovery,” Nature, vol. 624, no. 7990, pp. 80–85, 2023.
[5]
J. Jumper et al., “Highly accurate protein structure prediction with AlphaFold,” nature, vol. 596, no. 7873, pp. 583–589, 2021.
[6]
R. D. King et al., “The automation of science,” Science, vol. 324, no. 5923, pp. 85–89, 2009.
[7]
D. A. Boiko, R. MacKnight, B. Kline, and G. Gomes, “Autonomous chemical research with large language models,” Nature, vol. 624, no. 7992, pp. 570–578, 2023.
[8]
J. Lehman, J. Gordon, S. Jain, K. Ndousse, C. Yeh, and K. O. Stanley, “Evolution through large models,” arXiv preprint arXiv:2206.08896, 2022.
[9]
B. P. MacLeod et al., “Self-driving laboratory for accelerated discovery of thin-film materials,” Science Advances, vol. 6, no. 20, p. eaaz8867, 2020.
[10]
J. M. Granda, L. Donina, V. Dragone, D.-L. Long, and L. Cronin, “Controlling an organic synthesis robot with machine learning to search for new reactivity,” Nature, vol. 559, no. 7714, pp. 377–381, 2018.
[11]
L. Messeri and M. J. Crockett, “Artificial intelligence and illusions of understanding in scientific research,” Nature, vol. 627, no. 8002, pp. 49–58, 2024.
[12]
A. E. Eiben and J. Smith, “From evolutionary computation to the evolution of things,” Nature, vol. 521, no. 7553, pp. 476–482, 2015.
[13]
D. B. Fogel, “An introduction to simulated evolutionary optimization,” IEEE transactions on neural networks, vol. 5, no. 1, pp. 3–14, 1994.
[14]
T. Salimans, J. Ho, X. Chen, S. Sidor, and I. Sutskever, “Evolution strategies as a scalable alternative to reinforcement learning,” arXiv preprint arXiv:1703.03864, 2017.
[15]
Y. Jin, H. Wang, T. Chugh, D. Guo, and K. Miettinen, “Data-driven evolutionary optimization: An overview and case studies,” IEEE Transactions on Evolutionary Computation, vol. 23, no. 3, pp. 442–458, 2018.
[16]
J. Kudela, “A critical problem in benchmarking and analysis of evolutionary computation methods,” Nature Machine Intelligence, vol. 4, no. 12, pp. 1238–1245, 2022.
[17]
J. H. Holland, Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. MIT press, 1992.
[18]
L. B. Booker, D. E. Goldberg, and J. H. Holland, “Classifier systems and genetic algorithms,” Artificial intelligence, vol. 40, no. 1–3, pp. 235–282, 1989.
[19]
J. R. Koza, “Genetic programming as a means for programming computers by natural selection,” Statistics and computing, vol. 4, no. 2, pp. 87–112, 1994.
[20]
H.-G. Beyer and H.-P. Schwefel, “Evolution strategies–a comprehensive introduction,” Natural computing, vol. 1, no. 1, pp. 3–52, 2002.
[21]
N. Hansen and A. Ostermeier, “Completely derandomized self-adaptation in evolution strategies,” Evolutionary computation, vol. 9, no. 2, pp. 159–195, 2001.
[22]
D. Wierstra, T. Schaul, T. Glasmachers, Y. Sun, J. Peters, and J. Schmidhuber, “Natural evolution strategies,” The Journal of Machine Learning Research, vol. 15, no. 1, pp. 949–980, 2014.
[23]
J. Lehman and K. O. Stanley, “Abandoning objectives: Evolution through the search for novelty alone,” Evolutionary computation, vol. 19, no. 2, pp. 189–223, 2011.
[24]
J.-B. Mouret and J. Clune, “Illuminating search spaces by mapping elites,” arXiv preprint arXiv:1504.04909, 2015.
[25]
J. K. Pugh, L. B. Soros, and K. O. Stanley, “Quality diversity: A new frontier for evolutionary computation,” Frontiers in Robotics and AI, vol. 3, p. 40, 2016.
[26]
J. Lehman, E. Meyerson, T. El-Gaaly, K. O. Stanley, and T. Ziyaee, “Evolution and the knightian blindspot of machine learning,” arXiv preprint arXiv:2501.13075, 2025.
[27]
A. Cully, J. Clune, D. Tarapore, and J.-B. Mouret, “Robots that can adapt like animals,” Nature, vol. 521, no. 7553, pp. 503–507, 2015.
[28]
K. C. Tan, L. Feng, and M. Jiang, “Evolutionary transfer optimization-a new frontier in evolutionary computation research,” IEEE Computational Intelligence Magazine, vol. 16, no. 1, pp. 22–33, 2021.
[29]
C. Wang, J. Zhao, L. Jiao, L. Li, F. Liu, and S. Yang, “When large language models meet evolutionary algorithms: Potential enhancements and challenges,” Research, vol. 8, p. 0646, 2025.
[30]
H. Gao et al., “A survey of self-evolving agents: What, when, how, and where to evolve on the path to artificial super intelligence,” arXiv preprint arXiv:2507.21046, 2025.
[31]
P. I. Frazier, “A tutorial on bayesian optimization,” arXiv preprint arXiv:1807.02811, 2018.
[32]
B. Settles, “Active learning literature survey,” University of Wisconsin–Madison, 2009.
[33]
B. Romera-Paredes et al., “Mathematical discoveries from program search with large language models,” Nature, vol. 625, no. 7995, pp. 468–475, 2024.
[34]
A. Novikov et al., “Alphaevolve: A coding agent for scientific and algorithmic discovery,” arXiv preprint arXiv:2506.13131, 2025.
[35]
C. Fernando, D. Banarse, H. Michalewski, S. Osindero, and T. Rocktäschel, “Promptbreeder: Self-referential self-improvement via prompt evolution,” arXiv preprint arXiv:2309.16797, 2023.
[36]
L. A. Agrawal et al., “Gepa: Reflective prompt evolution can outperform reinforcement learning,” arXiv preprint arXiv:2507.19457, 2025.
[37]
J. Oh et al., “Discovering state-of-the-art reinforcement learning algorithms,” Nature, vol. 648, no. 8093, pp. 312–319, 2025.
[38]
B. Zhang, C. Wang, and K. Wu, “EVOM: Agentic meta-evolution of actor-critic architectures for reinforcement learning,” arXiv preprint arXiv:2606.26327, 2026.
[39]
P. Xia et al., “Skillrl: Evolving agents via recursive skill-augmented reinforcement learning,” arXiv preprint arXiv:2602.08234, 2026.
[40]
B. Burger et al., “A mobile robotic chemist,” Nature, vol. 583, no. 7815, pp. 237–241, 2020.
[41]
Z. Xi et al., “Agentgym: Evolving large language model-based agents across diverse environments,” arXiv preprint arXiv:2406.04151, 2024.
[42]
J. Zhang, S. Hu, C. Lu, R. Lange, and J. Clune, “Darwin godel machine: Open-ended evolution of self-improving agents,” arXiv preprint arXiv:2505.22954, 2025.
[43]
A. E. Ghareeb et al., “A multi-agent system for automating scientific discovery,” Nature, pp. 1–3, 2026.
[44]
J. Gottweis et al., “Accelerating scientific discovery with co-scientist,” Nature, pp. 1–3, 2026.
[45]
J. Wei et al., “From ai for science to agentic science: A survey on autonomous scientific discovery,” arXiv preprint arXiv:2508.14111, 2025.
[46]
S. Ren, C. Xie, P. Jian, Z. Ren, C. Leng, and J. Zhang, “Towards scientific intelligence: A survey of llm-based scientific agents,” arXiv preprint arXiv:2503.24047, 2025.
[47]
Q. Chen et al., “Ai4research: A survey of artificial intelligence for scientific research,” arXiv preprint arXiv:2507.01903, 2025.
[48]
Z. Chen et al., “ScienceAgentBench: Toward rigorous assessment of language agents for data-driven scientific discovery,” arXiv preprint arXiv:2410.05080, 2024.
[49]
H. Assumpção, D. Ferreira, L. Campos, and F. Murai, “Codeevolve: An open source evolutionary coding agent for algorithm discovery and optimization,” arXiv preprint arXiv:2510.14150, 2025.
[50]
T. Akiba, M. Shing, Y. Tang, Q. Sun, and D. Ha, “Evolutionary optimization of model merging recipes,” Nature Machine Intelligence, vol. 7, no. 2, pp. 195–204, 2025.
[51]
P. Xia et al., “Agent0: Unleashing self-evolving agents from zero data via tool-integrated reasoning,” arXiv preprint arXiv:2511.16043, 2025.
[52]
C. Lu et al., “Towards end-to-end automation of AI research,” Nature, vol. 651, no. 8107, pp. 914–919, 2026.
[53]
R. Miikkulainen and S. Forrest, “A biological perspective on evolutionary computation,” Nature Machine Intelligence, vol. 3, no. 1, pp. 9–15, 2021.
[54]
B. Sarkar et al., “Evolution strategies at the hyperscale,” arXiv preprint arXiv:2511.16652, 2025.
[55]
P. Larrañaga and C. Bielza, “Estimation of distribution algorithms in machine learning: A survey,” IEEE Transactions on Evolutionary Computation, vol. 28, no. 5, pp. 1301–1321, 2024, doi: 10.1109/TEVC.2023.3314105.
[56]
R. Rubinstein, “The cross-entropy method for combinatorial and continuous optimization,” Methodology and computing in applied probability, vol. 1, no. 2, pp. 127–190, 1999.
[57]
J. Mockus, “The application of bayesian methods for seeking the extremum,” Towards global optimization, vol. 2, p. 117, 1998.
[58]
K. O. Stanley, J. Clune, J. Lehman, and R. Miikkulainen, “Designing neural networks through neuroevolution,” Nature Machine Intelligence, vol. 1, no. 1, pp. 24–35, 2019.
[59]
M. Jaderberg et al., “Population based training of neural networks,” arXiv preprint arXiv:1711.09846, 2017.
[60]
G. Wang et al., “Voyager: An open-ended embodied agent with large language models,” arXiv preprint arXiv:2305.16291, 2023.
[61]
Y. Chu et al., “Programmable RNA translation through deep learning-driven IRES discovery and de novo generation,” Nature Machine Intelligence, vol. 8, no. 4, pp. 559–574, 2026.
[62]
T. Bäck, Evolutionary algorithms in theory and practice: Evolution strategies, evolutionary programming, genetic algorithms. Oxford university press, 1996.
[63]
J. Brest, S. Greiner, B. Boskovic, M. Mernik, and V. Zumer, “Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems,” IEEE transactions on evolutionary computation, vol. 10, no. 6, pp. 646–657, 2006.
[64]
A. Gupta, Y.-S. Ong, and L. Feng, “Multifactorial evolution: Toward evolutionary multitasking,” IEEE Transactions on Evolutionary Computation, vol. 20, no. 3, pp. 343–357, 2015.
[65]
C. Wang, J. Liu, K. Wu, and Z. Wu, “Solving multitask optimization problems with adaptive knowledge transfer via anomaly detection,” IEEE Transactions on Evolutionary Computation, vol. 26, no. 2, pp. 304–318, 2021.
[66]
S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE Transactions on knowledge and data engineering, vol. 22, no. 10, pp. 1345–1359, 2009.
[67]
C. Finn, P. Abbeel, and S. Levine, “Model-agnostic meta-learning for fast adaptation of deep networks,” arXiv preprint arXiv:1703.03400, 2017.
[68]
J. Yosinski, J. Clune, Y. Bengio, and H. Lipson, “How transferable are features in deep neural networks?” Advances in neural information processing systems, vol. 27, 2014.
[69]
E. Aygün et al., “An AI system to help scientists write expert-level empirical software,” Nature, pp. 1–3, 2026.
[70]
J. Schmidhuber, “Gödel machines: Self-referential universal problem solvers making provably optimal self-improvements,” arXiv preprint cs/0309048, 2003.
[71]
K. O. Stanley and R. Miikkulainen, “Evolving neural networks through augmenting topologies,” Evolutionary computation, vol. 10, no. 2, pp. 99–127, 2002.
[72]
J. L. Watson et al., “De novo design of protein structure and function with RFdiffusion,” Nature, vol. 620, no. 7976, pp. 1089–1100, 2023.
[73]
J. Dauparas et al., “Robust deep learning–based protein sequence design using ProteinMPNN,” Science, vol. 378, no. 6615, pp. 49–56, 2022.
[74]
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” International Conference on Machine Learning, pp. 1263–1272, 2017.
[75]
K. T. Schütt, H. E. Sauceda, P.-J. Kindermans, A. Tkatchenko, and K.-R. Müller, “Schnet–a deep learning architecture for molecules and materials,” The Journal of chemical physics, vol. 148, no. 24, 2018.
[76]
I. Batatia, D. P. Kovacs, G. Simm, C. Ortner, and G. Csányi, “MACE: Higher order equivariant message passing neural networks for fast and accurate force fields,” Advances in neural information processing systems, vol. 35, pp. 11423–11436, 2022.
[77]
S. Yao et al., “Tree of thoughts: Deliberate problem solving with large language models,” Advances in neural information processing systems, vol. 36, pp. 11809–11822, 2023.
[78]
T. Schick et al., “Toolformer: Language models can teach themselves to use tools,” Advances in neural information processing systems, vol. 36, pp. 68539–68551, 2023.
[79]
A. Madaan et al., “Self-refine: Iterative refinement with self-feedback,” Advances in neural information processing systems, vol. 36, pp. 46534–46594, 2023.
[80]
K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE transactions on evolutionary computation, vol. 6, no. 2, pp. 182–197, 2002.
[81]
Q. Zhang and H. Li, “MOEA/d: A multiobjective evolutionary algorithm based on decomposition,” IEEE Transactions on evolutionary computation, vol. 11, no. 6, pp. 712–731, 2007.
[82]
M. A. Gelbart, J. Snoek, and R. P. Adams, “Bayesian optimization with unknown constraints,” arXiv preprint arXiv:1403.5607, 2014.
[83]
K. Kandasamy, G. Dasarathy, J. Schneider, and B. Poczos, “Multi-fidelity bayesian optimisation with continuous approximations,” arXiv preprint arXiv:1703.06240, 2017.
[84]
J. M. Stokes et al., “A deep learning approach to antibiotic discovery,” Cell, vol. 180, no. 4, pp. 688–702, 2020.
[85]
F. Häse et al., “Olympus: A benchmarking framework for noisy optimization and experiment planning,” Machine Learning: Science and Technology, vol. 2, no. 3, p. 035021, 2021.
[86]
E. Real, A. Aggarwal, Y. Huang, and Q. V. Le, “Regularized evolution for image classifier architecture search,” Proceedings of the aaai conference on artificial intelligence, vol. 33, no. 1, pp. 4780–4789, 2019.
[87]
L. Li, K. Jamieson, G. DeSalvo, A. Rostamizadeh, and A. Talwalkar, “Hyperband: A novel bandit-based approach to hyperparameter optimization,” Journal of machine learning research, vol. 18, no. 185, pp. 1–52, 2018.
[88]
X. Ye, J. Li, P. Wang, and P. N. Suganthan, “A comprehensive survey of adaptive strategies in differential evolutionary algorithms,” Swarm and Evolutionary Computation, vol. 98, p. 102081, 2025.
[89]
B. J. Shields et al., “Bayesian reaction optimization as a tool for chemical synthesis,” Nature, vol. 590, no. 7844, pp. 89–96, 2021.
[90]
M. Seeger, “Gaussian processes for machine learning,” International journal of neural systems, vol. 14, no. 2, pp. 69–106, 2004.
[91]
J. Snoek, H. Larochelle, and R. P. Adams, “Practical bayesian optimization of machine learning algorithms,” Advances in neural information processing systems, vol. 25, 2012.
[92]
B. Shahriari, K. Swersky, Z. Wang, R. P. Adams, and N. De Freitas, “Taking the human out of the loop: A review of bayesian optimization,” Proceedings of the IEEE, vol. 104, no. 1, pp. 148–175, 2015.
[93]
T. Xie and J. C. Grossman, “Crystal graph convolutional neural networks for an accurate and interpretable prediction of material properties,” Physical review letters, vol. 120, no. 14, p. 145301, 2018.
[94]
S. Batzner et al., “E (3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials,” Nature communications, vol. 13, no. 1, p. 2453, 2022.
[95]
L. Ward, A. Agrawal, A. Choudhary, and C. Wolverton, “A general-purpose machine learning framework for predicting properties of inorganic materials,” npj Computational Materials, vol. 2, no. 1, p. 16028, 2016.
[96]
J. Abramson et al., “Accurate structure prediction of biomolecular interactions with AlphaFold 3,” Nature, vol. 630, no. 8016, pp. 493–500, 2024.
[97]
A. Rives et al., “Biological structure and function emerge from scaling unsupervised learning to 250 million protein sequences,” Proceedings of the national academy of sciences, vol. 118, no. 15, p. e2016239118, 2021.
[98]
Z. Lin et al., “Evolutionary-scale prediction of atomic-level protein structure with a language model,” Science, vol. 379, no. 6637, pp. 1123–1130, 2023.
[99]
M. Baek et al., “Accurate prediction of protein structures and interactions using a three-track neural network,” Science, vol. 373, no. 6557, pp. 871–876, 2021.
[100]
X. Liang et al., “Sage: Self-evolving agents with reflective and memory-augmented abilities,” Neurocomputing, vol. 647, p. 130470, 2025.
[101]
M. Krenn et al., “On scientific understanding with artificial intelligence,” Nature Reviews Physics, vol. 4, no. 12, pp. 761–769, 2022.