Search NASA⌕ Search

SEARCH · Search NASA

Results for “evolutionary computation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

Natural evolutionary strategies for variational quantum computation

Abstract Natural evolutionary strategies (NES) are a family of gradient-free black-box optimization algorithms. This study illustrates their use for the optimization of randomly initialized parameterized quantum circuits (PQCs) in the region of vanishing gradients. We show that using the NES gradient estimator the exponential decrease in variance can be alleviated. We implement two specific approaches, the exponential and separable NES, for parameter optimization of PQCs and compare them against standard gradient descent. We apply them to two different problems of ground state energy estimation using variational quantum eigensolver and state preparation with circuits of varying depth and length. We also introduce batch optimization for circuits with larger depth to extend the use of ES to a larger number of parameters. We achieve accuracy comparable to state-of-the-art optimization techniques in all the above cases with a lower number of circuit evaluations. Our empirical results indicate that one can use NES as a hybrid tool in tandem with other gradient-based methods for optimization of deep quantum circuits in regions with vanishing gradients.

Anand, Abhinav (ORCID:0000000280812310)↗

Avoiding excess computation in asynchronous evolutionary algorithms

Abstract Asynchronous evolutionary algorithms are becoming increasingly popular as a means of making full use of many processors while solving computationally expensive search and optimization problems. These algorithms excel at keeping large clusters fully utilized, but may sometimes inefficiently sample an excess of fast‐evaluating solutions at the expense of higher‐quality, slow‐evaluating ones. We have previously introduced a steady‐state parent selection strategy, SWEET (“Selection whilE EvaluaTing”), that sometimes selects individuals that are still being evaluated and allows them to reproduce early. We perform a takeover‐time analysis that confirms that this strategy gives slow‐evaluating individuals that have higher fitnesses an increased ability to multiply in the population. We also find that SWEET appears effective at improving optimization performance on problems in which solution quality is positively correlated with evaluation time. We evaluate our approach on six simulated real‐valued optimization problems and three real‐world applications: an autonomous vehicle controller problem that involves tuning a spiking neural network and two adversarial EA problems. We further evaluate SWEET versus a basic asynchronous process in a simulated setting. We present evidence that SWEET outperforms basic asynchronous processes in a use‐case in which performance is positively correlated with evaluation time, and performs comparably (and often better) than basic asynchronous processes in several use‐cases where performance is negatively correlated with evaluation time. That said, in the cases where performance and evaluation time are negatively correlated the variance of outcomes for SWEET is notably high.

97 MATHEMATICS AND COMPUTING↗

Avoiding Excess Computation in Asynchronous Evolutionary Algorithms

Asynchronous evolutionary algorithms are becoming increasingly popular as a means of making full use of many processors while solving computationally expensive search and optimization problems. These algorithms excel at keeping large clusters fully utilized, but may sometimes inefficiently sample an excess of fast-evaluating solutions at the expense of higher-quality, slow-evaluating ones. We introduce a steady-state parent selection strategy, SWEET (“Selection whilE EvaluaTing”), that sometimes selects individuals that are still being evaluated and allows them to reproduce early. This gives slow-evaluating individuals that have higher fitnesses an increased ability to multiply in the population. We find that SWEET appears effective in simulated take-over time analysis, but that its benefit is confined mostly to early in the run, and our preliminary study on an autonomous vehicle controller problem that involves tuning a spiking neural network proves inconclusive.

Scott, Eric↗

Computational Modeling and Evolutionary Implications of Biochemical Reactions in Bacterial Microcompartments

Bacterial microcompartments (BMCs) are protein-encapsulated compartments found across at least 23 bacterial phyla. BMCs contain a variety of metabolic processes that share the commonality of toxic or volatile intermediates, oxygen-sensitive enzymes and cofactors, or increased substrate concentration for magnified reaction rates. These compartmentalized reactions have been computationally modeled to explore the encapsulated dynamics, ask evolutionary-based questions, and develop a more systematic understanding required for the engineering of novel BMCs. Many crucial aspects of these systems remain unknown or unmeasured, such as substrate permeabilities across the protein shell, feasibility of pH gradients, and transport rates of associated substrates into the cell. This review explores existing BMC models, dominated in the literature by cyanobacterial carboxysomes, and highlights potentially important areas for exploration.

bacterial microcompartments↗

RANGE: A robust adaptive nature-inspired global explorer of potential energy surfaces

With the growing demand for realistic representations of chemical structures and the advent of exascale computing, the intelligent sampling of potential energy surfaces and efficient identification of global minima have become more essential but also more feasible. Building on prior studies demonstrating the efficiency of the Artificial Bee Colony (ABC) swarm intelligence algorithm, we report a hybrid metaheuristic framework that integrates the adaptive exploration capabilities of ABC coupled with the exploitation strengths of genetic algorithms (GA) in a scalable, Python-based implementation. The resulting tool, RANGE (Robust Adaptive Nature-inspired Global Explorer), provides seamless interfaces to multiple potential energy evaluators, either directly or via widely used Python libraries, and is designed for high-performance computing environments. We describe the implementation details of RANGE and evaluate its performance, relative to ABC- or GA-alone based algorithms, on a variety of chemical systems, including molecular clusters and heterogeneous surfaces. In conclusion, our results demonstrate RANGE’s efficiency, robustness, and broad applicability in addressing challenging global optimization problems in computational chemistry and materials science.

Algorithms and data structure↗

Inverse design of pore wall chemistry and topology through active learning of surface group interactions

Design of next-generation membranes requires a nanoscopic understanding of the effect of biologically inspired heterogeneous surface chemistries and topologies (roughness) on local water and solute behavior. In particular, the rejection of small, neutral solutes, such as boric acid, poses a heretofore unsolved challenge. In prior work, a computational inverse design technique using an evolutionary optimization successfully uncovered new surface design strategies for optimized transport of water over solutes in smooth, model pores consisting of two surface chemistries. However, extending such an approach to more complex (and realistic) scenarios involving many surface chemistries as well as surface roughness is challenging due to the expanded design space. In this work, we develop a new approach that uses active learning to optimize in a reduced feature space of surface group interactions, finding parameters that lead to their assembly into ordered, optimal patterns. This approach rapidly identifies novel surface functionalizations that maximize the difference in water and boric acid transport through the nanopore. Moreover, we find that the roughness of the nanopore wall, independent of its chemistry, can be leveraged to enhance transport selectivity: oscillations in the pore wall diameter optimally inhibit boric acid transport by creating energetic wells from which the solute must escape to transport down the pore. Furthermore, this proof-of-concept demonstrates the potential for active learning strategies, in concert with molecular simulations, to rapidly navigate complex design spaces of aqueous interfaces and is promising as a tool for engineering water-mediated surface interactions for a broad range of applications.

36 MATERIALS SCIENCE↗

Magnetic borophenes from an evolutionary search

A computational methodology based on ab initio evolutionary algorithms and spin-polarized density functional theory was developed to predict two-dimensional magnetic materials. Its application to a model system borophene reveals an unexpected rich magnetism and polymorphism. A metastable borophene with nonzero thickness is an antiferromagnetic semiconductor from first-principles calculations, and can be further tuned into a half-metal by finite electron doping. In this borophene, the buckling and coupling among three atomic layers are not only responsible for magnetism, but also result in an out-of-plane negative Poisson's ratio under uniaxial tension, making it the first elemental material possessing auxetic and magnetic properties simultaneously.

2-dimensional systems↗

Evolutionary Architecture Search for Generative Adversarial Networks Based on Weight Sharing

Generative adversarial networks (GANs) are a powerful generative technique but frequently face challenges with training stability. Network architecture plays a significant role in determining the final output of GANs, but designing a fine architecture demands extensive domain expertise. This article aims to address this issue by searching for high-performance generator’s architectures through neural architecture search (NAS). The proposed approach, called evolutionary weight sharing GANs (EWSGAN), is based on weight sharing and comprises two steps. First, a supernet of the generator is trained using weight sharing. Second, a multiobjective evolutionary algorithm (MOEA) is employed to identify optimal subnets from the supernet. These subnets inherit weights directly from the supernet for fitness assessment. Two strategies are used to stabilize the training of the generator supernet: 1) a fair single-path sampling strategy and 2) a discarding strategy. Experimental results indicate that the architecture searched by our method achieved a new state-of-the-art among NAS–GAN methods with a Fréchet inception distance (FID) of 9.09 and an inception score (IS) of 8.99 on the CIFAR-10 dataset. Finally, it also demonstrates competitive performance on the STL-10 dataset, achieving FID of 21.89 and IS of 10.51.

97 MATHEMATICS AND COMPUTING↗

Reconstructing magnetic deflections from sets of proton images using differential evolution

Proton imaging is a powerful technique for imaging electromagnetic fields within an experimental volume, in which spatial variations in proton fluence are a result of deflections to proton trajectories due to interaction with the fields. When deflections are large, proton trajectories can overlap, and this nonlinearity creates regions of greatly increased proton fluence on the image, known as caustics. The formation of caustics has been a persistent barrier to reconstructing the underlying fields from proton images. We have developed a new method for reconstructing the path-integrated magnetic fields, which begins to address the problem posed by caustics. Our method uses multiple proton images of the same object, each image at a different energy, to fill in the information gaps and provide some uniqueness when reconstructing caustic features. We use a differential evolution algorithm to iteratively estimate the underlying deflection function, which accurately reproduces the observed proton fluence at multiple proton energies simultaneously. We test this reconstruction method using synthetic proton images generated for three different, cylindrically symmetric field geometries at various field amplitudes and levels of proton statistics and present reconstruction results from a set of experimental images. Here, the method we propose requires no assumption of deflection linearity and can reliably solve for fields underlying linear, nonlinear, and caustic proton image features for the selected geometries and is shown to be fairly robust to noise in the input proton intensity.

47 OTHER INSTRUMENTATION↗

Determining best practices for using genetic algorithms in molecular discovery

Genetic algorithms (GAs) are a powerful tool to search large chemical spaces for inverse molecular design. However, GAs have multiple hyperparameters that have not been thoroughly investigated for chemical space searches. In this tutorial, we examine the general effects of a number of hyperparameters, such as population size, elitism rate, selection method, mutation rate, and convergence criteria, on key GA performance metrics. Here, we show that using a self-termination method with a minimum Spearman’s rank correlation coefficient of 0.8 between generations maintained for 50 consecutive generations along with a population size of 32, a 50% elitism rate, three-way tournament selection, and a 40% mutation rate provides the best balance of finding the overall champion, maintaining good coverage of elite targets, and improving relative speedup for general use in molecular design GAs.

36 MATERIALS SCIENCE↗

A Distance Measure Comparison to Improve Crowding in Multi-Modal Problems.

Solving multi-modal optimization problems are of interest to researchers solving real world problems in areas such as control systems and power engineering tasks. Extensions of simple Genetic Algorithms, particularly types of crowding, have been developed to help solve these types of problems. This paper examines the performance of two distance measures, Mahalanobis and Euclidean, exercised in the processing of two different crowding type implementations against five minimization functions. Within the context of the experiments, empirical evidence shows that the statistical based Mahalanobis distance measure when used in Deterministic Crowding produces equivalent results to a Euclidean measure. In the case of Restricted Tournament selection, use of Mahalanobis found on average 40% more of the global optimum, maintained a 35% higher peak count and produced an average final best fitness value that is 3 times better.

97 MATHEMATICS AND COMPUTING↗

Scalable tuning of building models to hourly data

Energy models of existing buildings are unreliable unless calibrated so they correlate well with actual energy usage. Manual tuning requires a skilled professional, is prohibitively expensive for small projects, imperfect, non-repeatable, non-transferable, and not scalable to the dozens of sensor channels that smart meters, smart appliances, and cheap/ubiquitous sensors are beginning to make available today. A scalable, automated methodology is needed to quickly and intelligently calibrate building energy models to all available data, increase the usefulness of those models, and facilitate speed-and-scale penetration of simulation-based capabilities into the marketplace for actualized energy savings. The "Autotune'' project is a novel, model-agnostic methodology which leverages supercomputing, large simulation ensembles, and big data mining with multiple machine learning algorithms to allow automatic calibration of simulations that match measured experimental data in a way that is deployable on commodity hardware. This paper shares several methodologies employed to reduce the combinatorial complexity to a computationally tractable search problem for hundreds of input parameters. Furthermore, accuracy metrics are provided which quantify model error to measured data for either monthly or hourly electrical usage from a highly-instrumented, emulated-occupancy research home.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A LIBRARY OF THEORETICAL ULTRAVIOLET SPECTRA OF MASSIVE, HOT STARS FOR EVOLUTIONARY SYNTHESIS

We computed a comprehensive set of theoretical ultraviolet spectra of hot, massive stars with the radiation-hydrodynamics code WM-Basic. This model atmosphere and spectral synthesis code is optimized for computing the strong P Cygni type lines originating in the winds of hot stars, which are the strongest features in the ultraviolet spectral region. The computed set is suitable as a spectral library for inclusion in evolutionary synthesis models of star clusters and star-forming galaxies. The chosen stellar parameters cover the upper left Hertzsprung-Russell diagram at L {approx}> 10{sup 2.75} L {sub sun} and T {sub eff} {approx}> 20,000 K. The adopted elemental abundances are 0.05 Z {sub sun}, 0.2 Z {sub sun}, 0.4 Z {sub sun}, Z {sub sun}, and 2 Z {sub sun}. The spectra cover the wavelength range from 900 to 3000 A and have a resolution of 0.4 A. We compared the theoretical spectra to data of individual hot stars in the Galaxy and the Magellanic Clouds obtained with the International Ultraviolet Explorer and Far Ultraviolet Spectroscopic Explorer satellites and found very good agreement. We built a library with the set of spectra and implemented it into the evolutionary synthesis code Starburst99 where it complements and extends the existing empirical library toward lower chemical abundances. Comparison of population synthesis models at solar and near-solar composition demonstrates consistency between synthetic spectra generated with either library. We discuss the potential of the new library for the interpretation of the rest-frame ultraviolet spectra of star-forming galaxies. Properties that can be addressed with the models include ages, initial mass function, and heavy-element abundance. The library can be obtained both individually or as part of the Starburst99 package.

79 ASTRONOMY AND ASTROPHYSICS↗

ANALYTICAL EXPRESSIONS FOR THE ENVELOPE BINDING ENERGY OF GIANTS AS A FUNCTION OF BASIC STELLAR PARAMETERS

The common-envelope (CE) phase is an important stage in the evolution of binary stellar populations. The most common way to compute the change in orbital period during a CE is to relate the binding energy of the envelope of the Roche-lobe filling giant to the change in orbital energy. Especially in population-synthesis codes, where the evolution of millions of stars must be computed and detailed evolutionary models are too expensive computationally, simple approximations are made for the envelope binding energy. In this study, we present accurate analytic prescriptions based on detailed stellar-evolution models that provide the envelope binding energy for giants with metallicities between Z = 10{sup -4} and Z = 0.03 and masses between 0.8 M{sub Sun} and 100 M{sub Sun }, as a function of the metallicity, mass, radius, and evolutionary phase of the star. Our results are also presented in the form of electronic data tables and Fortran routines that use them. We find that the accuracy of our fits is better than 15% for 90% of our model data points in all cases, and better than 10% for 90% of our data points in all cases except the asymptotic giant branches for three of the six metallicities we consider. For very massive stars (M {approx}> 50 M{sub Sun }), when stars lose more than {approx}20% of their initial mass due to stellar winds, our fits do not describe the models as accurately. Our results are more widely applicable-covering wider ranges of metallicity and mass-and are of higher accuracy than those of previous studies.

79 ASTRONOMY AND ASTROPHYSICS↗

Multi-objective optimization of root phenotypes for nutrient capture using evolutionary algorithms

Root phenotypes are avenues to the development of crop cultivars with improved nutrient capture, which is an important goal for global agriculture. The fitness landscape of root phenotypes is highly complex and multidimensional. It is difficult to predict which combinations of traits (phene states) will create the best performing integrated phenotypes in various environments. Brute force methods to map the fitness landscape by simulating millions of phenotypes in multiple environments are computationally challenging. Evolutionary optimization algorithms may provide more efficient avenues to explore high dimensional domains such as the root phenotypic space. We coupled the three-dimensional functional–structural plant model, SimRoot, to the Borg Multi-Objective Evolutionary Algorithm (MOEA) and the evolutionary search over several generations facilitated the identification of optimal root phenotypes balancing trade-offs across nutrient uptake, biomass accumulation, and root carbon costs in environments varying in nutrient availability. Our results show that several combinations of root phenes generate optimal integrated phenotypes where performance in one objective comes at the cost of reduced performance in one or more of the remaining objectives, and such combinations differed for mobile and non-mobile nutrients and for maize (a monocot) and bean (a dicot). Functional–structural plant models can be used with multi-objective optimization to identify optimal root phenotypes under various environments, including future climate scenarios, which will be useful in developing the more resilient, efficient crops urgently needed in global agriculture.

59 BASIC BIOLOGICAL SCIENCES↗

A parallel evolutionary multiple-try metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large, complex, and constrained spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hastings ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel computing architecture through the integration of a parallel EA framework that guides Markov chains running in parallel.

97 MATHEMATICS AND COMPUTING↗

Stationary stability for evolutionary dynamics in finite populations

Here, we demonstrate a vast expansion of the theory of evolutionary stability to finite populations with mutation, connecting the theory of the stationary distribution of the Moran process with the Lyapunov theory of evolutionary stability. We define the notion of stationary stability for the Moran process with mutation and generalizations, as well as a generalized notion of evolutionary stability that includes mutation called an incentive stable state (ISS) candidate. For sufficiently large populations, extrema of the stationary distribution are ISS candidates and we give a family of Lyapunov quantities that are locally minimized at the stationary extrema and at ISS candidates. In various examples, including for the Moran andWright–Fisher processes, we show that the local maxima of the stationary distribution capture the traditionally-defined evolutionarily stable states. The classical stability theory of the replicator dynamic is recovered in the large population limit. Finally we include descriptions of possible extensions to populations of variable size and populations evolving on graphs.

60 APPLIED LIFE SCIENCES↗

Computational evolution of high-performing unfused non-fullerene acceptors for organic solar cells

Materials optimization for organic solar cells (OSCs) is a highly active field, with many approaches using empirical experimental synthesis, computational brute force to screen a subset of chemical space, or generative machine learning methods that often require significant training sets. While these methods may find high-performing materials, they can be inefficient and time-consuming. Genetic algorithms (GAs) are an alternative approach, allowing for the “virtual synthesis” of molecules and a prediction of their “fitness” for some property, with new candidates suggested based on good characteristics of previously generated molecules. In this work, a GA is used to discover high-performing unfused non-fullerene acceptors (NFAs) based on an empirical prediction of power conversion efficiency (PCE) and provides design rules for future work. The electron-withdrawing/donating strength, as well as the sequence and symmetry, of those units are examined. The utilization of a GA over a brute-force approach resulted in speedups up to 1.8 × 10 12 . New types of units, not frequently seen in OSCs, are suggested, and in total 5426 NFAs are discovered with the GA. Of these, 1087 NFAs are predicted to have a PCE greater than 18%, which is roughly the current record efficiency. While the symmetry of the sequence showed no correlation with PCE, analysis of the sequence arrangement revealed that higher performance can be achieved with a donor core and acceptor end groups. Future NFA designs should consider this strategy as an alternative to the current A-D-A'-D-A architecture.

14 SOLAR ENERGY↗