Fine-Pruning: A biologically inspired algorithm for personalization of machine learning models
Not Available
Bingham, Joseph (ORCID:0000000167166468)↗
SEARCH · Engineering Papers
Results for “Machine Learning Algorithms”
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.
Online accelerator optimization with a machine learning-based stochastic algorithm
Abstract Online optimization is critical for realizing the design performance of accelerators. Highly efficient stochastic optimization algorithms are needed for many online accelerator optimization problems in order to find the global optimum in the non-linear, coupled parameter space. In this study, we propose to use the multi-generation Gaussian process optimizer for online accelerator optimization and demonstrate that the algorithm is significantly more efficient than other stochastic algorithms that are commonly used in the accelerator community.
Zhang, Zhe (ORCID:0000000281430381)↗
Interpreting 2D X-ray Diffraction Patterns of Dynamic Compression Experiments using Machine Learning, Simulation and Constraint Algorithms
Explore the source record for details and available documents.
Lane, James Matthew Doyle [Sandia National Laborat↗
Machine Learning, Simulation and Constraint Algorithms for Interpreting 2D X-Ray Diffraction Patterns of Dynamic Compression Experiments
Explore the source record for details and available documents.
Brown, Nathan Parnell [Sandia National Laboratorie↗
GOOML: Geothermal Operational Optimization with Machine Learning
Geothermal Operational Optimization with Machine Learning (GOOML) is a project focused on maximizing increased availability and capacity from existing industrial-scale geothermal generation assets. The GOOML project will develop a suite of machine learning-based algorithms that analyze historical production datasets and provide predictive setpoints for geothermal field operations. Historical datasets from New Zealand and the US will provide the input to develop digital geothermal system twins which allow prediction of market conditions, maintenance operations and steamfield optimization. The algorithms will identify key parameters within fields and suggest setpoints for components of the system to maintain optimal generation. Set-points can be instructed to follow mass flow restrictions, generation maximization and optimal field/reservoir balance and give field operators a guide by which generation can be optimized. The datasets that will be used to develop GOOML are sourced from operating geothermal fields in New Zealand and the United States with varying degrees of complexity. This will ensure that most geothermal systems can utilize the GOOML tool to assist in optimizing operations. GOOML aims to achieve a step-change in geothermal operations by developing state-of-the-art machine learning algorithms, comprehensive data analytics, and a first-of-its-kind automated, intelligent geothermal system model.
algorithms↗
Online peak-aware energy scheduling with untrusted advice
This paper studies the online energy scheduling problem in a hybrid model where the cost of energy is proportional to both the volume and peak usage, and where energy can be either locally generated or drawn from the grid. Inspired by recent advances in online algorithms with Machine Learned (ML) advice, we develop parameterized deterministic and randomized algorithms for this problem such that the level of reliance on the advice can be adjusted by a trust parameter. We then analyze the performance of the proposed algorithms using two performance metrics: robustness that measures the competitive ratio as a function of the trust parameter when the advice is inaccurate, and consistency for competitive ratio when the advice is accurate. Since the competitive ratio is analyzed in two different regimes, we further investigate the Pareto optimality of the proposed algorithms. Our results show that the proposed deterministic algorithm is Pareto-optimal, in the sense that no other online deterministic algorithms can dominate the robustness and consistency of our algorithm. Furthermore, we show that the proposed randomized algorithm dominates the Pareto-optimal deterministic algorithm. Our large-scale empirical evaluations using real traces of energy demand, energy prices, and renewable energy generations highlight that the proposed algorithms outperform worst-case optimized algorithms and fully data-driven algorithms.
Lee, Russell↗
Hardware Acceleration of Adaptive Neural Algorithms.
As tradit ional numerical computing has faced challenges, researchers have turned towards alternative computing approaches to reduce power - per - computation metrics and improve algorithm performance. Here, we describe an approach towards non - conventional computing that strengthens the connection between machine learning and neuroscience concepts. The Hardware Acceleration of Adaptive Neural Algorithms (HAANA) project ha s develop ed neural machine learning algorithms and hardware for applications in image processing and cybersecurity. While machine learning methods are effective at extracting relevant features from many types of data, the effectiveness of these algorithms degrades when subjected to real - world conditions. Our team has generated novel neural - inspired approa ches to improve the resiliency and adaptability of machine learning algorithms. In addition, we have also designed and fabricated hardware architectures and microelectronic devices specifically tuned towards the training and inference operations of neural - inspired algorithms. Finally, our multi - scale simulation framework allows us to assess the impact of microelectronic device properties on algorithm performance.
97 MATHEMATICS AND COMPUTING↗
Evaluating Optimization Strategies for Engine Simulations Using Machine Learning Emulators
This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.
Probst, Daniel M.↗
Data Science Enabled Enabled Discovery of Superconductors (Final Progress Report)
This Final Technical Report describes efforts by 4 PIs at the University of Florida (Peter Hirschfeld, Richard Hennig, Greg Stewart and James Hamlin), over the period September 2019-August 2023, to use data science and machine learning techniques to discover new conventional superconductors. The PIs constructed a discovery loop with two theorists and two experimentalists to: develop algorithms to machine learn descriptors correlating strongly with the critical temperature Tc (PI's Peter Hirschfeld, UF Physics and Richard Hennig, UF Materials Science and En), synthesize and measure properties of promising materials, and feed back the knowledge gained into the prediction algorithm. This work was motivated by the theoretical prediction and experimental discovery of high-pressure, high-pressure hydride superconductors, and to find ways to recreate the high critical temperatures in these systems at ambient pressure. Highlights from the grant include: 1) a new equation for Tc in terms of moments of the electron-phonon spectral function, improving on the so-called Allen-Dynes equation (1975); 2) study of the metastable A15 superconductor Nb3Si, formed under explosive compression at ~1000GPa to determine the kinetic barrier to the ground state structure; 3) the development of ultra-fast machine-learned atomic potentials for molecular dynamics, and 4) the discovery of superconductivity at 19K in WB2 arising from metastable defect structures in the crystal.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Integrated Cyber/Physical Grid Resiliency Modeling
This project explored coupling modeling and analysis methods from multiple domains to address complex hybrid (cyber and physical) attacks on mission critical infrastructure. Robust methods to integrate these complex systems are necessary to enable large trade-space exploration including dynamic and evolving cyber threats and mitigations. Reinforcement learning employing deep neural networks, as in the AlphaGo Zero solution, was used to identify "best" (or approximately optimal) resilience strategies for operation of a cyber/physical grid model. A prototype platform was developed and the machine learning (ML) algorithm was made to play itself in a game of 'Hurt the Grid'. This proof of concept shows that machine learning optimization can help us understand and control complex, multi-dimensional grid space. A simple, yet high-fidelity model proves that the data have spatial correlation which is necessary for any optimization or control. Our prototype analysis showed that the reinforcement learning successfully improved adversary and defender knowledge to manipulate the grid. When expanded to more representative models, this exact type of machine learning will inform grid operations and defense - supporting mitigation development to defend the grid from complex cyber attacks! This same research can be expanded to similar complex domains.
97 MATHEMATICS AND COMPUTING↗
Semi-supervised learning approach for crack detection and identification in advanced gas-cooled reactor graphite bricks - 111
One of the life-limiting components of an Advanced Gas cooled Reactor (AGR) is its graphite core. The bricks present in the core undergo radiolytic oxidation throughout their lifetime which causes graphite weight loss and irradiation which can result in some of the bricks developing cracks. Understanding the nature and extent of brick cracking within the core is key to ensuring continued and extended operation of the AGR fleet. A semi-supervised machine learning classification algorithm is proposed as a method for improving the detection of cracked graphite bricks, by combining the labels derived from infrequent, detailed inspections of the core, with unlabeled, more frequent monitoring measurements taken during refueling operations. Semi-supervised machine learning, which is an emerging field in nuclear power condition monitoring, is the combination of ideas from both supervised and unsupervised machine learning whereby the data that is used to train the algorithm is a combination of labeled and unlabeled data. This paper introduces the initial research that has been undertaken in creating a semi-supervised self-training algorithm to detect the presence of graphite brick cracks and then proceeds to show that there is an improvement in the classification of graphite bricks using a semi-supervised machine learning classifier compared to supervised machine learning classifiers. This improved classification performance is encouraging as it does not require time consuming and costly human analysis to obtain extra learning information from available data. (authors)
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
Development of a Convolutional Neural Network Classifier for Data Starved Spectra - 20199
The Institute for Clean Energy Technology (ICET) at Mississippi State University is exploring the utility of machine learning in augmenting its mobile radiation surveying platforms, which are currently being developed as means to survey depleted uranium contaminated areas in support of remediation and decommissioning efforts. Mobile survey platforms provide a means to efficiently scan large areas of interest while reducing human exposure to radiation and other hazards. The survey platforms can also be used for scanning for any gamma emitting isotope in addition to depleted uranium. The spectral data that the platforms collect may be data starved with relatively low counts and poorly defined spectral features depending on the speed of the platforms and scintillation detector selection. Such data-starved spectra are difficult to use for isotope identification, requiring advanced knowledge of the possible radionuclides that could be present and environmental factors that could attenuate signals or introduce background noise. These factors in combination with the volume of survey data increases the time it takes to perform analysis of survey data when the source type is unknown. There are a number of algorithms in the field of machine learning that can be used to classify data that would be challenging and time-consuming for a human to identify. Supervised machine learning algorithms train models based on extensive amounts of human-labeled training data. Once sufficiently trained, these models can be used to quickly make high-fidelity predictions on new data. Convolutional neural networks are machine learning algorithms that excel in learning representations of 'shapes'. They do this by taking numerical input data and convolving them with spatial feature detectors referred to as filters. These filters are incrementally adjusted to reduce the prediction error on the data during the backpropagation step of training. Discussed in this paper is the development of a convolutional neural network classifier (CNNC) that can utilize spectral survey data for source discrimination and isotope identification. Bench-top laboratory experiments data using LaBr{sub 3}(Ce) scintillation detectors were used to train and evaluate the performance of the developed CNNC. The CNNC is capable of discriminating a variety of gamma emitting source types, differentiating different forms of uranium (depleted vs. natural), and estimating the amount of uranium for a known geometry. The discussed CNNC may be useful in scenarios where survey systems are deployed in situations where hazardous radioactive material maybe present, but the type is unknown. When used in remediation applications the CNNC can be used to screen-out false positives, helping reduce remediation costs. (authors)
07 ISOTOPE AND RADIATION SOURCES↗
Uncertainty quantification for deep learning in particle accelerator applications
With the advent of increased computational resources and improved algorithms, machine learning-based models are being increasingly applied to complex problems in particle accelerators. However, such data-driven models may provide overly confident predictions with unknown errors and uncertainties. For reliable deployment of machine learning models in high-regret and safety-critical systems such as particle accelerators, estimates of prediction uncertainty are needed along with accurate point predictions. In this investigation, we evaluate Bayesian neural networks (BNN) as an approach that can provide accurate predictions along with reliably quantified uncertainties for particle accelerator problems, and compare their performance with bootstrapped ensembles of neural networks. We select three accelerator setups for this evaluation: a storage ring, a photoinjector, and a linac. The problems span different data volumes and dimensionalities (e.g., scalar predictions as well as image outputs). It is found that BNN provide accurate predictions of the mean along with reliable estimates of predictive uncertainty across the test cases. In this vein, BNN may offer an attractive alternative to deterministic deep learning tools to generate accurate predictions with quantified uncertainties in particle accelerator applications.
43 PARTICLE ACCELERATORS↗
Data-Driven Performance Optimization of Gamma Spectrometers With Many Channels
In gamma spectrometers with variable spectroscopic performance across many channels (e.g., many pixels or voxels), a tradeoff exists between including data from successively worse-performing readout channels and increasing efficiency. Brute-force calculation of the optimal set of included channels is exponentially infeasible as the number of channels grows, and approximate methods are required. In this work, we present a data-driven framework for attempting to find near-optimal sets of included detector channels. The framework leverages non-negative matrix factorization (NMF) to learn the behavior of gamma spectra across the detector and clusters similarly-performing detector channels together. Performance comparisons are then made between spectra with channel clusters removed, which is more feasible than brute force. The framework is general and can be applied to arbitrary, user-defined performance metrics depending on the application. We apply this framework to optimizing gamma spectra measured by H3D M400 CdZnTe (CZT) spectrometers, which exhibit variable performance across their crystal volumes. In particular, we show several examples optimizing various performance metrics for uranium and plutonium gamma spectra in non-destructive assay (NDA) for nuclear safeguards, and explore trends in performance versus parameters such as clustering algorithm type. We also compare the NMF + clustering pipeline to several non-machine-learning (ML) algorithms, including several greedy algorithms. Although, we find that the NMF + clustering pipeline tends to find the best-performing set of detector voxels, significantly improving over the unoptimized spectra, but that a greedy accumulation of spectra segmented by detector depth can, in some cases, give similar performance improvements in much less computation time.
Energy resolution↗
Study of Data-Driven Mesh-Model Optimization in System Thermal-Hydraulic Simulation
Quantification of nuclear power plant safety risk requires a systematic and yet practical approach to identification of accident scenarios, assessment of their likelihood and consequences. Instrumental to this goal is risk-informed safety margin characterization (RISMC) framework, whose realization requires computationally robust and affordable methods for sufficiently accurate simulation of complex multi-dimensional physical phenomena, such as turbulent and multi-phase flow. The CFD-like correlation-based codes with 3D simulation capability (e.g., GOTHIC) ensure computational efficiency using coarse mesh size and the sub-grid phenomena in the boundary layer that can be captured by adequate constitutive correlations. However, the error sources and user effects on the selection of mesh size and models lead to unpredictable simulation error, while rich High-Fidelity (HF) data from experiments and numerical simulation using validated code or DNS are not fully explored. It would be useful to have a “smart” data-driven multi-scale framework in which the low-resolution models can be “taught” to emulate high-resolution models. The objective of this work is to develop and evaluate a physical-based data-driven mesh-model optimization approach (Optimized Mesh/Model Information System, OMIS) to estimate the simulation error and give advice on the optimized selection of coarse mesh size and Low-Fidelity (LF) models for System Thermal Hydraulic (STH) simulation to achieve accuracy comparable to that of HF models. This approach takes advantages of computational efficiency of coarse-mesh simulation and application of Machine Learning (ML) algorithms.
97 MATHEMATICS AND COMPUTING↗
Development of neural network force fields for corrosion studies
To fully understand the chemistry and physics of corrosion, novel methods of simulation must be developed. One approach is designing machine learning (ML) algorithms integrated with density functional theory to develop adaptive force fields to gain insight into corrosion behavior namely at the surface of metal oxides. Current methods of modeling corrosion are slow due to the computational cost of resolving both reaction mechanics and mass transport processes. Machine learning methods can be implemented to obtain structure-activity relationships at both the molecular and bulk scale while still retaining the accuracy of density functional theory (DFT) and significantly decreasing the time needed for simulations of complex chemical processes in the various environments of corrosion. Multiscale models are needed for corrosion studies to fully understand its processes not only at the atomic length scale (chemical bonding, energies, and forces), but also at the nano and meso length scales (solid-state physics and material science processes). Current methods of study include DFT, molecular dynamics, and Monte Carlo. The limitation of DFT is that only a small number of atoms or molecules can be simulated at that level of theory. Density functional theory is used to study the electronic structure of atoms and molecules, and calculate the force component of each atom. However, these calculations are limited to about 1000 atoms. Custom periodic boundary conditions (PBC) can be used to describe the various environments and defects that affect the atomic forces to produce a large data set from which a training set can be derived. Machine learning can be utilized to overcome the barrier of modeling macroscopic and multi-scale processes from ab initio calculations through the development of adaptive force fields. Local environments determine the atomic forces of a given system, therefore adaptive force fields must be created to produce reliable quantum mechanical calculations. This can be achieved by developing a learning algorithm that uses the mapped atomic forces or fingerprint as an input to produce energies and magnetic moments as output. A systematic approach was used to begin to build a data set in order to accurately describe the atomic forces in various environments. In Figure 4 below, a simple PBC cell of Fe{sub 2}O{sub 3} was first optimized. A surface optimization was performed next, followed by a hydroxylated surface optimization. Once this calculation has converged, the adsorption of halide species to the hydroxylated surface will be investigated. TensorFlow is an open source platform for machine learning developed by Google. Using a high level application program interface (API) such as Keras allows for building and training ML models easily in a number of different environments and languages. For this project, a neural network was developed within Anaconda in Python. Future Work: Further development of reference data set; Refining neural network and learning algorithm; Fingerprinting atomic environment to enable mapping of atomic force components; Choosing appropriate training set from reference data; Learning from training set and enabling non-linear mapping of training set fingerprints and the atomic forces; Estimation of uncertainty to identify ranges of outside applicability; Testing and analysis of molecular dynamic simulations.
36 MATERIALS SCIENCE↗
Multi-Level Structural Damage Characterization Using Sparse Acoustic Sensor Networks and Knowledge Transferred Deep Learning
Standard structural health monitoring techniques face well-known difficulties for comprehensive defect diagnosis in real-world structures that have structural, material, or geometric complexity. This motivates the exploration of machine-learning-based structural health monitoring methods in complex structures. However, creating sufficient training data sets with various defects is an ongoing challenge for data-driven machine (deep) learning algorithms. The ability to transfer the knowledge of a trained neural network from one component to another or to other sections of the same component would drastically reduce the required training data set. Also, it would facilitate computationally inexpensive machine learning based inspection systems. In this work, a machine-learning-based multi-level damage characterization is demonstrated with the ability to transfer trained knowledge within the sparse sensor network. A novel network spatial assistance and an adaptive convolution technique are proposed for efficient knowledge transfer within the deep learning algorithm. Proposed structural health monitoring method is experimentally evaluated on an aluminum plate with artificially induced defects. It was observed that the method improves the performance of knowledge transferred damage characterization by 50% during localization and 24% during severity assessment. Further, experiments using time windows with and without multiple edge reflections are studied. Results reveal that multiply scattered waves contain rich and deterministic defect signatures that can be mined using deep learning neural networks, improving the accuracy of both identification and quantification. In the case of a fixed sensor network, using multiply scattered waves shows 100% prediction accuracy at all levels of damage characterization.
36 MATERIALS SCIENCE↗
Coreset Clustering on Small Quantum Computers
Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing to address this issue, relying on coresets to minimize the data loading overhead of quantum algorithms. We investigated using this paradigm to perform k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset. We used numerical simulations to compare the performance of this approach to classical k-means clustering. We were able to find data sets with which coresets work well relative to random sampling and where QAOA could potentially outperform standard k-means on a coreset. However, finding data sets where both coresets and QAOA work well—which is necessary for a quantum advantage over k-means on the entire data set—appears to be challenging.
42 ENGINEERING↗