Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “gaussian processes”

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 235 records · Page 13

Physicochemical and Performance Characterization of Six Commercial Organic Solvent Nanofiltration Membranes

This work introduces a novel, gradient-free metamaterial design method based on Gaussian process regression to represent the density field of a unit cell. The dimension of the design space is determined by the covariance matrix dimension in the Gaussian process regression. We propose compressing this matrix using an autoencoder, enabling the decoder to generate the density field and effectively reduce the originally large design space to a lower-dimensional subspace. In this compressed space, we employ an active learning method, Bayesian Adaptive Direct Search (BADS), for efficient exploration of the design space. We demonstrate that for simple 2D designs aimed at maximizing unit cell stiffness, our method yields results comparable to those of standard topology optimization. Furthermore, we extend our approach to various mechanical problems, from linear elasticity to hyperelastic large deformation and elasto-plasticity under finite deformation, to 3D metamaterial design. This illustrates the method’s versatility and effectiveness across a range of applications.

Wu, Haoran↗

Non-smooth Bayesian optimization in tuning scientific applications

Tuning algorithmic parameters to optimize the performance of large, complicated computational codes is an important problem involving finding the optima and identifying regimes defined by non-smooth boundaries in black-box functions. Within the Bayesian optimization framework, the Gaussian process surrogate model produces smooth mean functions, but functions in the tuning problem are often non-smooth, which is exacerbated by the fact that we usually have limited sequential samples from the black-box function. Here, motivated by these issues encountered in tuning, we propose a novel Gaussian process model called a clustered Gaussian process (cGP), where the components are dynamically updated by clustering. In our studies, the performance of cGP can be better than stationary GPs in nearly 90% of the experiments and better than non-stationary GPs in nearly 70% of the repeated experiments while requiring less computational cost. cGP provides a novel approach for dynamic GP, computes more efficiently than recursive partitioning, and discovers non-smoothness regimes. We provide extensive experiments including high-performance computing (HPC) and industrial simulation functions to show the effectiveness of our methods.

97 MATHEMATICS AND COMPUTING↗

Constructing a Simulation Surrogate with Partially Observed Output

Gaussian process surrogates are a popular alternative to directly using computationally expensive simulation models. When the simulation output consists of many responses, dimension-reduction techniques are often employed to construct these surrogates. However, surrogate methods with dimension reduction generally rely on complete output training data. This article proposes a new Gaussian process surrogate method that permits the use of partially observed output while remaining computationally efficient. The new method involves the imputation of missing values and the adjustment of the covariance matrix used for Gaussian process inference. The resulting surrogate represents the available responses, disregards the missing responses, and provides meaningful uncertainty quantification. In conclusion, the proposed approach is shown to offer sharper inference than alternatives in a simulation study and a case study where an energy density functional model that frequently returns incomplete output is calibrated.

42 ENGINEERING↗

Correspondence of NNGP Kernel and the Matérn Kernel

Kernels representing limiting cases of neural network architectures have recently gained popularity. However, the application and performance of these new kernels compared to existing options, such as the Matérn kernel, is not well studied. We take a practical approach to explore the neural network Gaussian process (NNGP) kernel and its application to data in Gaussian process regression. We first demonstrate the necessity of normalization to produce valid NNGP kernels and explore related numerical challenges. We further demonstrate that the predictions from this model are quite inflexible, and therefore do not vary much over the valid hyperparameter sets. We then demonstrate a surprising result that the predictions given from the NNGP kernel correspond closely to those given by the Matérn kernel under specific circumstances, which suggests a deep similarity between overparameterized deep neural networks and the Matérn kernel. Finally, we demonstrate the performance of the NNGP kernel as compared to the Matérn kernel on three benchmark data cases, and we conclude that for its flexibility and practical performance, the Matérn kernel is preferred to the novel NNGP in practical applications.

97 MATHEMATICS AND COMPUTING↗

A Bayesian Calibration Framework with Embedded Model Error for Model Diagnostics

We study the utility and performance of a Bayesian model error embedding construction in the context of molecular dynamics modeling of metallic alloys, where we embed model error terms in existing interatomic potential model parameters. To alleviate the computational burden of this approach, we propose a framework combining likelihood approximation and Gaussian process surrogates. Here we leverage sparse Gaussian process techniques to construct a hierarchy of increasingly accurate but more expensive surrogate models. This hierarchy is then exploited by multilevel Markov chain Monte Carlo methods to efficiently sample from the target posterior distribution. We illustrate the utility of this approach by calibrating an interatomic potential model for a family of gold-copper alloys. In particular, this case study highlights effective means for dealing with computational challenges with Bayesian model error embedding in large-scale physical models, and the utility of embedded model error for model diagnostics.

Bayesian inference↗

gpCAM v8

gpCAM is a Python software for large-scale Gaussian-Process driven uncertainty quantification, Bayesian Optimization, and Autonomous Experimentation. It is designed with maximum flexibility and customizability while offering record-breaking computing capabilities. In 2023 gpCAM broke the world record for Gaussian processes on large datasets set in 2019. Through clever programming and math, Gaussian Process building blocks, such as prior mean, kernel, and noise functions maintain their mathematical flexibility while supporting acceleration and scaling. This flexibility means that the approximation and uncertainty quantification can be domain-aware and extended over exotic input and output spaces.

Noack, Marcus↗

Sequential Bayesian Methods for Analyzing Computer Models

Efficient analysis of computer models is essential for the validation and uncertainty quantification of those models. Surrogate models, and Gaussian processes in particular, are a common and powerful approach to analyzing computer models that treat computer models as a black-box function. Gaussian processes form a Bayesian model over a space of functions that gives a measure of uncertainty about the computer model output at unobserved locations and a framework for sequential sampling. This tutorial will show how to fit Gaussian processes on a series of test functions and apply sequential design techniques to estimate extrema, level sets, and reliabilities of those test functions.

97 MATHEMATICS AND COMPUTING↗

A Gaussian Process-Based extended Goldak heat source model for finite element simulation of laser powder bed fusion additive manufacturing process

In this study, laser powder bed fusion (L-PBF) additive manufacturing (AM) is a key enabling technology to manufacture highly complex and integrated metallic structures. In L-PBF AM process, the melting of the metal powders and the layers underneath can be governed by either “conduction mode” or “keyhole mode”, with the keyhole mode reportedly leading to porosity and decreased strength and ductility by many studies. In part scale simulations, finite element (FE) model is often used to study the temperature distribution during printing and to predict the residual stress, where a volumetric heat flux with a Gaussian or a double ellipsoidal (Goldak) distribution is often applied as the laser heat source. However, the above heat source models can only capture the melt pool shape in the conduction mode, and fail to capture the transition to keyhole melting mode when the process parameters change. To overcome this inaccuracy, an extended Goldak heat source model is proposed by introducing a laser penetration term as a function of laser parameters obtained from a Gaussian-Process (GP) model. The model is validated by “2D pad” AlSi10Mg L-PBF experiments under a wide range of laser power, scan speed, and laser focus offset, and the results show the model successfully captures the measured melt pool shape in all conditions.

36 MATERIALS SCIENCE↗

Interpolating between small- and large-$\mathscr{g}$ expansions using Bayesian model mixing

Bayesian model mixing (BMM) is a statistical technique that can be used to combine models that are predictive in different input domains into a composite distribution that has improved predictive power over the entire input space. We explore the application of BMM to the mixing of two expansions of a function of a coupling constant $\mathscr{g}$ that are valid at small and large values of $\mathscr{g}$ respectively. This type of problem is quite common in nuclear physics, where physical properties are straightforwardly calculable in strong and weak interaction limits or at low and high densities or momentum transfers, but difficult to calculate in between. Interpolation between these limits is often accomplished by a suitable interpolating function, e.g., Padé approximants, but it is then unclear how to quantify the uncertainty of the interpolant. We address this problem in the simple context of the partition function of zero-dimensional Φ 4 theory, for which the (asymptotic) expansion at small $\mathscr{g}$ and the (convergent) expansion at large $\mathscr{g}$ are both known. We consider three mixing methods: linear mixture BMM, localized bivariate BMM, and localized multivariate BMM with Gaussian processes. Here, we find that employing a Gaussian process in the intermediate region between the two predictive models leads to the best results of the three methods. The methods and validation strategies we present here should be generalizable to other nuclear physics settings.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Parametric, Data-Driven, Non-Intrusive Reduced-Order Model Framework for Crystal Plasticity Simulations of Voids

The influence of the internal structure at micrometer length scales on the deformation of polycrystalline materials can be effectively captured using crystal plasticity finite element methods (CPFEM). However, the complexity and nonlinearity of the deformation equations CPFEM solves demand significant computational power and resources to achieve accurate predictions, limiting its broader application. To address this challenge, we have identified a reduced-order representation of the complex data in order to establish a computationally efficient reduced-order models (ROM) and drastically reduce the computational expense of CPFEM. Specifically, in this work, we developed a parametric, data-driven, and non-intrusive ROM framework for CPFEM using proper orthogonal decomposition (POD) and sparse variational Gaussian process (SVGP) regression for single-crystal microstructures under tensile loading conditions. The developed protocol enables one to compress field into a latent/low-dimensional space described by principal component analysis (PCA) via the singular value decomposition (SVD) algorithm. As a result, the high-dimensional data are reduced to a significantly smaller amount of dimensions with POD bases and POD coefficients. Furthermore, we deployed an ensemble of SVGPs—extended from the classical Gaussian process (GP) regression for scalability and handling big data—in a massively parallel manner to train and predict latent POD coefficients using known POD bases from a set of previously obtained simulations results. Lastly, using the predicted POD coefficients, we reconstructed the full-field results and showed reasonable agreement compared with the true values obtained from running CPFEM. The developed framework is validated with a set of CPFEM simulations of a single embedded void in single-crystal aluminum alloy. While the framework is broadly applicable, this work specifically focuses on single-crystal microstructures, a single load case (e.g., tensile), and a specific void geometry (spherical).

Anisotropy↗

Online Learning of Effective Turbine Wind Speed in Wind Farms

To develop better wind farm controllers that can meet more complex objectives, methods of modeling the wind turbine wakes at low computational expense are needed. Gaussian process (GP) regression offers a computationally inexpensive framework for learning complex functions from noisy measurements with very few datapoints. In this work, an online learning approach is presented to learn the rotor-averaged wind velocity at downstream wind turbines with GPs, using the available datastream of wind field measurements and wind turbine control set-points. This framework can readily be integrated into model-based controls methods because the model a) is updated online at low computational expense, b) assumes a mathematically favorable Gaussian form, and c) explicitly quantifies the stochastic nature of the wake field so that the trade-off between exploration and exploitation, and the uncertainty in the prediction, can be utilized. We show that a GP-learned model can match true values with errors within 0.5% on average, with as few as 5 training data points.

Gaussian process↗

Short-Term Load Forecasting Considering EV Charging Loads with Prediction Interval Evaluation

Short-term load forecasting plays a critical role in power system planning and operation. Along with the electrification of various loads, electricity demands are becoming increasingly hard to predict. Notably, the recent rise in electric vehicles (EVs) has further contributed to this unpredictability. To address this issue, this paper proposes a probabilistic load forecasting strategy utilizing Gaussian process regression, structured in a day-ahead manner. While many works focus on deterministic prediction, probabilistic forecasting offers additional insights into variability and uncertainty, enabling more flexible and reliable operation for power systems. To enhance the accuracy of the load forecasting model, the inputs include features related to EV charging habits as well as commonly used weather information. The load forecasting results are evaluated using various metrics, including conventional ones that assess the accuracy of point forecasts, as well as additional metrics that test the reliability of prediction intervals. The proposed load forecasting method is finally tested on real residential power consumption data and EV charging data sampled from real-world sources. The results prove that the new features can greatly improve the performance of the load forecasting method.

electrical vehicle↗

All-purpose, all-sky photometric redshifts for the Legacy Imaging Surveys Data Release 8

ABSTRACT In this paper, we present photometric redshift (photo-z) estimates for the Dark Energy Spectroscopic Instrument (DESI) Legacy Imaging Surveys, currently the most sensitive optical survey covering the majority of the extragalactic sky. Our photo-z methodology is based on a machine-learning approach, using sparse Gaussian processes augmented with Gaussian mixture models (GMMs) that allow regions of parameter space to be identified and trained separately in a purely data-driven way. The same GMMs are also used to calculate cost-sensitive learning weights that mitigate biases in the spectroscopic training sample. By design, this approach aims to produce reliable and unbiased predictions for all parts of the parameter space present in wide area surveys. Compared to previous literature estimates using the same underlying photometry, our photo-zs are significantly less biased and more accurate at z > 1, with negligible loss in precision or reliability for resolved galaxies at z < 1. Our photo-z estimates offer accurate predictions for rare high-value populations within the parent sample, including optically selected quasars at the highest redshifts (z > 6), as well as X-ray or radio continuum selected populations across a broad range of flux (densities) and redshift. Deriving photo-z estimates for the full Legacy Imaging Surveys Data Release 8, the catalogues provided in this work offer photo-z estimates predicted to be of high quality for ≳9 × 108 galaxies over ${\sim}19\, 400\, \text{deg}^{2}$ and spanning 0 < z ≲ 7, offering one of the most extensive samples of redshift estimates ever produced.

79 ASTRONOMY AND ASTROPHYSICS↗

Photometry as a Proxy for Stellar Activity in Radial Velocity Analyses

Stellar activity remains a limiting factor in measuring precise planet parameters from radial velocity spectroscopy, not least in the search for Earth-mass planets orbiting in the habitable zones of Sun-like stars. One approach to mitigate stellar activity is to use combined analyses of both radial velocity and time-series photometry. We present an analysis of simultaneous disk-integrated photometry and radial velocity data of the Sun in order to determine the useful limits of a combined analysis. We find that simple periodogram or autocorrelation analysis of solar photometry give the correct rotation period <50% of the time. We therefore use a Gaussian process to investigate the time variability of solar photometry and to directly compare simultaneous photometry with radial velocity data. We find that the hyperparameter posteriors are relatively stable over 70 yr of solar photometry and the amplitude tracks the solar cycle. We observe good agreement between the hyperparameter posteriors for the simultaneous photometry and radial velocity data. Our primary conclusion is a recommendation to include an additional prior in Gaussian process fits to constrain the evolutionary timescale to be greater than the recurrence timescale (i.e., the rotation period) to recover more physically plausible and useful results. Our results indicate that such simultaneous monitoring may be a useful tool in enhancing the precision of radial velocity surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Model emulation and closure tests for (3+1)D relativistic heavy-ion collisions

In nuclear and particle physics, reconciling sophisticated simulations with experimental data is vital for understanding complex systems like the Quark Gluon Plasma (QGP) generated in heavy ion collisions. However, computational demands pose challenges, motivating using Gaussian Process emulators for efficient parameter extraction via Bayesian calibration. We conduct a comparative analysis of Gaussian Process emulators in heavy-ion physics to identify the most adept emulator for parameter extraction with minimal uncertainty. Furthermore, our study contributes to advancing computational techniques in heavy-ion physics, enhancing our ability to interpret experimental data and understand QGP properties.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Reduced Order Models Generation for HTGRs Pebble Shuffling Procedure Optimization Studies

This report provides an initial study for producing reduced-order models (ROMs) of pebble-bed high temperature gas reactor (HTGR) models for the purposes of design optimization. As an initial study, this work is meant to be exploratory---identifying useful workflows and methods for ROM generation---and not meant to be a catch-all analysis of HTGR ROM generation and usage for optimization. This report summarizes three tasks performed in Fiscal Year 2022: 1) the creation of HTGR model, 2) the sensitivity analysis of model design parameters, and 3) an introduction to ROM generation techniques. The representative HTGR model created in this work is a multiphysics equilibrium-core using the BlueCRAB (comprehensive reactor analysis bundle) reactor analysis application, coupling four physical phenomena: neutronics, streamline depletion, porous flow thermal hydraulics, and pebble heat conduction. Part of the model creation was identifying some design parameters and quantities of interest that are relevant in an optimization analysis and adjustable in the model. The sensitivity analysis utilized a polynomial chaos expansion methodology to compute global sensitivity metrics. This analysis showed that thermal hydraulics parameters and quantities of interest had a relatively small impact on simulation results. Finally, the ROM generation work involved exploring three different ROM methodologies: polynomial regression, a Gaussian process, and artificial neural networks. Using a cross-validation technique to characterize ROM performance, the Gaussian process and single-layer artificial neural networks showed the most promising results. Overall, this study was insightful and the lessons learned will be invaluable for the eventual development of an HTGR design optimization workflow.

97 MATHEMATICS AND COMPUTING↗

A Hybrid Energy System Workflow for Energy Portfolio Optimization

This manuscript develops a workflow, driven by data analytics algorithms, to support the optimization of the economic performance of an Integrated Energy System. The goal is to determine the optimum mix of capacities from a set of different energy producers (e.g., nuclear, gas, wind and solar). A stochastic-based optimizer is employed, based on Gaussian Process Modeling, which requires numerous samples for its training. Each sample represents a time series describing the demand, load, or other operational and economic profiles for various types of energy producers. These samples are synthetically generated using a reduced order modeling algorithm that reads a limited set of historical data, such as demand and load data from past years. Numerous data analysis methods are employed to construct the reduced order models, including, for example, the Auto Regressive Moving Average, Fourier series decomposition, and the peak detection algorithm. All these algorithms are designed to detrend the data and extract features that can be employed to generate synthetic time histories that preserve the statistical properties of the original limited historical data. The optimization cost function is based on an economic model that assesses the effective cost of energy based on two figures of merit: the specific cash flow stream for each energy producer and the total Net Present Value. An initial guess for the optimal capacities is obtained using the screening curve method. The results of the Gaussian Process model-based optimization are assessed using an exhaustive Monte Carlo search, with the results indicating reasonable optimization results. The workflow has been implemented inside the Idaho National Laboratory’s Risk Analysis and Virtual Environment (RAVEN) framework. The main contribution of this study addresses several challenges in the current optimization methods of the energy portfolios in IES: First, the feasibility of generating the synthetic time series of the periodic peak data; Second, the computational burden of the conventional stochastic optimization of the energy portfolio, associated with the need for repeated executions of system models; Third, the inadequacies of previous studies in terms of the comparisons of the impact of the economic parameters. The proposed workflow can provide a scientifically defendable strategy to support decision-making in the electricity market and to help energy distributors develop a better understanding of the performance of integrated energy systems.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Uncertainty quantification in machine learning for engineering design and health prognostics: A tutorial

On top of machine learning (ML) models, uncertainty quantification (UQ) functions as an essential layer of safety assurance that could lead to more principled decision making by enabling sound risk assessment and management. The safety and reliability improvement of ML models empowered by UQ has the potential to significantly facilitate the broad adoption of ML solutions in high-stakes decision settings, such as healthcare, manufacturing, and aviation, to name a few. In this tutorial, we aim to provide a holistic lens on emerging UQ methods for ML models with a particular focus on neural networks and the applications of these UQ methods in tackling engineering design as well as prognostics and health management problems. Towards this goal, we start with a comprehensive classification of uncertainty types, sources, and causes pertaining to UQ of ML models. Next, we provide a tutorial-style description of several state-of-the-art UQ methods: Gaussian process regression, Bayesian neural network, neural network ensemble, and deterministic UQ methods focusing on spectral-normalized neural Gaussian process. Established upon the mathematical formulations, we subsequently examine the soundness of these UQ methods quantitatively and qualitatively (by a toy regression example) to examine their strengths and shortcomings from different dimensions. Then, we review quantitative metrics commonly used to assess the quality of predictive uncertainty in classification and regression problems. Afterward, we discuss the increasingly important role of UQ of ML models in solving challenging problems in engineering design and health prognostics. In conclusion, two case studies with source codes available on GitHub are used to demonstrate these UQ methods and compare their performance in the life prediction of lithium-ion batteries at the early stage (case study 1) and the remaining useful life prediction of turbofan engines (case study 2).

97 MATHEMATICS AND COMPUTING↗