Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian 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.

At least 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Learning occupants’ indoor comfort temperature through a Bayesian inference approach for office buildings in United States

A carefully chosen indoor comfort temperature as the thermostat set-point is the key to optimizing building energy use and occupants’ comfort and well-being. ASHRAE Standard 55 or ISO Standard 7730 uses the PMV-PPD model or the adaptive comfort model that is based on small-sized or outdated sample data, which raises questions on whether and how ranges of occupant thermal comfort temperature should be revised using more recent larger-sized dataset. In this paper, a Bayesian inference approach has been used to derive new occupant comfort temperature ranges for U.S. office buildings using the ASHRAE Global Thermal Comfort Database. Bayesian inference can express uncertainty and incorporate prior knowledge. The comfort temperatures were found to be higher and less variable at cooling mode than at heating mode, and with significant overlapped variation ranges between the two modes. The comfort operative temperature of occupants varies between 21.9 and 25.4 °C for the cooling mode with a median of 23.7 °C, and between 20.5 and 24.9 °C for the heating mode with a median of 22.7 °C. These comfort temperature ranges are similar to the current ASHRAE standard 55 in the heating mode but 2–3 °C lower in the cooling mode. Finally, the results of this study could be adopted as more realistic thermostat set-points in building design, operation, control optimization, energy performance analysis, and policymaking.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Neural message-passing for objective-based uncertainty quantification and optimal experimental design

Various real-world scientific applications involve the mathematical modeling of complex uncertain systems with numerous unknown parameters. Accurate parameter estimation is often practically infeasible in such systems, as the available training data may be insufficient and the cost of acquiring additional data may be high. In such cases, based on a Bayesian paradigm, we can design robust operators retaining the best overall performance across all possible models and design optimal experiments that can effectively reduce uncertainty to enhance the performance of such operators maximally. While objective-based uncertainty quantification (objective-UQ) based on MOCU (mean objective cost of uncertainty) provides an effective means for quantifying uncertainty in complex systems, the high computational cost of estimating MOCU has been a challenge in applying it to real-world scientific/engineering problems. In this work, we propose a novel scheme to reduce the computational cost for objective-UQ via MOCU based on a data-driven approach. We adopt a neural message-passing model for surrogate modeling, incorporating a novel axiomatic constraint loss that penalizes an increase in the estimated system uncertainty. As an illustrative example, we consider the optimal experimental design (OED) problem for uncertain Kuramoto models, where the goal is to predict the experiments that can most effectively enhance robust synchronization performance through uncertainty reduction. We show that our proposed approach can accelerate MOCU-based OED by four to five orders of magnitude, without any visible performance loss compared to the state-of-the-art. The proposed approach applies to general OED tasks, beyond the Kuramoto model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Nonlinear gyrokinetic predictions of SPARC burning plasma profiles enabled by surrogate modeling

Multi-channel, nonlinear predictions of core temperature and density profiles are performed for the SPARC tokamak accounting for both kinetic neoclassical and fully nonlinear gyro-kinetic turbulent fluxes. A series of flux-tube, nonlinear, electromagnetic simulations using the CGYRO code with six gyrokinetic species are coupled to a nonlinear optimizer using Gaussian process regression techniques. The simultaneous evolution of energy sources, including alpha heat, radiation, and energy exchange, coupled with these high fidelity models and techniques, leads to a converged solution in electron temperature, ion temperature and electron density channels with a minimal number of expensive gyrokinetic simulations without compromising accuracy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Performance Optimization of the IOTA Duoplasmatron Proton Source

We present results from online optimization studies of a duoplasmatron ion source designed to produce 50~keV protons for acceleration to 2.5~MeV and subsequent injection into the Integrable Optics Test Accelerator (IOTA) at Fermilab. Using a Bayesian exploration technique, we developed multi-parameter models of the source s proton current and employed these models to optimize its performance. Depending on the spectrometer configuration used to isolate the proton beam and the chosen optimization objective, we identified three candidate operating points, achieving normalized 50~\% emittances between 0.57 and 1.3~\textmu m and a maximum proton current of $14.5 \pm 0.6$~mA.

Banerjee, Nilanjan [Fermilab] (ORCID:0000000344660↗
DOE OSTI2019

Towards a fully automated algorithm driven platform for biosystems design

Large-scale data acquisition and analysis are often required in the successful implementation of the design, build, test, and learn (DBTL) cycle in biosystems design. However, it has long been hindered by experimental cost, variability, biases, and missed insights from traditional analysis methods. Here, we report the application of an integrated robotic system coupled with machine learning algorithms to fully automate the DBTL process for biosystems design. As proof of concept, we have demonstrated its capacity by optimizing the lycopene biosynthetic pathway. This fully-automated robotic platform, BioAutomata, evaluates less than 1% of possible variants while outperforming random screening by 77%. A paired predictive model and Bayesian algorithm select experiments which are performed by Illinois Biological Foundry for Advanced Biomanufacturing (iBioFAB). BioAutomata excels with black-box optimization problems, where experiments are expensive and noisy and the success of the experiment is not dependent on extensive prior knowledge of biological mechanisms.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Multi-scale Simulation, Calibration, and Optimization of Calcium Carbonate Precipitation in Microbial Communities

Ensuring the efficient engineering of microbially induced calcium carbonate precipitation (MICP) is crucial for a variety of environmental and civil engineering applications, such as soil stabilization and carbon sequestration. Addressing this need, we present a comprehensive multi-scale workflow that begins with the isolation of calcium carbonate-producing microbes from soil samples, followed by metagenomic sequencing and metabolic reconstruction. We then characterize microbial growth phenotypes under diverse nutrient conditions, compare observed growth with metabolic model predictions, and apply the Consistent Reproduction of Phenotype (CROP) algorithm to refine these models. Furthermore, we analyze metabolite consumption and production, and develop a consumer-resource model that is calibrated using time-series measurements of growth rates, pH levels, and calcium carbonate precipitation. The primary benefit of our approach lies in its ability to predict and control MICP outcomes, facilitated by a Bayesian methodology that incorporates priors on initial conditions and parameters. This allows us to compute posteriors by integrating experimental data, and to solve a risk optimization problem under uncertainty to identify nutrient conditions that maximize calcium carbonate production. In contrast to non-Bayesian methods, which fail to quantify uncertainty accurately, our approach provides a more reliable pathway to optimizing nutrient conditions, enhancing the likelihood of achieving desired MICP outcomes. This positions our method as a superior alternative in the quest to improve MICP through engineered microbial consortia.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Ensemble variational Fokker-Planck methods for data assimilation

Particle flow filters solve Bayesian inference problems by smoothly transforming a set of particles into samples from the posterior distribution. Particles move in state space under the flow of an McKean-Vlasov-Itˆo process. This work introduces the Variational Fokker-Planck (VFP) framework for data assimilation, a general approach that includes previously known particle flow filters as special cases. The McKean-Vlasov-Itˆo process that transforms particles is defined via an optimal drift that depends on the selected diffusion term. It is established that the underlying probability density - sampled by the ensemble of particles - converges to the Bayesian posterior probability density. For a finite number of particles the optimal drift contains a regularization term that nudges particles toward becoming independent random variables. Based on this analysis, we derive computationally-feasible approximate regularization approaches that penalize the mutual information between pairs of particles, and avoid particle collapse. Moreover, the diffusion plays a role akin to a particle rejuvenation approach that aims to alleviate particle collapse. The VFP framework is very flexible. Different assumptions on prior and intermediate probability distributions can be used to implement the optimal drift, and localization and covariance shrinkage can be applied to alleviate the curse of dimensionality. A robust implicit-explicit method is discussed for the efficient integration of stiff McKean- Vlasov-Itˆo processes. Here, the effectiveness of the VFP framework is demonstrated on three progressively more challenging test problems, namely the Lorenz ’63, Lorenz ’96 and the quasi-geostrophic equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Reinforcement learning for adaptive maintenance policy optimization under imperfect knowledge of the system degradation model and partial observability of system states

Maintenance policy optimization usually is faced with challenges that arise from an imperfect knowledge of system degradation models and from the partial observability of system degradation states. Here, this paper proposes a reinforcement learning method to address these two challenges for a class of maintenance problems with Markov degradation processes. The reinforcement learning approach consists of a learning component and a planning component. Using sequentially collected observations, at each step of decision-making the learning component improves the knowledge of system degradation in terms of the probability distributions of the transition rates based on sequential Bayesian inference. Using the updated transition rates, at each step of decision-making the maintenance policy optimization problem is then formulated as a partially observable Markov decision problem, and the planning component computes the optimal maintenance policy that maximizes the expected cumulative reward. The proposed method is illustrated using a numerical example with repair and inspection maintenance actions. The result shows that as more observations are collected, the learning component progressively learns the true system degradation process, and the planning component adjusts the optimal maintenance policy accordingly as well, which leads to increased reward.

42 ENGINEERING↗
NASA NTRS2004

Automatic Generation of Algorithms for the Statistical Analysis of Planetary Nebulae Images

Analyzing data sets collected in experiments or by observations is a Core scientific activity. Typically, experimentd and observational data are &aught with uncertainty, and the analysis is based on a statistical model of the conjectured underlying processes, The large data volumes collected by modern instruments make computer support indispensible for this. Consequently, scientists spend significant amounts of their time with the development and refinement of the data analysis programs. AutoBayes [GF+02, FS03] is a fully automatic synthesis system for generating statistical data analysis programs. Externally, it looks like a compiler: it takes an abstract problem specification and translates it into executable code. Its input is a concise description of a data analysis problem in the form of a statistical model as shown in Figure 1; its output is optimized and fully documented C/C++ code which can be linked dynamically into the Matlab and Octave environments. Internally, however, it is quite different: AutoBayes derives a customized algorithm implementing the given model using a schema-based process, and then further refines and optimizes the algorithm into code. A schema is a parameterized code template with associated semantic constraints which define and restrict the template s applicability. The schema parameters are instantiated in a problem-specific way during synthesis as AutoBayes checks the constraints against the original model or, recursively, against emerging sub-problems. AutoBayes schema library contains problem decomposition operators (which are justified by theorems in a formal logic in the domain of Bayesian networks) as well as machine learning algorithms (e.g., EM, k-Means) and nu- meric optimization methods (e.g., Nelder-Mead simplex, conjugate gradient). AutoBayes augments this schema-based approach by symbolic computation to derive closed-form solutions whenever possible. This is a major advantage over other statistical data analysis systems which use numerical approximations even in cases where closed-form solutions exist. AutoBayes is implemented in Prolog and comprises approximately 75.000 lines of code. In this paper, we take one typical scientific data analysis problem-analyzing planetary nebulae images taken by the Hubble Space Telescope-and show how AutoBayes can be used to automate the implementation of the necessary anal- ysis programs. We initially follow the analysis described by Knuth and Hajian [KHO2] and use AutoBayes to derive code for the published models. We show the details of the code derivation process, including the symbolic computations and automatic integration of library procedures, and compare the results of the automatically generated and manually implemented code. We then go beyond the original analysis and use AutoBayes to derive code for a simple image segmentation procedure based on a mixture model which can be used to automate a manual preproceesing step. Finally, we combine the original approach with the simple segmentation which yields a more detailed analysis. This also demonstrates that AutoBayes makes it easy to combine different aspects of data analysis.

Fischer, Bernd↗
DOE OSTI2026

Multi-Modal Bayesian Neural Network Surrogates with Conjugate Last-Layer Estimation

As data collection and simulation capabilities advance, multi-modal learning, the task of learning from multiple modalities and sources of data, is becoming an increasingly important area of research. Surrogate models that learn from data of multiple auxiliary modalities to support the modeling of a highly expensive quantity of interest have the potential to aid outer loop applications such as optimization, inverse problems, or sensitivity analyses when multi-modal data are available. We develop two multi-modal Bayesian neural network surrogate models and leverage conditionally conjugate distributions in the last layer to estimate model parameters using stochastic variational inference (SVI). We provide a method to perform this conjugate SVI estimation in the presence of partially missing observations. Here, we demonstrate improved prediction accuracy and uncertainty quantification compared to unimodal surrogate models for both scalar and time series data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Bayesian projection pursuit regression

In projection pursuit regression (PPR), a univariate response variable is approximated by the sum of $M$ “ridge functions,” which are flexible functions of one-dimensional projections of a multivariate input variable. Traditionally, optimization routines are used to choose the projection directions and ridge functions via a sequential algorithm, and $M$ is typically chosen via cross-validation. Here, we introduce a novel Bayesian version of PPR, which has the benefit of accurate uncertainty quantification. To infer appropriate projection directions and ridge functions, we apply novel adaptations of methods used for the single ridge function case ($M$=1), called the Bayesian Single Index Model; and use a Reversible Jump Markov chain Monte Carlo algorithm to infer the number of ridge functions $M$. We evaluate the predictive ability of our model in 20 simulated scenarios and for 23 real datasets, in a bake-off against an array of state-of-the-art regression methods. Finally, we generalize this methodology and demonstrate the ability to accurately model multivariate response variables. Its effective performance indicates that Bayesian Projection Pursuit Regression is a valuable addition to the existing regression toolbox.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Coupled Investigation of Fracture Permeability Impact on Reservoir Stress and Seismic Slip Behavior

Our goal is to develop, apply and validate a holistic thermal, hydrologic, mechanical, and chemical (THMC) workflow that includes evaluation of induced seismic slip in EGS reservoirs. We will integrate experimental and modeling approaches to reduce parameter uncertainty and better predict/mitigate seismic hazard at EGS sites. Our novel approach couples 3D physics-based earthquake simulations with THMC models (THMc+E). This capability will enable improve engineering decisions at Utah-FORGE and move EGS operations toward repeatable, robust, economically viable, and socially accepted development. For example, our THMC+E models will predict circulation scenarios and related seismic hazard for a suite of flow rates and under uncertainty, thus enabling evaluation of optimal circulation strategy. Laboratory experiments will be performed to constrain key model parameters and Bayesian techniques will provide a probabilistic evaluation of parameters used in models. THMC+E simulations will enable exploration various circumstances that may hinder EGS success and develop mitigation strategies.

58 GEOSCIENCES↗
DOE OSTI2024

5-2428: Fracture Permeability Impact on Seismic Slip Behavior

Our goal is to develop, apply and validate a holistic thermal, hydrologic, mechanical, and chemical (THMC) workflow that includes evaluation of induced seismic slip in EGS reservoirs. We will integrate experimental and modeling approaches to reduce parameter uncertainty and better predict/mitigate seismic hazard at EGS sites. Our novel approach couples 3D physics-based earthquake simulations with THMC models (THMc+E). This capability will enable improve engineering decisions at Utah-FORGE and move EGS operations toward repeatable, robust, economically viable, and socially accepted development. For example, our THMC+E models will predict circulation scenarios and related seismic hazard for a suite of flow rates and under uncertainty, thus enabling evaluation of optimal circulation strategy. Laboratory experiments will be performed to constrain key model parameters and Bayesian techniques will provide a probabilistic evaluation of parameters used in models. THMC+E simulations will enable exploration various circumstances that may hinder EGS success and develop mitigation strategies.

58 GEOSCIENCES↗
DOE OSTI2023

Non-commutative disintegrations: Existence and uniqueness in finite dimensions

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes of 2-positive (resp. positive) unital maps form a category. We prove non-commutative disintegrations are a.e. unique whenever they exist. We provide an explicit characterization for when disintegrations exist in the setting of finite-dimensional C*-algebras, and we give formulas for the associated disintegrations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Efficient and choreographed quality-of- service management in dense 6G verticals with high-speed mobility requirements

Future 6G networks are envisioned to support very heterogeneous and extreme applications (known as verticals). Some examples are further-enhanced mobile broadband communications, where bitrates could go above one terabit per second, or extremely reliable and low-latency communications, whose end-to-end delay must be below one hundred microseconds. To achieve that ultra-high Quality-of-Service, 6G networks are commonly provided with redundant resources and intelligent management mechanisms to ensure that all devices get the expected performance. But this approach is not feasible or scalable for all verticals. Specifically, in 6G scenarios, mobile devices are expected to have speeds greater than 500 kilometers per hour, and device density will exceed ten million devices per square kilometer. In those verticals, resources cannot be redundant as, because of such a huge number of devices, Quality-of-Service requirements are pushing the effective performance of technologies at physical level. And, on the other hand, high-speed mobility prevents intelligent mechanisms to be useful, as devices move around and evolve faster than the usual convergence time of those intelligent solutions. New technologies are needed to fill this unexplored gap. Therefore, in this paper we propose a choreographed Quality-of-Service management solution, where 6G base stations predict the evolution of verticals at real-time, and run a lightweight distributed optimization algorithm in advance, so they can manage the resource consumption and ensure all devices get the required Quality-of-Service. Prediction mechanism includes mobility models (Markov, Bayesian, etc.) and models for time-variant communication channels. Besides, a traffic prediction solution is also considered to explore the achieved Quality-of-Service in advance. The optimization algorithm calculates an efficient resource distribution according to the predicted future vertical situation, so devices achieve the expected Quality-of-Service according to the proposed traffic models. An experimental validation based on simulation tools is also provided. Results show that the proposed approach reduces up to 12% of the network resource consumption for a given Quality-of-Service.

42 ENGINEERING↗
DOE OSTI2021

Exploring the physics of cesium lead halide perovskite quantum dots via Bayesian inference of the photoluminescence spectra in automated experiment

The unique optoelectronic properties of metal halide perovskite quantum dots (QDs) make them promising candidates for applications in light-emitting diodes (LEDs), scintillators, and other photonic devices. The automated micropipetting synthesis platform equipped with an optical reader enables the opportunity for high throughput synthesis and photoluminescent (PL) characterization of metal halide perovskite QDs for the first time. Here, we explore the compositional dependence of the PL behavior and stability of the combinatorial library of cesium lead halide (CsPbX 3 ) perovskites QDs via the automated platform. To study the stability of synthesized QDs in the binary and ternary configurations, we study the time-dependent PL properties using previously developed machine learning analysis. Additionally, to systematically explore the PL behavior in the ternary CsPbX 3 QDs system, we introduce the Bayesian inference framework that allows the probabilistic fit of multiple models to the PL data and establishes both optimal model and model parameter robustly. Furthermore, these behaviors can be used as a control parameter for the navigation of the multidimensional compositional spaces in automated synthesis. Furthermore, this analysis shows the nonuniformity of the PL peak behavior in the ternary CsPbX 3 QDs system. Further, the analysis confirms narrow size distribution and good quality of CsPbBr 3 QDs alloyed with low concentrations of iodide and chloride. We note that Bayesian Inference fit parameters can be further used as a control signal for navigation of the chemical spaces in automated synthesis.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Marginal unbiased score expansion and application to CMB lensing

Here, we present the marginal unbiased score expansion (MUSE) method, an algorithm for generic high-dimensional hierarchical Bayesian inference. MUSE performs approximate marginalization over arbitrary non-Gaussian latent parameter spaces, yielding Gaussianized asymptotically unbiased and near-optimal constraints on global parameters of interest. It is computationally much cheaper than exact alternatives like Hamiltonian Monte Carlo (HMC), excelling on funnel problems which challenge HMC, and does not require any problem-specific user supervision like other approximate methods such as variational inference or many simulation-based inference methods. MUSE makes possible the first joint Bayesian estimation of the delensed Cosmic Microwave Background (CMB) power spectrum and gravitational lensing potential power spectrum, demonstrated here on a simulated data set as large as the upcoming South Pole Telescope 3G 1500 deg 2 survey, corresponding to a latent dimensionality of ~6 million and of order 100 global bandpower parameters. On a subset of the problem where an exact but more expensive HMC solution is feasible, we verify that MUSE yields nearly optimal results. We also demonstrate that existing spectrum-based forecasting tools which ignore pixel-masking underestimate predicted error bars by only ~10%. This method is a promising path forward for fast lensing and delensing analyses which will be necessary for future CMB experiments such as SPT-3G, Simons Observatory, or CMB-S4, and can complement or supersede existing HMC approaches. The success of MUSE on this challenging problem strengthens its case as a generic procedure for a broad class of high-dimensional inference problems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗