Bayesian optimization experiment for trajectory alignment at the low energy RHIC electron cooling system
Not Available
43 PARTICLE ACCELERATORS↗
SEARCH · Search NASA
Results for “machine learning optimization”
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.
Evaluating pulse-shaping capabilities of next-generation pulsed power architectures
This project evaluated the pulse shaping capabilities of next-generation pulsed power (NGPP) architectures. NGPP architectures share several common attributes including multiple independent pulse-generation lines, a radial water-insulated impedance transformer, and a central vacuum insulated load region. A multi-module circuit model was developed, incorporating independent pulse-generation lines and a 2-D transmission line mesh of the radial impedance transformer to assess the effects of azimuthal asymmetry in pulse-shaped experiments. Circuit model simulations demonstrated that NGPP architectures are able to produce the the desired current pulse shapes for exemplar NGPP experiments. Additionally, the project explored automated methods for experiment design, including derivative -ree optimization and machine learning. Pulse-shaped experiments require designers to determine machine parameters that reliably produce the desired current pulse at the load, a process that typically relies on expert knowledge and iterative adjustments using the Z circuit model. Given the increased complexity of NGPP systems, this manual approach may be impractical. While the evaluated methods do not eliminate the need for manual iteration, they can reduce the time required for experiment design. Derivative-free optimization automates much of the trial-and-error process, providing a close starting point for manual adjustments or making small modifications to near-final designs. Meanwhile, deep neural network methods can generate a good qualitative match to the desired current pulse in under one second without requiring circuit model simulations.
42 ENGINEERING↗
Efficient Optimization of Energy Recovery From Geothermal Reservoirs With Recurrent Neural Network Predictive Models
Improving the long-term energy production performance of geothermal reservoirs can be accomplished by optimizing field development and management plans. Reliable prediction models, however, are needed to evaluate and optimize the performance of the underlying reservoirs under various operation and development strategies. In traditional frameworks, physics-based simulation models are used to predict the energy production performance of geothermal reservoirs. However, detailed simulation models are not trivial to construct, require a reliable description of the reservoir conditions and properties, and entail high computational complexity. Data-driven predictive models can offer an efficient alternative for use in optimization workflows. This paper presents an optimization framework for net power generation in geothermal reservoirs using a variant of the recurrent neural network (RNN) as a data-driven predictive model. The RNN architecture is developed and trained to replace the simulation model for computationally efficient prediction of the objective function and its gradients with respect to the well control variables. The net power generation performance of the field is optimized by automatically adjusting the mass flow rate of production and injection wells over 12 years, using a gradient-based local search algorithm. Two field-scale examples are presented to investigate the performance of the developed data-driven prediction and optimization framework. Furthermore, the prediction and optimization results from the RNN model are evaluated through comparison with the results obtained by using a numerical simulation model of a real geothermal reservoir.
15 GEOTHERMAL ENERGY↗
Control And Optimization Modular Modeling Application For Nuclear Deployment
The purpose of the COMMAND code is to provide a flexible, scalable tool for use in developing, integrating, and testing the technologies necessary for achieving autonomous operations of advanced nuclear reactors. The code enables users to efficiently implement custom simulations and experiments by combining key methods from different software modules. These modules are focused on: modeling and simulation tools, such as nuclear simulation tools used for high-fidelity modeling (e.g., Reactor Excursion and Leak Analysis Program [RELAP5-3D] and Monte Carlo N-Particle [MCNP]); machine learning and optimization tools (e.g., anomaly detection and data-driven modeling techniques); advanced control in its digital, high-performance, and supervisory control forms (e.g., proportional integral derivative (PID) control and model predictive control (MPC); and integration with hardware through industrial communication protocols. To ensure flexibility and scalability, COMMAND was designed to be both modular—the software “pieces” all inherit from generic building blocks and can be combined and connected to create complicated simulations—and high performing—designed for parallel processing, enabling simulations and experiments to take advantage of multi-core computers, servers, and nodes. The code is written in the Python programming language due to the language's popularity, active community, and open-source and cross-platform nature. Maintaining consistency with other simulation tools used within the nuclear energy community, users implement simulations and experiments through text input files, which define components, parameters, connections, etc., through lines of text. Given that COMMAND is written in Python, these input files are native Python scripts, and so use the standard Python structure and formatting. This also enables users to take advantage of Python's extensive package library to develop custom capabilities for their specific use cases.
Faber, Jacob [Idaho National Laboratory (INL), Ida↗
Development of Miniaturized High-Temperature Multi-Process Monitoring System
The main objective of this research program is to design, manufacture, and demonstrate a miniaturized, multi-process, monitoring system (mMPMS) for boiler condition management and easy system deployment to obtain a higher spatial resolution. This system will facilitate a Condition-Based Maintenance (CBM) philosophy that actively monitors the health of assets to predict and prevent failures and maximize availability and generating capacity at a reduced cost. CBM systems can provide boiler data that the advanced process control (APC) system can utilize for plant performance optimization, which is increasingly relevant as coal power plants shift from predominantly base-load operation to predominantly transient operation involving large load swings.
20 FOSSIL-FUELED POWER PLANTS↗
Integrated Landscape Management to Reduce Biomass Feedstock Access Costs
Using geospatial, machine learning, and optimization techniques, a field scoring and design framework known as the bioenergy Landscape Environmental Assessment and Design System (bioLEADS) was developed and used to show through modelling that it is possible to reduce biomass feedstock access costs, improve field revenue, and shift intensive row crop production away from subfield areas susceptible to erosion and low in soil organic carbon. The purpose of bioLEADS is to automate agricultural field selection and subfield allocation to perennial energy crop production while incorporating reduced biomass feedstock access costs to support attaining the U.S. Department of Energy (DOE) Bioenergy Technologies Office (BETO) cost targets.
09 BIOMASS FUELS↗
Bayesian optimization of laser-plasma accelerators assisted by reduced physical models
Not Available
43 PARTICLE ACCELERATORS↗
PWR loading pattern optimization with reinforcement learning
The core loading pattern optimization problem belongs to the class of combinatorial optimization problem and has been studied since the dawn of commercial nuclear energy industry. It is characterized by multiple objectives and constraints, with a very high number of candidate patterns, which makes it impossible to solve explicitly. Stochastic optimization methodologies including Genetic Algorithms and Simulated Annealing are used by different nuclear utilities and vendors to perform fuel cycle reload design. Nevertheless, hand-designed solutions continue to be the prevalent method in the industry. To improve the state-of-the-art core reload patterns, we aim to create a method as scalable as possible, that agrees with the designer's goal of performance and safety. To help in this task Deep Reinforcement Learning (DRL), in particular Proximal Policy Optimization is leveraged. DRL has recently experienced a strong impetus from its successes applied to games, sometimes even reaching 'super-human' performances. This paper lays out the foundation of this method and proposes to study the behavior of several hyper-parameters that influence the DRL algorithm. The algorithm is highly dependent on multiple factors such as an exploration/exploitation trade-off that manifests through different parameters such as the number of loading patterns seen and the number of samples collected before a policy update, but also the shape of the objective function derived for the core design. Experimental results also demonstrate the effectiveness of the method in finding high-quality solutions from scratch within a reasonable amount of time. (authors)
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
Optimal invariant sets for atomistic machine learning
The representation of atomic configurations for machine learning models has led to numerous sets of descriptors. However, many descriptor sets are incomplete and/or functionally dependent. Incomplete sets cannot faithfully represent atomic environments. Yet complete constructions often suffer from a high degree of functional dependence, where some descriptors are functions of others. These redundant descriptors do not improve discrimination between atomic environments. We employ pattern recognition techniques to remove dependent descriptors to produce the smallest possible set that satisfies completeness. We apply this in two ways: First, we refine an existing description, the atomic cluster expansion. Second, we augment an incomplete construction, yielding a new message-passing neural network architecture that can recognize up to 5-body patterns. This architecture shows strong accuracy on state-of-the-art benchmarks while retaining low computational cost. Our results demonstrate the utility of this strategy to optimize descriptor sets across a range of descriptors and application datasets.
97 MATHEMATICS AND COMPUTING↗
Optimization of Hydrogen Production from Pyrolysis of Biomass Waste [Poster]
We developed an CFD aided ML-based tool for rapid assessment and optimization of different compositions of biomass in a fluidized bed reactor. First, we use CFD to simulate fluidized bed reactors with known inlet biomass mixtures and obtain corresponding syngas yields. A lumped kinetic mechanisms represents the conversion of cellulose, hemicellulose, and lignin, as well as subsequent cracking of tars into non-condensable gases (H 2 , CO, CO 2 , CH 4 ). We use Bayesian analysis/optimization to obtain the ideal operational and mass flow conditions for hydrogen production.
08 HYDROGEN↗
Provable bounds for noise-free expectation values computed from noisy samples
Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.
97 MATHEMATICS AND COMPUTING↗
Machine learning framework for quantum sampling of highly constrained, continuous optimization problems
In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework’s performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Generation and validation of comprehensive synthetic weather histories using auto-regressive moving-average models
As energy system design moves to more complex methods of optimization including machine learning there is a significant need for more weather data than is available. One method to solve this is using synthetic data models such as the auto-regressive moving-average (ARMA) model which has been frequently utilized to create such data. This paper looks at extending the ARMA algorithm to generate solar components through the use of clearsky detrending, maintaining vector relationships and by leveraging physical relationships. The method for the creation of entirely synthetic weather data files including key weather variables for energy system analysis is presented. Furthermore, a detailed comparison of energy system simulations utilizing both real and synthetic data is made using NREL’s System Advisor Model. Whilst good agreement is made for the solar variables, and other weather variables, ARMA methods often fail to capture the standard deviation and skew of annual weather distributions. Vector-ARMA is shown to maintain correlations between variables and thus generate data sets that perform similarly in energy system design. Here, it is finally shown that the ARMA method fails to preserve day-today correlations in weather variables and thus over-predicts optimal energy storage by 21% for a residential solar application.
42 ENGINEERING↗
Autotuning PolyBench benchmarks with LLVM Clang/Polly loop optimization pragmas using Bayesian optimization
Here, we develop a ytopt autotuning framework that leverages Bayesian optimization to explore the parameter space search and compare four different supervised learning methods within Bayesian optimization and evaluate their effectiveness. We select six of the most complex PolyBench benchmarks and apply the newly developed LLVM Clang/Polly loop optimization pragmas to the benchmarks to optimize them. We then use the autotuning framework to optimize the pragma parameters to improve their performance. The experimental results show that our autotuning approach outperforms the other compiling methods to provide the smallest execution time for the benchmarks syr2k, 3mm, heat-3d, lu, and covariance with two large datasets in 200 code evaluations for effectively searching the parameter spaces with up to 170,368 different configurations. We find that the Floyd-Warshall benchmark did not benefit from autotuning. To cope with this issue, we provide some compiler option solutions to improve the performance. Then we present loop autotuning without a user's knowledge using a simple mctree autotuning framework to further improve the performance of the Floyd-Warshall benchmark. We also extend the ytopt autotuning framework to tune a deep learning application.
79 ASTRONOMY AND ASTROPHYSICS↗
Progressive transfer learning for low-frequency data prediction in full waveform inversion
To effectively overcome the cycle-skipping issue in full waveform inversion (FWI), we developed a deep neural network (DNN) approach to predict the absent low-frequency components by exploiting the hidden physical relation connecting the low- and the high-frequency data. To efficiently solve this challenging nonlinear regression problem, two novel strategies were proposed to design the DNN architecture and to optimize the learning process: (1) dual data feed structure; (2) progressive transfer learning. With the dual data feed structure, not only the high-frequency data, but also the corresponding beat tone data are fed into the DNN to relieve the burden of feature extraction. The second strategy, progressive transfer learning, enables us to train the DNN using a single evolving training dataset. Within the framework of the progressive transfer learning, the training dataset continuously evolves in an iterative manner by gradually retrieving the subsurface information through the physics-based inversion module, progressively enhancing the prediction accuracy of the DNN and propelling the inversion process out of the local minima. Here, the synthetic numerical experiments suggest that, without any a priori geological information, the low-frequency data predicted by the progressive transfer learning are sufficiently accurate for an FWI engine to produce reliable subsurface velocity models free of cycle-skipping artifacts.
02 PETROLEUM↗
Fast Scanning Probe Microscopy via Machine Learning: Non-Rectangular Scans with Compressed Sensing and Gaussian Process Optimization
Fast scanning probe microscopy enabled via machine learning allows for a broad range of nanoscale, temporally resolved physics to be uncovered. However, such examples for functional imaging are few in number. Here, using piezoresponse force microscopy (PFM) as a model application, a factor of 5.8 reduction in data collection using a combination of sparse spiral scanning with compressive sensing and Gaussian process regression reconstruction is demonstrated. It is found that even extremely sparse spiral scans offer strong reconstructions with less than 6% error for Gaussian process regression reconstructions. Further, the error associated with each reconstructive technique per reconstruction iteration is analyzed, finding the error is similar past ≈15 iterations, while at initial iterations Gaussian process regression outperforms compressive sensing. Finally, this study highlights the capabilities of reconstruction techniques when applied to sparse data, particularly sparse spiral PFM scans, with broad applications in scanning probe and electron microscopies.
36 MATERIALS SCIENCE↗
MapsTorch : automatic differentiation for X-ray fluorescence data analysis
X-ray fluorescence (XRF) is a popular spectroscopy technique for elemental analysis. Spectrum fitting and parameter tuning are at the core of XRF analysis and are conventionally manually intensive, especially for synchrotron experiments involving large amounts of diverse samples. This work introduces the automatic differentiation (AD) technique to XRF and an open-source package called MapsTorch. By transforming an analytical model of the XRF spectrum into a differentiable computation graph with AD, MapsTorch enables robust optimization of parameters and elemental intensities. We evaluate MapsTorch by conducting computational experiments on a large number of historical synchrotron XRF datasets and compare its performance with the currently practiced fitting tool NLopt. The results show that MapsTorch consistently achieves high-quality fits and often leads to better fitting quality than NLopt, particularly in tasks such as initial spectrum fitting and elemental intensity refinement. The robust performance of MapsTorch paves the way for developing automated and high-throughput XRF data analysis workflows to handle the increasing data volumes expected from next-generation synchrotron facilities.
X-ray fluorescence↗
Long-term missing value imputation for time series data using deep neural networks
We present an approach that uses a deep learning model, in particular, a MultiLayer Perceptron, for estimating the missing values of a variable in multivariate time series data. We focus on filling a long continuous gap (e.g., multiple months of missing daily observations) rather than on individual randomly missing observations. Our proposed gap filling algorithm uses an automated method for determining the optimal MLP model architecture, thus allowing for optimal prediction performance for the given time series. We tested our approach by filling gaps of various lengths (three months to three years) in three environmental datasets with different time series characteristics, namely daily groundwater levels, daily soil moisture, and hourly Net Ecosystem Exchange. We compared the accuracy of the gap-filled values obtained with our approach to the widely used R-based time series gap filling methods ImputeTS and mtsdi. The results indicate that using an MLP for filling a large gap leads to better results, especially when the data behave nonlinearly. Thus, our approach enables the use of datasets that have a large gap in one variable, which is common in many long-term environmental monitoring observations.
97 MATHEMATICS AND COMPUTING↗