A biological perspective on evolutionary computation

A comprehensive review of neurotransmitter modulation via artificial intelligence: A new frontier in personalized neurobiochemistry

The deployment of artificial intelligence (AI) is revolutionizing neuropharmacology and drug development, allowing the modulation of neurotransmitter systems at the personal level. This review focuses on the neuropharmacology and regulation of neurotransmitters using predictive modeling, closed-loop neuromodulation, and precision drug design. The fusion of AI with applications such as machine learning, deep-learning, and even computational modeling allows for the real-time tracking and enhancement of biological processes within the body. An exemplary application of AI is the use of DeepMind's AlphaFold to design new GABA reuptake inhibitors for epilepsy and anxiety. Likewise, Benevolent AI and IBM Watson have fast-tracked drug repositioning for neurodegenerative conditions. Furthermore, we identified new serotonin reuptake inhibitors for depression through AI screening. In addition, the application of Deep Brain Stimulation (DBS) settings using AI for patients with Parkinson's disease and for patients with major depressive disorder (MDD) using reinforcement learning-based transcranial magnetic stimulation (TMS) leads to better treatment. This review highlights other challenges including algorithm bias, ethical concerns, and limited clinical validation. Their proposal to incorporate AI with optogenetics, CRISPR, neuroprosthesis, and other advanced technologies fosters further exploration and refinement of precision neurotherapeutic approaches. By bridging computational neuroscience with clinical applications, AI has the potential to revolutionize neuropharmacology and improve patient-specific treatment strategies. We addressed critical challenges, such as algorithmic bias and ethical concerns, by proposing bias auditing, diverse datasets, explainable AI, and regulatory frameworks as practical solutions to ensure equitable and transparent AI applications in neurotransmitter modulation.

Fish Evo-Devo: Moving Toward Species-Specific and Knowledge-Based Interactome

A knowledge-based interactome maps interactions among proteins and molecules within a cell using experimental data, computational predictions, and literature mining. These interactomes are vital for understanding cellular functions, pathways, and the evolutionary conservation of protein interactions. They reveal how interactions regulate growth, differentiation, and development. Transitioning to functionally validated interactomes is crucial in evolutionary developmental biology (Evo-Devo), especially for non-model species, to uncover unique regulatory networks, evolutionary novelties, and reliable gene interaction models. This enhances our understanding of complex trait evolution across species. The European Evo-Devo 2024 conference in Helsinki hosted the first fish-specific Evo-Devo symposium, highlighting the growing interest in fish models. Advances in genome annotation, genome editing, imaging, and molecular screening are expanding fish Evo-Devo research. High-throughput molecular data have enabled the deduction of gene regulatory networks. The next steps involve creating species-specific interactomes, validating them functionally, and integrating additional molecular data to deepen the understanding of complex regulatory interactions in fish Evo-Devo. This short review aims to address the logical steps for this transition, as well as the necessities and limitations of this journey.

When Large Language Models Meet Evolutionary Algorithms: Potential Enhancements and Challenges

Pre-trained large language models (LLMs) exhibit powerful capabilities for generating natural text. Evolutionary algorithms (EAs) can discover diverse solutions to complex real-world problems. Motivated by the common collective and directionality of text generation and evolution, this paper first illustrates the conceptual parallels between LLMs and EAs at a micro level, which includes multiple one-to-one key characteristics: token representation and individual representation, position encoding and fitness shaping, position embedding and selection, Transformers block and reproduction, and model training and parameter adaptation. These parallels highlight potential opportunities for technical advancements in both LLMs and EAs. Subsequently, we analyze existing interdisciplinary research from a macro perspective to uncover critical challenges, with a particular focus on evolutionary fine-tuning and LLM-enhanced EAs. These analyses not only provide insights into the evolutionary mechanisms behind LLMs but also offer potential directions for enhancing the capabilities of artificial agents.

Collective Neural Dynamics for Sparse Motion Planning of Redundant Manipulators Without Hessian Matrix Inversion

Redundant manipulators have been widely used in various industries whose applications not only improve production efficiency and reduce manual labor but also promote innovation in robotics and artificial intelligence. Kinematic control plays a fundamental and crucial role in robot control. Over the past few decades, numerous motion control schemes have been proposed and applied to trajectory tracking tasks. However, most of these schemes do not consider the introduction of sparsity into the motion control of redundant manipulators, resulting in excessive joint movements, which not only consume extra energy but also increase the risk of unexpected collisions in complex environments. To solve this problem, we transform the issue of increasing the sparsity into a nonconvex optimization problem. Furthermore, a collective neural dynamics for sparse motion planning (CNDSMP) scheme for motion planning of redundant manipulators is proposed. By incorporating sparsity into the control scheme, the excessive joint movements are minimized, leading to improved efficiency and reduced collision risks. Through simulations, comparisons, and physical experiments, the effectiveness and superiority of the proposed scheme are demonstrated.

Evolutionary multi-agent reinforcement learning in group social dilemmas

Reinforcement learning (RL) is a powerful machine learning technique that has been successfully applied to a wide variety of problems. However, it can be unpredictable and produce suboptimal results in complicated learning environments. This is especially true when multiple agents learn simultaneously, which creates a complex system that is often analytically intractable. Our work considers the fundamental framework of Q-learning in public goods games, where RL individuals must work together to achieve a common goal. This setting allows us to study the tragedy of the commons and free-rider effects in artificial intelligence cooperation, an emerging field with potential to resolve challenging obstacles to the wider application of artificial intelligence. While this social dilemma has been mainly investigated through traditional and evolutionary game theory, our work connects these two approaches by studying agents with an intermediate level of intelligence. We consider the influence of learning parameters on cooperation levels in simulations and a limiting system of differential equations, as well as the effect of evolutionary pressures on exploration rate in both of these models. We find selection for higher and lower levels of exploration, as well as attracting values, and a condition that separates these in a restricted class of games. Our work enhances the theoretical understanding of recent techniques that combine evolutionary algorithms with Q-learning and extends our knowledge of the evolution of machine behavior in social dilemmas.

Neuroevolution insights into biological neural computation

This article reviews existing work and future opportunities in neuroevolution, an area of machine learning in which evolutionary optimization methods such as genetic algorithms are used to construct neural networks to achieve desired behavior. The article takes a neuroscience perspective, identifying where neuroevolution can lead to insights about the structure, function, and developmental and evolutionary origins of biological neural circuitry that can be studied in further neuroscience experiments. It proposes optimization under environmental constraints as a unifying theme and suggests the evolution of language as a grand challenge whose time may have come.

Self-organization in computation and chemistry: Return to AlChemy

How do complex adaptive systems, such as life, emerge from simple constituent parts? In the 1990s, Walter Fontana and Leo Buss proposed a novel modeling approach to this question, based on a formal model of computation known as the λ calculus. The model demonstrated how simple rules, embedded in a combinatorially large space of possibilities, could yield complex, dynamically stable organizations, reminiscent of biochemical reaction networks. Here, we revisit this classic model, called AlChemy, which has been understudied over the past 30 years. We reproduce the original results and study the robustness of those results using the greater computing resources available today. Our analysis reveals several unanticipated features of the system, demonstrating a surprising mix of dynamical robustness and fragility. Specifically, we find that complex, stable organizations emerge more frequently than previously expected, that these organizations are robust against collapse into trivial fixed points, but that these stable organizations cannot be easily combined into higher order entities. We also study the role played by the random generators used in the model, characterizing the initial distribution of objects produced by two random expression generators, and their consequences on the results. Finally, we provide a constructive proof that shows how an extension of the model, based on the typed λ calculus, could simulate transitions between arbitrary states in any possible chemical reaction network, thus indicating a concrete connection between AlChemy and chemical reaction networks. We conclude with a discussion of possible applications of AlChemy to self-organization in modern programming languages and quantitative approaches to the origin of life.

Nature-Inspired Intelligent Computing: A Comprehensive Survey

Nature, with its numerous surprising rules, serves as a rich source of creativity for the development of artificial intelligence, inspiring researchers to create several nature-inspired intelligent computing paradigms based on natural mechanisms. Over the past decades, these paradigms have revealed effective and flexible solutions to practical and complex problems. This paper summarizes the natural mechanisms of diverse advanced nature-inspired intelligent computing paradigms, which provide valuable lessons for building general-purpose machines capable of adapting to the environment autonomously. According to the natural mechanisms, we classify nature-inspired intelligent computing paradigms into 4 types: evolutionary-based, biological-based, social-cultural-based, and science-based. Moreover, this paper also illustrates the interrelationship between these paradigms and natural mechanisms, as well as their real-world applications, offering a comprehensive algorithmic foundation for mitigating unreasonable metaphors. Finally, based on the detailed analysis of natural mechanisms, the challenges of current nature-inspired paradigms and promising future research directions are presented.

Mechanistic regulation of planarian shape during growth and degrowth

Adult planarians can grow when fed and degrow (shrink) when starved while maintaining their whole-body shape. It is unknown how the morphogens patterning the planarian axes are coordinated during feeding and starvation or how they modulate the necessary differential tissue growth or degrowth. Here, we investigate the dynamics of planarian shape together with a theoretical study of the mechanisms regulating whole-body proportions and shape. We found that the planarian body proportions scale isometrically following similar linear rates during growth and degrowth, but that fed worms are significantly wider than starved worms. By combining a descriptive model of planarian shape and size with a mechanistic model of anterior-posterior and medio-lateral signaling calibrated with a novel parameter optimization methodology, we theoretically demonstrate that the feedback loop between these positional information signals and the shape they control can regulate the planarian whole-body shape during growth. Furthermore, the computational model produced the correct shape and size dynamics during degrowth as a result of a predicted increase in apoptosis rate and pole signal during starvation. These results offer mechanistic insights into the dynamic regulation of whole-body morphologies.

Using the Grey Wolf Aquila Synergistic Algorithm for Design Problems in Structural Engineering

The Aquila Optimizer (AO) is a metaheuristic algorithm that is inspired by the hunting behavior of the Aquila bird. The AO approach has been proven to perform effectively on a range of benchmark optimization issues. However, the AO algorithm may suffer from limited exploration ability in specific situations. To increase the exploration ability of the AO algorithm, this work offers a hybrid approach that employs the alpha position of the Grey Wolf Optimizer (GWO) to drive the search process of the AO algorithm. At the same time, we applied the quasi-opposition-based learning (QOBL) strategy in each phase of the Aquila Optimizer algorithm. This strategy develops quasi-oppositional solutions to current solutions. The quasi-oppositional solutions are then utilized to direct the search phase of the AO algorithm. The GWO method is also notable for its resistance to noise. This means that it can perform effectively even when the objective function is noisy. The AO algorithm, on the other hand, may be sensitive to noise. By integrating the GWO approach into the AO algorithm, we can strengthen its robustness to noise, and hence, improve its performance in real-world issues. In order to evaluate the effectiveness of the technique, the algorithm was benchmarked on 23 well-known test functions and CEC2017 test functions and compared with other popular metaheuristic algorithms. The findings demonstrate that our proposed method has excellent efficacy. Finally, it was applied to five practical engineering issues, and the results showed that the technique is suitable for tough problems with uncertain search spaces.

Light-driven eco-evolutionary dynamics in a synthetic replicator system

Darwinian evolution involves the inheritance and selection of variations in reproducing entities. Selection can be based on, among others, interactions with the environment. Conversely, the replicating entities can also affect their environment generating a reciprocal feedback on evolutionary dynamics. The onset of such eco-evolutionary dynamics marks a stepping stone in the transition from chemistry to biology. Yet the bottom-up creation of a molecular system that exhibits eco-evolutionary dynamics has remained elusive. Here we describe the onset of such dynamics in a minimal system containing two synthetic self-replicators. The replicators are capable of binding and activating a co-factor, enabling them to change the oxidation state of their environment through photoredox catalysis. The replicator distribution adapts to this change and, depending on light intensity, one or the other replicator becomes dominant. This study shows how behaviour analogous to eco-evolutionary dynamics-which until now has been restricted to biology-can be created using an artificial minimal replicator system.

Bird's Eye View feature selection for high-dimensional data

In machine learning, an informative dataset is crucial for accurate predictions. However, high dimensional data often contains irrelevant features, outliers, and noise, which can negatively impact model performance and consume computational resources. To tackle this challenge, the Bird's Eye View (BEV) feature selection technique is introduced. This approach is inspired by the natural world, where a bird searches for important features in a sparse dataset, similar to how a bird search for sustenance in a sprawling jungle. BEV incorporates elements of Evolutionary Algorithms with a Genetic Algorithm to maintain a population of top-performing agents, Dynamic Markov Chain to steer the movement of agents in the search space, and Reinforcement Learning to reward and penalize agents based on their progress. The proposed strategy in this paper leads to improved classification performance and a reduced number of features compared to conventional methods, as demonstrated by outperforming state-of-the-art feature selection techniques across multiple benchmark datasets.

Maximum Lyapunov exponent-based multiple chaotic slime mold algorithm for real-world optimization

Slime mold algorithm (SMA) is a nature-inspired algorithm that simulates the biological optimization mechanisms and has achieved great results in various complex stochastic optimization problems. Owing to the simulated biological search principle of slime mold, SMA has a unique advantage in global optimization problem. However, it still suffers from issues of missing the optimal solution or collapsing to local optimum when facing complicated problems. To conquer these drawbacks, we consider adding a novel multi-chaotic local operator to the bio-shock feedback mechanism of SMA to compensate for the lack of exploration of the local solution space with the help of the perturbation nature of the chaotic operator. Based on this, we propose an improved algorithm, namely MCSMA, by investigating how to improve the probabilistic selection of chaotic operators based on the maximum Lyapunov exponent (MLE), an inherent property of chaotic maps. We implement the comparison between MCSMA with other state-of-the-art methods on IEEE Congress on Evolution Computation (CEC) i.e., CEC2017 benchmark test suits and CEC2011 practical problems to demonstrate its potency and perform dendritic neuron model training to test the robustness of MCSMA on classification problems. Finally, the parameters' sensitivities of MCSMA, the utilization of the solution space, and the effectiveness of the MLE are adequately discussed.

A review of biowaste remediation and valorization for environmental sustainability: Artificial intelligence approach

Biowaste remediation and valorization for environmental sustainability focuses on prevention rather than cleanup of waste generation by applying the fundamental recovery concept through biowaste-to-bioenergy conversion systems - an appropriate approach in a circular bioeconomy. Biomass waste (biowaste) is discarded organic materials made of biomass (e.g., agriculture waste and algal residue). Biowaste is widely studied as one of the potential feedstocks in the biowaste valorization process due to its being abundantly available. In terms of practical implementations, feedstock variability from biowaste, conversion costs and supply chain stability prevent the widespread usage of bioenergy products. Biowaste remediation and valorization have used artificial intelligence (AI), a newly developed idea, to overcome these difficulties. This report analyzed 118 works that applied various AI algorithms to biowaste remediation and valorization-related research published between 2007 and 2022. Four common AI types are utilized in biowaste remediation and valorization: neural networks, Bayesian networks, decision tree, and multivariate regression. The neural network is the most frequent AI for prediction models, the Bayesian network is utilized for probabilistic graphical models, and the decision tree is trusted for providing tools to assist decision-making. Meanwhile, multivariate regression is employed to identify the relationship between experimental variables. AI is a remarkably effective tool in predicting data, which is reportedly better than the conventional approach owing to its characteristics of time-saving and high accuracy. The challenge and future work in biowaste remediation and valorization are briefly discussed to maximize the model's performance.

ARMO: automated and reliable multi-objective model for lymph node metastasis prediction in head and neck cancer

Objective. Accurate diagnosis of lymph node metastasis (LNM) is critical in treatment management for patients with head and neck cancer. Positron emission tomography and computed tomography are routinely used for identifying LNM status. However, for small or less fluorodeoxyglucose (FDG) avid nodes, there are always uncertainties in LNM diagnosis. We are aiming to develop a reliable prediction model is for identifying LNM.Approach. In this study, a new automated and reliable multi-objective learning model (ARMO) is proposed. In ARMO, a multi-objective model is introduced to obtain balanced sensitivity and specificity. Meanwhile, confidence is calibrated by introducing individual reliability, whilst the model uncertainty is estimated by a newly defined overall reliability in ARMO. In the training stage, a Pareto-optimal model set is generated. Then all the Pareto-optimal models are used, and a reliable fusion strategy that introduces individual reliability is developed for calibrating the confidence of each output. The overall reliability is calculated to estimate the model uncertainty for each test sample.Main results. The experimental results demonstrated that ARMO obtained more promising results, which the area under the curve, accuracy, sensitivity and specificity can achieve 0.97, 0.93, 0.88 and 0.94, respectively. Meanwhile, based on calibrated confidence and overall reliability, clinicians could pay particular attention to highly uncertain predictions.Significance. In this study, we developed a unified model that can achieve balanced prediction, confidence calibration and uncertainty estimation simultaneously. The experimental results demonstrated that ARMO can obtain accurate and reliable prediction performance.

Evolutionary Process for Engineering Optimization in Manufacturing Applications: Fine Brushworks of Single-Objective to Multi-Objective/Many-Objective Optimization

Single-objective to multi-objective/many-objective optimization (SMO) is a new paradigm in the evolutionary transfer optimization (ETO), since there are only “1 + 4” pioneering works on SMOs so far, that is, “1” is continuous and is firstly performed by Professors L. Feng and H.D. Wang, and “4” are firstly proposed by our group for discrete cases. As a new computational paradigm, theoretical insights into SMOs are relatively rare now. Therefore, we present a proposal on the fine brushworks of SMOs for theoretical advances here, which is based on a case study of a permutation flow shop scheduling problem (PFSP) in manufacturing systems via lenses of building blocks, transferring gaps, auxiliary task and asynchronous rhythms. The empirical studies on well-studied benchmarks enrich the rough strokes of SMOs and guide future designs and practices in ETO based manufacturing scheduling, and even ETO based evolutionary processes for engineering optimization in other cases.

Exploring genetic influences on adverse outcome pathways using heuristic simulation and graph data science

Adverse outcome pathways provide a powerful tool for understanding the biological signaling cascades that lead to disease outcomes following toxicity. The framework outlines downstream responses known as key events, culminating in a clinically significant adverse outcome as a final result of the toxic exposure. Here we use the AOP framework combined with artificial intelligence methods to gain novel insights into genetic mechanisms that underlie toxicity-mediated adverse health outcomes. Specifically, we focus on liver cancer as a case study with diverse underlying mechanisms that are clinically significant. Our approach uses two complementary AI techniques: Generative modeling via automated machine learning and genetic algorithms, and graph machine learning. We used data from the US Environmental Protection Agency's Adverse Outcome Pathway Database (AOP-DB; aopdb.epa.gov) and the UK Biobank's genetic data repository. We use the AOP-DB to extract disease-specific AOPs and build graph neural networks used in our final analyses. We use the UK Biobank to retrieve real-world genotype and phenotype data, where genotypes are based on single nucleotide polymorphism data extracted from the AOP-DB, and phenotypes are case/control cohorts for the disease of interest (liver cancer) corresponding to those adverse outcome pathways. We also use propensity score matching to appropriately sample based on important covariates (demographics, comorbidities, and social deprivation indices) and to balance the case and control populations in our machine language training/testing datasets. Finally, we describe a novel putative risk factor for LC that depends on genetic variation in both the aryl-hydrocarbon receptor (AHR) and ATP binding cassette subfamily B member 11 (ABCB11) genes.

Chaotic Wind Driven Optimization with Fitness Distance Balance Strategy

Wind driven optimization (WDO) is a meta-heuristic algorithm based on swarm intelligence. The original selection method makes it easy to converge prematurely and trap in local optima. Maintaining population diversity can solve this problem well. Therefore, we introduce a new fitness-distance balance-based selection strategy to replace the original selection method, and add chaotic local search with selecting chaotic map based on memory to further improve the search performance of the algorithm. A chaotic wind driven optimization with fitness-distance balance strategy is proposed, called CFDBWDO. In the experimental section, we find the optimal parameter settings for the proposed algorithm. To verify the effect of the algorithm, we conduct comparative experiments on the CEC 2017 benchmark functions. The experimental results denote that the proposed algorithm has superior performance. Compared with WDO, CFDBWDO can gradually converge in function optimization. We further verify the practicality of the proposed algorithm with six real-world optimization problems, and the obtained results are all better than other algorithms.

Subpopulation-specific machine learning prognosis for underrepresented patients with double prioritized bias correction

Background

Many clinical datasets are intrinsically imbalanced, dominated by overwhelming majority groups. Off-the-shelf machine learning models that optimize the prognosis of majority patient types (e.g., healthy class) may cause substantial errors on the minority prediction class (e.g., disease class) and demographic subgroups (e.g., Black or young patients). In the typical one-machine-learning-model-fits-all paradigm, racial and age disparities are likely to exist, but unreported. In addition, some widely used whole-population metrics give misleading results.

Methods

We design a double prioritized (DP) bias correction technique to mitigate representational biases in machine learning-based prognosis. Our method trains customized machine learning models for specific ethnicity or age groups, a substantial departure from the one-model-predicts-all convention. We compare with other sampling and reweighting techniques in mortality and cancer survivability prediction tasks.

Results

We first provide empirical evidence showing various prediction deficiencies in a typical machine learning setting without bias correction. For example, missed death cases are 3.14 times higher than missed survival cases for mortality prediction. Then, we show DP consistently boosts the minority class recall for underrepresented groups, by up to 38.0%. DP also reduces relative disparities across race and age groups, e.g., up to 88.0% better than the 8 existing sampling solutions in terms of the relative disparity of minority class recall. Cross-race and cross-age-group evaluation also suggests the need for subpopulation-specific machine learning models.

Conclusions

Biases exist in the widely accepted one-machine-learning-model-fits-all-population approach. We invent a bias correction method that produces specialized machine learning prognostication models for underrepresented racial and age groups. This technique may reduce potentially life-threatening prediction mistakes for minority populations.