Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bayesian methods”

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 541 records · Page 30

Deep Neural Network Informed Markov Chain Monte Carlo Methods

In subsurface flow modeling, quantifying the uncertainty of model parameters and the corresponding uncertainly on output quantities is a crucial task for groundwater management. Markov chain Monte Carlo (MCMC) methods can take advantage of observed data to estimate parameters in a Bayesian setting. However, MCMC can be slow to converge and produce highly correlated samples when the dimensions of the parameters is high. Using gradients for the posterior distribution can help samplers explore the parameter space more efficiently, but obtaining gradients can be computationally challenging.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

PRIME - A Software Toolkit for the Characterization of Partially Observed Epidemics in a Bayesian Framework

PRIME is a modeling framework designed for the “real-time’” characterization and forecasting of partially observed epidemics. Characterization is the estimation of infection spread parameters using daily counts of symptomatic patients. The method is designed to help guide medical resource allocation in the early epoch of the outbreak. The estimation problem is posed as one of Bayesian inference and solved using a Markov Chain Monte Carlo technique. The framework can accommodate multiple epidemic waves and can help identify different disease dynamics at the regional, state, and country levels. We include examples using publicly available COVID-19 data.

97 MATHEMATICS AND COMPUTING↗

Resolving Mixtures of Soot Characterized by SP-AMS Spectra Using a Latent Dirichlet Allocation Model

Soot produced by detonation or combustion events exhibits different chemical properties depending on the fuel, device construction, and environmental conditions in which the event occurs. These properties can be useful for defining relevant signatures for probabilistically identifying the different types of events that occurred, based on the soot that is produced from these events. However, it is rare to observe samples of soot from a detonation or combustion that are not contaminated by outside particles. In this paper, we present a method for resolving mixtures of soot to determine the contributions of sources that may be present in samples of recovered soot. We use Latent Dirichlet Allocation to describe the generative process for a sample of recovered soot, and use Variational Bayesian Inference to learn about the parameters associated with the generative model. We demonstrate the utility of this method by considering real samples of mixtures of soot under various frameworks to show that the model is able to identify the different components present in a sample of soot as well as their mixing proportions.

54 ENVIRONMENTAL SCIENCES↗

Adaptive hyperparameter updating for training restricted Boltzmann machines on quantum annealers

Restricted Boltzmann Machines (RBMs) have been proposed for developing neural networks for a variety of unsupervised machine learning applications such as image recognition, drug discovery, and materials design. The Boltzmann probability distribution is used as a model to identify network parameters by optimizing the likelihood of predicting an output given hidden states trained on available data. Training such networks often requires sampling over a large probability space that must be approximated during gradient based optimization. Quantum annealing has been proposed as a means to search this space more efficiently which has been experimentally investigated on D-Wave hardware. D-Wave implementation requires selection of an effective inverse temperature or hyperparameter (β) within the Boltzmann distribution which can strongly influence optimization. Here, we show how this parameter can be estimated as a hyperparameter applied to D-Wave hardware during neural network training by maximizing the likelihood or minimizing the Shannon entropy. We find both methods improve training RBMs based upon D-Wave hardware experimental validation on an image recognition problem. Neural network image reconstruction errors are evaluated using Bayesian uncertainty analysis which illustrate more than an order magnitude lower image reconstruction error using the maximum likelihood over manually optimizing the hyperparameter. The maximum likelihood method is also shown to out-perform minimizing the Shannon entropy for image reconstruction.

97 MATHEMATICS AND COMPUTING↗

Demonstration of an AI-driven workflow for dynamic x-ray spectroscopy

X-ray absorption near edge structure (XANES) spectroscopy is a powerful technique for characterizing the chemical state and symmetry of individual elements within materials, but requires collecting data at many energy points which can be time-consuming. While adaptive sampling methods exist for efficiently collecting spectroscopic data, they often lack domain-specific knowledge about the structure of XANES spectra. Here we demonstrate a knowledge-injected Bayesian optimization approach for adaptive XANES data collection that incorporates understanding of spectral features like absorption edges and pre-edge peaks. We show this method accurately reconstructs the absorption edge of XANES spectra using only 15–20% of the measurement points typically needed for conventional sampling, while maintaining the ability to determine the x-ray energy of the sharp peak after the absorption edge with errors less than 0.03 eV, the absorption edge with errors less than 0.1 eV; and overall root-mean-square errors less than 0.005 compared to traditionally sampled spectra. Our experiments on battery materials and catalysts demonstrate the method’s effectiveness for both static and dynamic XANES measurements, improving data collection efficiency and enabling better time resolution for tracking chemical changes. This approach advances the degree of automation in XANES experiments, reducing the common errors of under- or over-sampling points near the absorption edge and enabling dynamic experiments that require high temporal resolution or limited measurement time.

Bayesian optimization↗

Bayesian prior construction for uncertainty quantification in first-principles statistical mechanics

First-principles statistical mechanics enables the prediction of thermodynamic and kinetic properties of materials, but is computationally expensive. Many approaches require surrogate models to calculate energies within Monte Carlo or molecular dynamics simulations. Inexpensive surrogates such as cluster expansions enable otherwise intractable calculations by interpolating data from higher accuracy methods, such as Density Functional Theory (DFT). Surrogate models introduce uncertainty into downstream calculations, in addition to any uncertainty inherent to DFT calculations. Bayesian frameworks address this by quantifying uncertainty and incorporating expert knowledge through priors. However, constructing effective priors remains challenging. This work introduces and describes practical strategies for building Bayesian cluster expansions, focusing on basis truncation, hyperparameter selection, and ground state replication. We analyze multiple basis truncation schemes, compare cross-validation to the evidence-approximation for hyperparameter optimization, and provide methods to find and enforce ground-state-preserving models through priors. Additionally, we compare the uncertainties between different approximations to DFT (LDA, PBE, SCAN) against the uncertainty introduced with the use of cluster expansion surrogate models. These approaches are demonstrated on the BCC Li x Mg 1-x and Li x Al 1-x alloys, which are both of interest for solid-state Li batteries. Our results provide guidelines for constructing and utilizing Bayesian cluster expansions, thereby improving the transparency of materials modeling. Furthermore, the approaches and insights developed in this work can be transferred to a wide range of cluster expansion surrogate models, including the atomic cluster expansion and related machine-learned interatomic potential architectures.

Alloy theory↗

Domain Knowledge Guided Bayesian Optimization For Autonomous Alignment Of Complex Scientific Instruments

Bayesian Optimization (BO) is a powerful tool for optimizing complex non-linear systems. However, its performance degrades in high-dimensional problems with tightly coupled parameters and highly asymmetric objective landscapes, where rewards are sparse. In such needle-in-a-haystack scenarios, even advanced methods like trust-region BO (TurBO) often lead to unsatisfactory results. We propose a domain knowledge guided Bayesian Optimization approach, which leverages physical insight to fundamentally simplify the search problem by transforming coordinates to decouple input features and align the active subspaces with the primary search axes. We demonstrate this approach's efficacy on a challenging 12-dimensional, 6-crystal Split-and-Delay optical system, where conventional approaches, including standard BO, TuRBO and multi-objective BO, consistently led to unsatisfactory results. When combined with an reverse annealing exploration strategy, this approach reliably converges to the global optimum. The coordinate transformation itself is the key to this success, significantly accelerating the search by aligning input co-ordinate axes with the problem's active subspaces. As increasingly complex scientific instruments, from large telescopes to new spectrometers at X-ray Free Electron Lasers are deployed, the demand for robust high-dimensional optimization grows. Our results demonstrate a generalizable paradigm: leveraging physical insight to transform high-dimensional, coupled optimization problems into simpler representations can enable rapid and robust automated tuning for consistent high performance while still retaining current optimization algorithms.

FOS: Computer and information sciences↗

Cosmological neutrino mass: a frequentist overview in light of DESI

We derive constraints on the neutrino mass using a variety of recent cosmological datasets, including DESI BAO, the full-shape analysis of the DESI matter power spectrum and the one-dimensional power spectrum of the Lyman-α forest (P1D) from eBOSS quasars as well as the cosmic microwave background (CMB). The constraints are obtained in the frequentist formalism by constructing profile likelihoods and applying the Feldman-Cousins prescription to compute confidence intervals. This method avoids potential prior and volume effects that may arise in a comparable Bayesian analysis. Parabolic fits to the profiles allow one to distinguish changes in the upper limits from variations in the constraining power σ of the different data combinations. We find that all profiles in the ΛCDM model are cut off by the ∑m ν ≥ 0 bound, meaning that the corresponding parabolas reach their minimum in the unphysical sector. The most stringent 95% C.L. upper limit is obtained by the combination of DESI DR2 BAO, Planck PR4 and CMB lensing at 53 meV, below the minimum of 59 meV set by the normal ordering. The corresponding constraining power σ is 43 meV, which highlights the importance of the cut-off by negative values in the determination of the upper limit. Extending ΛCDM to non-zero curvature and w 0 w a CDM relaxes the constraints past 59 meV again, but only w 0 w a CDM exhibits profiles with a minimum at a positive value. Additionally, we extend the formalism to constrain the lightest neutrino mass. For DESI DR2 BAO, Planck PR4 and CMB lensing, we find confidence limits at 20 and 19 meV for normal and inverted ordering, respectively. Using a combination of DESI DR1 full-shape, BBN and eBOSS Lyman-α P1D, we successfully constrain the neutrino mass independently of the CMB. This combination yields m l ≤ 97 and 98 meV in the normal and inverted orderings, and total neutrino mass ∑m ν ≤ 285 meV (95% C.L.). The addition of DESI full-shape or Lyman-α P1D to CMB and DESI BAO results in small but noticeable improvement of the constraining power of the data. Lyman-α free-streaming measurements especially improve the constraint. Since they are based on eBOSS data, this sets a promising precedent for upcoming DESI data.

Frequentist statistics↗

Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo

As an important Markov chain Monte Carlo (MCMC) method, the stochastic gradient Langevin dynamics (SGLD) algorithm has achieved great success in Bayesian learning and posterior sampling. Furthermore, SGLD typically suffers from a slow convergence rate due to its large variance caused by the stochastic gradient. In order to alleviate these drawbacks, we leverage the recently developed Laplacian smoothing technique and propose a Laplacian smoothing stochastic gradient Langevin dynamics (LS-SGLD) algorithm. We prove that for sampling from both log-concave and non-log-concave densities, LS-SGLD achieves strictly smaller discretization error in 2-Wasserstein distance, although its mixing rate can be slightly slower. Experiments on both synthetic and real datasets verify our theoretical results and demonstrate the superior performance of LS-SGLD on different machine learning tasks including posterior sampling, Bayesian logistic regression, and training Bayesian convolutional neural networks.

97 MATHEMATICS AND COMPUTING↗

Automated Adversary-in-the-Loop Cyber-Physical Defense Planning

Security of cyber-physical systems (CPS) continues to pose new challenges due to the tight integration and operational complexity of the cyber and physical components. To address these challenges, this article presents a domain-aware, optimization-based approach to determine an effective defense strategy for CPS in an automated fashion—by emulating a strategic adversary in the loop that exploits system vulnerabilities, interconnection of the CPS, and the dynamics of the physical components. Our approach builds on an adversarial decision-making model based on a Markov Decision Process (MDP) that determines the optimal cyber (discrete) and physical (continuous) attack actions over a CPS attack graph. The defense planning problem is modeled as a non-zero-sum game between the adversary and defender. We use a model-free reinforcement learning method to solve the adversary’s problem as a function of the defense strategy. We then employ Bayesian optimization (BO) to find an approximate best-response for the defender to harden the network against the resulting adversary policy. This process is iterated multiple times to improve the strategy for both players. We demonstrate the effectiveness of our approach on a ransomware-inspired graph with a smart building system as the physical process. Numerical studies show that our method converges to a Nash equilibrium for various defender-specific costs of network hardening.

97 MATHEMATICS AND COMPUTING↗

Bayesian Poroelastic Aquifer Characterization From InSAR Surface Deformation Data. 2. Quantifying the Uncertainty

Uncertainty quantification of groundwater (GW) aquifer parameters is critical for efficient management and sustainable extraction of GW resources. These uncertainties are introduced by the data, model, and prior information on the parameters. We develop a Bayesian inversion framework that uses Interferometric Synthetic Aperture Radar (InSAR) surface deformation data to infer the laterally heterogeneous permeability of a transient linear poroelastic model of a confined GW aquifer. The Bayesian solution of this inverse problem takes the form of a posterior probability density of the permeability. Exploring this posterior using classical Markov chain Monte Carlo (MCMC) methods is computationally prohibitive due to the large dimension of the discretized permeability field and the expense of solving the poroelastic forward problem. However, in many partial differential equation (PDE)-based Bayesian inversion problems, the data are only informative in a few directions in parameter space. For the poroelasticity problem, we prove this property theoretically for a one-dimensional problem and demonstrate it numerically for a three-dimensional aquifer model. Here we design a generalized preconditioned Crank-Nicolson (gpCN) MCMC method that exploits this intrinsic low dimensionality by using a low-rank-based Laplace approximation of the posterior as a proposal, which we build scalably. The feasibility of our approach is demonstrated through a real GW aquifer test in Nevada. The inherently two-dimensional nature of InSAR surface deformation data informs a sufficient number of modes of the permeability field to allow detection of major structures within the aquifer, significantly reducing the uncertainty in the pressure and the displacement quantities of interest.

54 ENVIRONMENTAL SCIENCES↗

Multisource Data Fusion Outage Location in Distribution Systems via Probabilistic Graphical Models

Efficient outage location is critical to enhancing the resilience of power distribution systems. However, accurate outage location requires combining massive evidence received from diverse data sources, including smart meter (SM) last gasp signals, customer trouble calls, social media messages, weather data, vegetation information, and physical parameters of the network. This is a computationally complex task due to the high dimensionality of data in distribution grids. In this paper, we propose a multi-source data fusion approach to locate outage events in partially observable distribution systems using Bayesian networks (BNs). A novel aspect of the proposed approach is that it takes multi-source evidence and the complex structure of distribution systems into account using a probabilistic graphical method. Our method can radically reduce the computational complexity of outage location inference in high-dimensional spaces. The graphical structure of the proposed BN is established based on the network’s topology and the causal relationship between random variables, such as the states of branches/customers and evidence. Utilizing this graphical model, accurate outage locations are obtained by leveraging a Gibbs sampling (GS) method, to infer the probabilities of de-energization for all branches. Compared with commonly-used exact inference methods that have exponential complexity in the size of the BN, GS quantifies the target conditional probability distributions in a timely manner. As a result, a case study of several real-world distribution systems is presented to validate the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Improvement of Drop‐Hammer Impact Testing for Safety Assessment of High Explosives Using 10‐mg Samples

Here, in this study, we established an improved method for drop-hammer impact testing of small quantities of high explosives (10 mg). We performed about seven hundred impact tests under various experimental conditions (e.g., sandpaper vs bare anvil, different sample masses, drop-weights, and striker diameters) to determine an optimal set of conditions and reaction detection methods (e.g., gas analysis, video, and sound recordings) that give the most statistically reliable results with 10 mg samples. We used both Frequentist and Bayesian statistical approaches to compare estimates of the drop height (DH50) that initiates a reaction 50% of the time, and to quantify the associated uncertainty. Gas analysis proved to be the most reliable reaction detection method, showing unambiguous rises in HE decomposition products (e.g., CO 2 ) even when the other indicators (e.g., sound, video) were inconclusive. The impact tests performed with a bare anvil showed much better reproducibility than those conducted with sandpaper, reducing the largest uncertainty observed in the data sets by a factor of 1.7. The DH 50 values obtained from three different sample masses (10, 20, and 35 mg) fell within the uncertainties of the measurements. We demonstrated the improved procedure (i.e., 10-mg samples, gas analysis, bare anvil, and Bayesian approach) on a variety of PETN samples having different surface areas and thermal histories.

PETN↗

Disentangling the Black Hole Mass Spectrum with Photometric Microlensing Surveys

Abstract From the formation mechanisms of stars and compact objects to nuclear physics, modern astronomy frequently leverages surveys to understand populations of objects to answer fundamental questions. The population of dark and isolated compact objects in the Galaxy contains critical information related to many of these topics, but is only practically accessible via gravitational microlensing. However, photometric microlensing observables are degenerate for different types of lenses, and one can seldom classify an event as involving either a compact object or stellar lens on its own. To address this difficulty, we apply a Bayesian framework that treats lens type probabilistically and jointly with a lens population model. This method allows lens population characteristics to be inferred despite intrinsic uncertainty in the lens class of any single event. We investigate this method’s effectiveness on a simulated ground-based photometric survey in the context of characterizing a hypothetical population of primordial black holes (PBHs) with an average mass of 30 M ⊙ . On simulated data, our method outperforms current black hole (BH) lens identification pipelines and characterizes different subpopulations of lenses while jointly constraining the PBH contribution to dark matter to ≈25%. Key to robust inference, our method can marginalize over population model uncertainty. We find the lower mass cutoff for stellar origin BHs, a key observable in understanding the BH mass gap, particularly difficult to infer in our simulations. This work lays the foundation for cutting-edge PBH abundance constraints to be extracted from current photometric microlensing surveys.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bayesian Monte Carlo Evaluation Framework for Imperfect Nuclear Data

Bayesian evaluation of resolved resonance region (RRR) nuclear data has historically been carried out using the generalized least squares (GLS) formalism, as implemented in, e.g., SAMMY. We have recently developed a prototype of Bayesian Monte Carlo (BMC) evaluation framework, implemented using a Markov Chain Monte Carlo (MCMC) method with a Metropolis-Hastings (MH) acceptance criterion. This was done in order to remove the approximations underlying the conventional GLS evaluations, namely, the linear approximation, and the approximation that all probability density functions (PDFs) are of the normal kind. Recent works by others have used similar stochastic approaches to quantify cross section uncertainties from ENDF evaluated co-variances, and/or, from integral benchmark data, but those have not been conceived as an evaluation framework like the one presented here.

97 MATHEMATICS AND COMPUTING↗

Artificial intelligence for materials research at extremes

Abstract Materials development is slow and expensive, taking decades from inception to fielding. For materials research at extremes, the situation is even more demanding, as the desired property combinations such as strength and oxidation resistance can have complex interactions. Here, we explore the role of AI and autonomous experimentation (AE) in the process of understanding and developing materials for extreme and coupled environments. AI is important in understanding materials under extremes due to the highly demanding and unique cases these environments represent. Materials are pushed to their limits in ways that, for example, equilibrium phase diagrams cannot describe. Often, multiple physical phenomena compete to determine the material response. Further, validation is often difficult or impossible. AI can help bridge these gaps, providing heuristic but valuable links between materials properties and performance under extreme conditions. We explore the potential advantages of AE along with decision strategies. In particular, we consider the problem of deciding between low-fidelity, inexpensive experiments and high-fidelity, expensive experiments. The cost of experiments is described in terms of the speed and throughput of automated experiments, contrasted with the human resources needed to execute manual experiments. We also consider the cost and benefits of modeling and simulation to further materials understanding, along with characterization of materials under extreme environments in the AE loop. Graphical abstract AI sequential decision-making methods for materials research: Active learning, which focuses on exploration by sampling uncertain regions, Bayesian and bandit optimization as well as reinforcement learning (RL), which trades off exploration of uncertain regions with exploitation of optimum function value. Bayesian and bandit optimization focus on finding the optimal value of the function at each step or cumulatively over the entire steps, respectively, whereas RL considers cumulative value of the labeling function, where the latter can change depending on the state of the system (blue, orange, or green).

36 MATERIALS SCIENCE↗

Uncertainty Quantification for Point Spread Functions in X-Ray Radiography

X-ray radiographers have tools for estimating the point spread function (PSF) which determines the extent of the blur in images. Knowledge of uncertainties in their estimations can be extremely valuable, and existing methods do not provide this information. We have developed a new technique using a Bayesian framework that will provide useful uncertainties to the estimated PSF.

point spread function↗

PyApprox: Enabling efficient model analysis

PyApprox is a Python-based one-stop-shop for probabilistic analysis of scientific numerical models. Easy to use and extendable tools are provided for constructing surrogates, sensitivity analysis, Bayesian inference, experimental design, and forward uncertainty quantification. The algorithms implemented represent the most popular methods for model analysis developed over the past two decades, including recent advances in multi-fidelity approaches that use multiple model discretizations and/or simplified physics to significantly reduce the computational cost of various types of analyses. Simple interfaces are provided for the most commonly-used algorithms to limit a user’s need to tune the various hyper-parameters of each algorithm. However, more advanced work flows that require customization of hyper-parameters is also supported. An extensive set of Benchmarks from the literature is also provided to facilitate the easy comparison of different algorithms for a wide range of model analyses. This paper introduces PyApprox and its various features, and presents results demonstrating the utility of PyApprox on a benchmark problem modeling the advection of a tracer in ground water.

97 MATHEMATICS AND COMPUTING↗