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 55 records · Page 3

In-Space Radiator Shape Optimization using Genetic Algorithms

Future space exploration missions will require the development of more advanced in-space radiators. These radiators should be highly efficient and lightweight, deployable heat rejection systems. Typical radiators for in-space heat mitigation commonly comprise a substantial portion of the total vehicle mass. A small mass savings of even 5-10% can greatly improve vehicle performance. The objective of this paper is to present the development of detailed tools for the analysis and design of in-space radiators using evolutionary computation techniques. The optimality criterion is defined as a two-dimensional radiator with a shape demonstrating the smallest mass for the greatest overall heat transfer, thus the end result is a set of highly functional radiator designs. This cross-disciplinary work combines topology optimization and thermal analysis design by means of a genetic algorithm The proposed design tool consists of the following steps; design parameterization based on the exterior boundary of the radiator, objective function definition (mass minimization and heat loss maximization), objective function evaluation via finite element analysis (thermal radiation analysis) and optimization based on evolutionary algorithms. The radiator design problem is defined as follows: the input force is a driving temperature and the output reaction is heat loss. Appropriate modeling of the space environment is added to capture its effect on the radiator. The design parameters chosen for this radiator shape optimization problem fall into two classes, variable height along the width of the radiator and a spline curve defining the -material boundary of the radiator. The implementation of multiple design parameter schemes allows the user to have more confidence in the radiator optimization tool upon demonstration of convergence between the two design parameter schemes. This tool easily allows the user to manipulate the driving temperature regions thus permitting detailed design of in-space radiators for unique situations. Preliminary results indicate an optimized shape following that of the temperature distribution regions in the "cooler" portions of the radiator. The results closely follow the expected radiator shape.

Hull, Patrick V.↗

Computing Sensitivities in Evolutionary Systems: A Real-time Reduced Order Modeling Strategy

We present a new methodology for computing sensitivities in evolutionary systems using a model-driven low-rank approximation. To this end, we formulate a variational principle that seeks to minimize the distance between the time derivative of the reduced approximation and sensitivity dynamics. The first order optimality condition of the variational principle leads to a system of closed form evolution equations for an orthonormal basis and corresponding sensitivity coefficients. This approach allows for the computation of sensitivities with respect to a large number of parameters in an accurate and tractable manner by extracting correlations between different sensitivities on the fly. The presented method requires solving forward evolution equations, sidestepping the restrictions imposed by the forward/backward workflow of adjoint sensitivities. For example, the presented method, unlike the adjoint equation, does not impose any input/output load and can be used in applications in which real-time sensitivities are of interest. We demonstrate the utility of the method for three test cases: (1) computing sensitivity with respect to model parameters in the Rössler system, (2) computing sensitivity with respect to an infinite-dimensional forcing parameter in the chaotic Kuramoto--Sivashinsky equation, and (3) computing sensitivity with respect to reaction parameters for species transport in a turbulent reacting flow.

Reduced order model↗

Application of Learning Machines and Combinatorial Algorithms in Water Resources Management and Hydrologic Sciences

Contemporary and water resources engineering and management rely increasingly on pattern recognition techniques that have the ability to capitalize on the unrelenting accumulation of data that is made possible by modern information technology and remote sensing methods. In response to the growing information needs of modern water systems, advanced computational models and tools have been devised to identify and extract relevant information from the mass of data that is now available. This chapter presents innovative applications from computational learning science within the fields of hydrology, hydrogeology, hydroclimatology, and water management. The success of machine learning is evident from the growing number of studies involving the application of Artificial Neural Networks (ANN), Support Vector Machines (SVM), Relevance Vector Machines (RVM), and Locally Weighted Projection Regression (LWPR) to address various issues in hydrologic sciences. The applications that will be discussed within the chapter employ the abovementioned machine learning techniques for intelligent modeling of reservoir operations, temporal downscaling of precipitation, spatial downscaling of soil moisture and evapotranspiration, comparisons of various techniques for groundwater quality modeling, and forecasting of chaotic time series behavior. Combinatorial algorithms to capture the intrinsic complexities in the modeled phenomena and to overcome disparate scales are developed; for example, learning machines have been coupled with geostatistical techniques, non-homogenous hidden Markov models, wavelets, and evolutionary computing techniques. This chapter does not intend to be exhaustive; it reviews the progress that has been made over the past decade in the use of learning machines in applied hydrologic sciences and presents a summary of future needs and challenges for further advancement of these methods.

54 ENVIRONMENTAL SCIENCES↗

Sepsis reconsidered: Identifying novel metrics for behavioral landscape characterization with a high-performance computing implementation of an agent-based model

Objectives: Sepsis affects nearly 1 million people in the United States per year, has a mortality rate of 28–50% and requires more than $20 billion a year in hospital costs. Over a quarter century of research has not yielded a single reliable diagnostic test or a directed therapeutic agent for sepsis. Central to this insufficiency is the fact that sepsis remains a clinical/physiological diagnosis representing a multitude of molecularly heterogeneous pathological trajectories. Advances in computational capabilities offered by High Peformance Computing (HPC) platforms call for an evolution in the investigation of sepsis to attempt to define the boundaries of traditional research (bench, clinical and computational) through the use of computational proxy models. We present a novel investigatory and analytical approach, derived from how HPC resources and simulation are used in the physical sciences, to identify the epistemic boundary con- ditions of the study of clinical sepsis via the use of a proxy agent-based model of systemic inflammation. Design: Current predictive models for sepsis use correlative methods that are limited by patient heterogeneity and data sparseness. We address this issue by using an HPC version of a system-level validated agent-based model of sepsis, the Innate Immune Response ABM (IIRBM), as a proxy system in order to identify boundary conditions for the possible behavioral space for sepsis. We then apply advanced analysis derived from the study of Random Dynamical Systems (RDS) to identify novel means for characterizing system behavior and providing insight into the tractability of traditional investigatory methods. Results: The behavior space of the IIRABM was examined by simulating over 70 million sepsis patients for up to 90 days in a sweep across the following parameters: cardio-respiratory-metabolic resilience; microbial invasiveness; microbial toxigenesis; and degree of nosocomial exposure. In addition to using established methods for describing parameter space, we developed two novel methods for characterizing the behavior of a RDS: Probabilistic Basins of Attraction (PBoA) and Stochastic Trajectory Analysis (STA). Computationally generated behavioral landscapes demonstrated attractor structures around stochastic re- gions of behavior that could be described in a complementary fashion through use of PBoA and STA. The stochasticity of the boundaries of the attractors highlights the challenge for correlative attempts to characterize and classify clinical sepsis. Conclusions: HPC simulations of models like the IIRABM can be used to generate approximations of the behavior space of sepsis to both establish “boundaries of futility” with respect to existing investi- gatory approaches and apply system engineering principles to investigate the general dynamic properties of sepsis to provide a pathway for developing control strategies. Here, the issues that bedevil the study and treatment of sepsis, namely clinical data sparseness and inadequate experimental sampling of system behavior space, are fundamental to nearly all biomedical research, manifesting in the “Crisis of Reproducibility” at all levels. HPC-augmented simulation-based research offers an investigatory strategy more consistent with that seen in the physical sciences (which combine experiment, theory and simulation), and an opportunity to utilize the leading advances in HPC, namely deep machine learning and evolutionary computing, to form the basis of an iterative scientific process to meet the full promise of Precision Medicine (right drug, right patient, right time).

59 BASIC BIOLOGICAL SCIENCES↗

The role of optimality in characterizing CO2 seepage from geological carbon sequestration sites

Storage of large amounts of carbon dioxide (CO{sub 2}) in deep geological formations for greenhouse gas mitigation is gaining momentum and moving from its conceptual and testing stages towards widespread application. In this work we explore various optimization strategies for characterizing surface leakage (seepage) using near-surface measurement approaches such as accumulation chambers and eddy covariance towers. Seepage characterization objectives and limitations need to be defined carefully from the outset especially in light of large natural background variations that can mask seepage. The cost and sensitivity of seepage detection are related to four critical length scales pertaining to the size of the: (1) region that needs to be monitored; (2) footprint of the measurement approach, and (3) main seepage zone; and (4) region in which concentrations or fluxes are influenced by seepage. Seepage characterization objectives may include one or all of the tasks of detecting, locating, and quantifying seepage. Each of these tasks has its own optimal strategy. Detecting and locating seepage in a region in which there is no expected or preferred location for seepage nor existing evidence for seepage requires monitoring on a fixed grid, e.g., using eddy covariance towers. The fixed-grid approaches needed to detect seepage are expected to require large numbers of eddy covariance towers for large-scale geologic CO{sub 2} storage. Once seepage has been detected and roughly located, seepage zones and features can be optimally pinpointed through a dynamic search strategy, e.g., employing accumulation chambers and/or soil-gas sampling. Quantification of seepage rates can be done through measurements on a localized fixed grid once the seepage is pinpointed. Background measurements are essential for seepage detection in natural ecosystems. Artificial neural networks are considered as regression models useful for distinguishing natural system behavior from anomalous behavior suggestive of CO{sub 2} seepage without need for detailed understanding of natural system processes. Because of the local extrema in CO{sub 2} fluxes and concentrations in natural systems, simple steepest-descent algorithms are not effective and evolutionary computation algorithms are proposed as a paradigm for dynamic monitoring networks to pinpoint CO{sub 2} seepage areas.

54 ENVIRONMENTAL SCIENCES↗

Constraints on helium enhancement in the globular cluster M4 (NGC 6121): The horizontal branch test

Recent pieces of evidence have revealed that most, and possibly all, globular star clusters are composed of groups of stars that formed in multiple episodes with different chemical compositions. In this sense, it has also been argued that variations in the initial helium abundance (Y) from one population to the next are also the rule, rather than the exception. In the case of the metal-intermediate globular cluster M4 (NGC 6121), recent high-resolution spectroscopic observations of blue horizontal branch (HB) stars (i.e., HB stars hotter than the RR Lyrae instability strip) suggest that a large fraction of blue HB stars are second-generation stars formed with high helium abundances. In this paper, we test this scenario by using recent photometric and spectroscopic data together with theoretical evolutionary computations for different Y values. Comparing the photometric data with the theoretically derived color-magnitude diagrams, we find that the bulk of the blue HB stars in M4 have ΔY ≲ 0.01 with respect to the cluster's red HB stars (i.e., HB stars cooler than the RR Lyrae strip)—a result which is corroborated by comparison with spectroscopically derived gravities and temperatures, which also favor little He enhancement. However, the possible existence of a minority population on the blue HB of the cluster with a significant He enhancement level is also discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

BEYOND MIXING-LENGTH THEORY: A STEP TOWARD 321D

We examine the physical basis for algorithms to replace mixing-length theory (MLT) in stellar evolutionary computations. Our 321D procedure is based on numerical solutions of the Navier–Stokes equations. These implicit large eddy simulations (ILES) are three-dimensional (3D), time-dependent, and turbulent, including the Kolmogorov cascade. We use the Reynolds-averaged Navier–Stokes (RANS) formulation to make concise the 3D simulation data, and use the 3D simulations to give closure for the RANS equations. We further analyze this data set with a simple analytical model, which is non-local and time-dependent, and which contains both MLT and the Lorenz convective roll as particular subsets of solutions. A characteristic length (the damping length) again emerges in the simulations; it is determined by an observed balance between (1) the large-scale driving, and (2) small-scale damping. The nature of mixing and convective boundaries is analyzed, including dynamic, thermal and compositional effects, and compared to a simple model. We find that (1) braking regions (boundary layers in which mixing occurs) automatically appear beyond the edges of convection as defined by the Schwarzschild criterion, (2) dynamic (non-local) terms imply a non-zero turbulent kinetic energy flux (unlike MLT), (3) the effects of composition gradients on flow can be comparable to thermal effects, and (4) convective boundaries in neutrino-cooled stages differ in nature from those in photon-cooled stages (different Péclet numbers). The algorithms are based upon ILES solutions to the Navier–Stokes equations, so that, unlike MLT, they do not require any calibration to astronomical systems in order to predict stellar properties. Implications for solar abundances, helioseismology, asteroseismology, nucleosynthesis yields, supernova progenitors and core collapse are indicated.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-F-R-46: Predicting Distant Failure in Lung SBRT Using Multi-Objective Radiomics Model

Purpose: To predict distant failure in lung stereotactic body radiation therapy (SBRT) in early stage non-small cell lung cancer (NSCLC) by using a new multi-objective radiomics model. Methods: Currently, most available radiomics models use the overall accuracy as the objective function. However, due to data imbalance, a single object may not reflect the performance of a predictive model. Therefore, we developed a multi-objective radiomics model which considers both sensitivity and specificity as the objective functions simultaneously. The new model is used to predict distant failure in lung SBRT using 52 patients treated at our institute. Quantitative imaging features of PET and CT as well as clinical parameters are utilized to build the predictive model. Image features include intensity features (9), textural features (12) and geometric features (8). Clinical parameters for each patient include demographic parameters (4), tumor characteristics (8), treatment faction schemes (4) and pretreatment medicines (6). The modelling procedure consists of two steps: extracting features from segmented tumors in PET and CT; and selecting features and training model parameters based on multi-objective. Support Vector Machine (SVM) is used as the predictive model, while a nondominated sorting-based multi-objective evolutionary computation algorithm II (NSGA-II) is used for solving the multi-objective optimization. Results: The accuracy for PET, clinical, CT, PET+clinical, PET+CT, CT+clinical, PET+CT+clinical are 71.15%, 84.62%, 84.62%, 85.54%, 82.69%, 84.62%, 86.54%, respectively. The sensitivities for the above seven combinations are 41.76%, 58.33%, 50.00%, 50.00%, 41.67%, 41.67%, 58.33%, while the specificities are 80.00%, 92.50%, 90.00%, 97.50%, 92.50%, 97.50%, 97.50%. Conclusion: A new multi-objective radiomics model for predicting distant failure in NSCLC treated with SBRT was developed. The experimental results show that the best performance can be obtained by combining all features.

60 APPLIED LIFE SCIENCES↗

Enzyme Complexes of Ptr4CL and PtrHCT Modulate Co-enzyme A Ligation of Hydroxycinnamic Acids for Monolignol Biosynthesis in Populus trichocarpa

Co-enzyme A (CoA) ligation of hydroxycinnamic acids by 4-coumaric acid:CoA ligase (4CL) is a critical step in the biosynthesis of monolignols. Perturbation of 4CL activity significantly impacts the lignin content of diverse plant species. In Populus trichocarpa, two well-studied xylem-specific Ptr4CLs (Ptr4CL3 and Ptr4CL5) catalyze the CoA ligation of 4-coumaric acid to 4-coumaroyl-CoA and caffeic acid to caffeoyl-CoA. Subsequently, two 4-hydroxycinnamoyl-CoA:shikimic acid hydroxycinnamoyl transferases (PtrHCT1 and PtrHCT6) mediate the conversion of 4-coumaroyl-CoA to caffeoyl-CoA. Here, we show that the CoA ligation of 4-coumaric and caffeic acids is modulated by Ptr4CL/PtrHCT protein complexes. Downregulation of PtrHCTs reduced Ptr4CL activities in the stem-differentiating xylem (SDX) of transgenic P. trichocarpa. The Ptr4CL/PtrHCT interactions were then validated in vivo using biomolecular fluorescence complementation (BiFC) and protein pull-down assays in P. trichocarpa SDX extracts. Enzyme activity assays using recombinant proteins of Ptr4CL and PtrHCT showed elevated CoA ligation activity for Ptr4CL when supplemented with PtrHCT. Numerical analyses based on an evolutionary computation of the CoA ligation activity estimated the stoichiometry of the protein complex to consist of one Ptr4CL and two PtrHCTs, which was experimentally confirmed by chemical cross-linking using SDX plant protein extracts and recombinant proteins. Based on these results, we propose that Ptr4CL/PtrHCT complexes modulate the metabolic flux of CoA ligation for monolignol biosynthesis during wood formation in P. trichocarpa.

59 BASIC BIOLOGICAL SCIENCES↗

The effect of {sup 22}Ne diffusion in the evolution and pulsational properties of white dwarfs with solar metallicity progenitors

Because of the large neutron excess of {sup 22}Ne, sedimentation of this isotope occurs rapidly in the interior of white dwarfs. This process releases an additional amount of energy, thus delaying the cooling times of the white dwarf. This influences the ages of different stellar populations derived using white dwarf cosmochronology. Furthermore, the overabundance of {sup 22}Ne in the inner regions of the star modifies the Brunt–Väisälä frequency, thus altering the pulsational properties of these stars. In this work we discuss the impact of {sup 22}Ne sedimentation in white dwarfs resulting from solar metallicity progenitors (Z = 0.02). We performed evolutionary calculations of white dwarfs with masses of 0.528, 0.576, 0.657, and 0.833 M{sub ⊙} derived from full evolutionary computations of their progenitor stars, starting at the zero-age main sequence all the way through the central hydrogen and helium burning, the thermally pulsing asymptotic giant branch (AGB), and post-AGB phases. Our computations show that at low luminosities (log(L/L{sub ⊙})≲−4.25), {sup 22}Ne sedimentation delays the cooling of white dwarfs with solar metallicity progenitors by about 1 Gyr. Additionally, we studied the consequences of {sup 22}Ne sedimentation on the pulsational properties of ZZ Ceti white dwarfs. We find that {sup 22}Ne sedimentation induces differences in the periods of these stars larger than the present observational uncertainties, particularly in more massive white dwarfs.

79 ASTRONOMY AND ASTROPHYSICS↗

THE AGE OF THE KIC 7177553 SYSTEM

KIC 7177553 is a quadruple system containing two binaries of orbital periods 16.5 and 18 days. All components have comparable masses and are slowly rotating with spectral types of ∼G2V. The longer period binary is eclipsing with component masses and radii M {sub 1} = 1.043 ± 0.014 M {sub ⊙}, R {sub 1} = 0.940 ± 0.005 R {sub ⊙} and M {sub 2} = 0.986 ± 0.015 M {sub ⊙}, R {sub 2} = 0.941 ± 0.005 R {sub ⊙}. The essentially equal radii measurements are inconsistent with the two stars being on the man sequence at the same age using standard nonmagnetic stellar evolution models. Instead a consistent scenario is found if the stars are in their pre-main-sequence phase of evolution and have an age of 32–36 Myr. We have also computed evolutionary models of magnetic stars, but we find that our nonmagnetic models fit the empirical radii and effective temperatures better than the magnetic models.

79 ASTRONOMY AND ASTROPHYSICS↗

Nanotube Heterojunctions and Endo-Fullerenes for Nanoelectronics

Topics discussed include: (1) Light-Weight Multi-Functional Materials: Nanomechanics; Nanotubes and Composites; Thermal/Chemical/Electrical Characterization; (2) Biomimetic/Revolutionary Concepts: Evolutionary Computing and Sensing; Self-Heating Materials; (3) Central Computing System: Molecular Electronics; Materials for Quantum Bits; and (4) Molecular Machines.

Srivastava, Deepak↗

NASA Tech Briefs, April 2011

Topics covered include: Amperometric Solid Electrolyte Oxygen Microsensors with Easy Batch Fabrication; Two-Axis Direct Fluid Shear Stress Sensor for Aerodynamic Applications; Target Assembly to Check Boresight Alignment of Active Sensors; Virtual Sensor Test Instrumentation; Evaluation of the Reflection Coefficient of Microstrip Elements for Reflectarray Antennas; Miniaturized Ka-Band Dual-Channel Radar; Continuous-Integration Laser Energy Lidar Monitor; Miniaturized Airborne Imaging Central Server System; Radiation-Tolerant, SpaceWire-Compatible Switching Fabric; Small Microprocessor for ASIC or FPGA Implementation; Source-Coupled, N-Channel, JFET-Based Digital Logic Gate Structure Using Resistive Level Shifters; High-Voltage-Input Level Translator Using Standard CMOS; Monitoring Digital Closed-Loop Feedback Systems; MASCOT - MATLAB Stability and Control Toolbox; MIRO Continuum Calibration for Asteroid Mode; GOATS Image Projection Component; Coded Modulation in C and MATLAB; Low-Dead-Volume Inlet for Vacuum Chamber; Thermal Control Method for High-Current Wire Bundles by Injecting a Thermally Conductive Filler; Method for Selective Cleaning of Mold Release from Composite Honeycomb Surfaces; Infrared-Bolometer Arrays with Reflective Backshorts; Commercialization of LARC (trade mark) -SI Polyimide Technology; Novel Low-Density Ablators Containing Hyperbranched Poly(azomethine)s; Carbon Nanotubes on Titanium Substrates for Stray Light Suppression; Monolithic, High-Speed Fiber-Optic Switching Array for Lidar; Grid-Tied Photovoltaic Power System; Spectroelectrochemical Instrument Measures TOC; A Miniaturized Video System for Monitoring Drosophila Behavior; Hydrofocusing Bioreactor Produces Anti-Cancer Alkaloids; Creep Measurement Video Extensometer; Radius of Curvature Measurement of Large Optics Using Interferometry and Laser Tracker n-B-pi-p Superlattice Infrared Detector; Safe Onboard Guidance and Control Under Probabilistic Uncertainty; General Tool for Evaluating High-Contrast Coronagraphic Telescope Performance Error Budgets; Hidden Statistics of Schroedinger Equation; Optimal Padding for the Two-Dimensional Fast Fourier Transform; Spatial Query for Planetary Data; Higher Order Mode Coupling in Feed Waveguide of a Planar Slot Array Antenna; Evolutionary Computational Methods for Identifying Emergent Behavior in Autonomous Systems; Sampling Theorem in Terms of the Bandwidth and Sampling Interval; Meteoroid/Orbital Debris Shield Engineering Development Practice and Procedure; Self-Balancing, Optical-Center-Pivot, Fast-Steering Mirror; Wireless Orbiter Hang-Angle Inclinometer System; and Internal Electrostatic Discharge Monitor - IESDM.

Source record↗

A DNA-Inspired Encryption Methodology for Secure, Mobile Ad Hoc Networks

Users are pushing for greater physical mobility with their network and Internet access. Mobile ad hoc networks (MANET) can provide an efficient mobile network architecture, but security is a key concern. A figure summarizes differences in the state of network security for MANET and fixed networks. MANETs require the ability to distinguish trusted peers, and tolerate the ingress/egress of nodes on an unscheduled basis. Because the networks by their very nature are mobile and self-organizing, use of a Public Key Infra structure (PKI), X.509 certificates, RSA, and nonce ex changes becomes problematic if the ideal of MANET is to be achieved. Molecular biology models such as DNA evolution can provide a basis for a proprietary security architecture that achieves high degrees of diffusion and confusion, and resistance to cryptanalysis. A proprietary encryption mechanism was developed that uses the principles of DNA replication and steganography (hidden word cryptography) for confidentiality and authentication. The foundation of the approach includes organization of coded words and messages using base pairs organized into genes, an expandable genome consisting of DNA-based chromosome keys, and a DNA-based message encoding, replication, and evolution and fitness. In evolutionary computing, a fitness algorithm determines whether candidate solutions, in this case encrypted messages, are sufficiently encrypted to be transmitted. The technology provides a mechanism for confidential electronic traffic over a MANET without a PKI for authenticating users.

Shaw, Harry↗

Experiments on Evolving Software Models of Analog Circuits

Analog circuits are of great importance in electronic system design since the world is fundamentally analog in nature. While the amount of digital design activity far outpaces that of analog design, most digital systems require analog modules for interfacing with the external world. It was recently estimated that approximately 60% of digital application- specific integrated circuit designs incorporated analog circuits. With challenging analog circuit design problems and few analog design engineers, there are economic reasons for automating the analog design process, especially time-to-market considerations. Techniques for analog circuit design automation began appearing about two decades ago. These methods incorporated heuristics [6], knowledge bases [1], simulated annealing [5], and other algorithms. Efforts using techniques from evolutionary computation began appearing over the last few years. These include the use of genetic algorithms to select electronic component values (for example, the resistance value of a resistor), to select circuit topologies, and to design amplifiers using a limited set of canned topologies [4]. A genetic programming-based analog circuit design system has been demonstrated in which the circuit sizes, component values, and the circuit topologies are determined automatically [3]. The genetic-algorithm systems typically represent circuit structures as vectors of parameters encoded in binary strings, while the genetic programming system manipulates tree data structures.

Lohn, Jason D.↗

Pathways and Challenges to Innovation in Aerospace

This paper explores impediments to innovation in aerospace and suggests how successful pathways from other industries can be adopted to facilitate greater innovation. Because of its nature, space exploration would seem to be a ripe field of technical innovation. However, engineering can also be a frustratingly conservative endeavor when the realities of cost and risk are included. Impediments like the "find the fault" engineering culture, the treatment of technical risk as almost always evaluated in terms of negative impact, the difficult to account for expansive Moore's Law growth when making predictions, and the stove-piped structural organization of most large aerospace companies and federally funded research laboratories tend to inhibit cross-cutting technical innovation. One successful example of a multi-use cross cutting application that can scale with Moore's Law is the Evolutionary Computational Methods (ECM) technique developed at the Jet Propulsion Lab for automated spectral retrieval. Future innovations like computational engineering and automated design optimization can potentially redefine space exploration, but will require learning lessons from successful innovators.

Terrile, Richard J.↗

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↗