Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian search”

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 73 records · Page 4

Active Learning Guided Computational Discovery of Plant-Based Redoxmers for Organic Nonaqueous Redox Flow Batteries

Organic nonaqueous redox flow batteries (ONRFBs) are promising energy storage devices due to their scalability and reliance on sourceable materials. However, finding suitable redox-active organic molecules (redoxmers) for these batteries remains a challenge. Using plant-based compounds as precursors for these redoxmers can decrease their costs and environmental toxicity. In this computational study, flavonoid molecules have been examined as potential redoxmers for ONRFBs. Flavone and isoflavone derivatives were selected as catholyte (positive charge carrier) and anolyte (negative charge carrier) molecules, respectively. To drive their redox potentials to the opposite extremes, in silico derivatization was performed using a novel algorithm to generate a library of > 40000 candidate molecules that penalizes overly complex structures. A multiobjective Bayesian optimization based active learning algorithm was then used to identify best redoxmer candidates in these search spaces. Furthermore, our study provides methodologies for molecular design and optimization of natural scaffolds and highlights the need of incorporating expert chemistry awareness of the natural products and the basic rules of synthetic chemistry in machine learning.

25 ENERGY STORAGE↗

Identifiability and characterization of transmon qutrits through Bayesian experimental design

Robust control of a quantum system is essential to utilize the current noisy quantum hardware to its full potential, such as quantum algorithms. To achieve such a goal, a systematic search for an optimal control for any given experiment is essential. The design of optimal control pulses requires accurate numerical models and, therefore, accurate characterization of the system parameters. We present an online Bayesian approach for quantum characterization of qutrit systems, which automatically and systematically identifies optimal experiments that provide maximum information on the system parameters, thereby greatly reducing the number of experiments that need to be performed on the quantum testbed. Unlike most characterization protocols that provide point-estimates of the parameters, the proposed approach is able to estimate their probability distribution. The applicability of the Bayesian experimental design technique was demonstrated on test problems, where each experiment was defined by a parameterized control pulse. In addition to this, we also present an approach for iterative pulse extension, which is robust under uncertainties in transition frequencies and coherence times, and shot noise, despite being initialized with wide uninformative priors. Furthermore, we provide a mathematical proof of the theoretical identifiability of the model parameters and present conditions on the quantum state under which the parameters are identifiable. The proof and conditions for identifiability are presented for both closed and open quantum systems using the Schrödinger equation and the Lindblad master equation, respectively.

97 MATHEMATICS AND COMPUTING↗

Using Bayesian Networks for Candidate Generation in Consistency-based Diagnosis

Consistency-based diagnosis relies heavily on the assumption that discrepancies between model predictions and sensor observations can be detected accurately. When sources of uncertainty like sensor noise and model abstraction exist robust schemes have to be designed to make a binary decision on whether predictions are consistent with observations. This risks the occurrence of false alarms and missed alarms when an erroneous decision is made. Moreover when multiple sensors (with differing sensing properties) are available the degree of match between predictions and observations can be used to guide the search for fault candidates. In this paper we propose a novel approach to handle this problem using Bayesian networks. In the consistency- based diagnosis formulation, automatically generated Bayesian networks are used to encode a probabilistic measure of fit between predictions and observations. A Bayesian network inference algorithm is used to compute most probable fault candidates.

Narasimhan, Sriram↗

Coupling 1D xRAGE simulations with machine learning for graded inner shell design optimization in double shell capsules

Advances in machine learning provide the ability to leverage data from expensive simulations of high-energy-density experiments to significantly cut down on computational time and costs associated with the search for optimal target designs. This study presents an application of cutting-edge Bayesian optimization methods to the one-dimensional (1D) design optimization of double shell graded layer targets for inertial confinement fusion experiments. This investigation attempts to reduce hydrodynamic instabilities while retaining high yields for future NIF experiments. Machine learning methods can use predictive physics simulations to identify graded layer designs from within the vast design space that demonstrate high predicted performance, including novel designs with high uncertainty in performance that may hold unexpected promise. By applying machine learning tools to the simulation design, we map the trade-off between 1D yield and instability, specifically isolating parameter ranges, which maintain high performance while showing significantly improved Rayleigh–Taylor stability over the point design. Furthermore, the groundwork laid in this study will be a useful design tool for future NIF experiments with graded layer targets.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Exploring unsupervised top tagging using Bayesian inference

Recognizing hadronically decaying top-quark jets in a sample of jets, or even its total fraction in the sample, is an important step in many LHC searches for Standard Model and Beyond Standard Model physics as well. Although there exists outstanding top-tagger algorithms, their construction and their expected performance rely on Montecarlo simulations, which may induce potential biases. For these reasons we develop two simple unsupervised top-tagger algorithms based on performing Bayesian inference on a mixture model. In one of them we use as the observed variable a new geometrically-based observable \tilde{A}_{3} A ̃ 3 , and in the other we consider the more traditional \tau_{3}/\tau_{2} τ 3 / τ 2 N N -subjettiness ratio, which yields a better performance. As expected, we find that the unsupervised tagger performance is below existing supervised taggers, reaching expected Area Under Curve AUC \sim 0.80-0.81 ∼ 0.80 − 0.81 and accuracies of about 69% - − 75% in a full range of sample purity. However, these performances are more robust to possible biases in the Montecarlo that their supervised counterparts. Our findings are a step towards exploring and considering simpler and unbiased taggers.

Alvarez, Ezequiel↗

Multi-objective Bayesian optimization of ferroelectric materials with interfacial control for memory and energy storage applications

Optimization of materials’ performance for specific applications often requires balancing multiple aspects of materials’ functionality. Even for the cases where a generative physical model of material behavior is known and reliable, this often requires search over multidimensional function space to identify low-dimensional manifold corresponding to the required Pareto front. In this work, we introduce the multi-objective Bayesian optimization (MOBO) workflow for the ferroelectric/antiferroelectric performance optimization for memory and energy storage applications based on the numerical solution of the Ginzburg–Landau equation with electrochemical or semiconducting boundary conditions. MOBO is a low computational cost optimization tool for expensive multi-objective functions, where we update posterior surrogate Gaussian process models from prior evaluations and then select future evaluations from maximizing an acquisition function. Using the parameters for a prototype bulk antiferroelectric (PbZrO 3 ), we first develop a physics-driven decision tree of target functions from the loop structures. We further develop a physics-driven MOBO architecture to explore multidimensional parameter space and build Pareto-frontiers by maximizing two target functions jointly—energy storage and loss. This approach allows for rapid initial materials and device parameter selection for a given application and can be further expanded toward the active experiment setting. The associated notebooks provide both the tutorial on MOBO and allow us to reproduce the reported analyses and apply them to other systems (https://github.com/arpanbiswas52/MOBO_AFI_Supplements).

36 MATERIALS SCIENCE↗

IceCube Search for Neutrinos Coincident with Compact Binary Mergers from LIGO-Virgo’s First Gravitational-wave Transient Catalog

Using the IceCube Neutrino Observatory, we search for high-energy neutrino emission coincident with compact binary mergers observed by the LIGO and Virgo gravitational-wave (GW) detectors during their first and second observing runs. In this paper, we present results from two searches targeting emission coincident with the sky localization of each GW event within a 1000 s time window centered around the reported merger time. One search uses a model-independent unbinned maximum-likelihood analysis, which uses neutrino data from IceCube to search for pointlike neutrino sources consistent with the sky localization of GW events. The other uses the Low-Latency Algorithm for Multi-messenger Astrophysics, which incorporates astrophysical priors through a Bayesian framework and includes LIGO-Virgo detector characteristics to determine the association between the GW source and the neutrinos. No significant neutrino coincidence is seen by either search during the first two observing runs of the LIGO-Virgo detectors. We set upper limits on the time-integrated neutrino emission within the 1000 s window for each of the 11 GW events. These limits range from 0.02 to 0.7 GeV cm -2 . We also set limits on the total isotropic equivalent energy, E iso , emitted in high-energy neutrinos by each GW event. These limits range from 1.7 × 10 51 to 1.8 × 10 55 erg. We conclude with an outlook for LIGO-Virgo observing run O3, during which both analyses are running in real time.

79 ASTRONOMY AND ASTROPHYSICS↗

Writing the Programs of Programmable Catalysis

It has long been known that non-steady state and periodic catalytic reactor operation in terms of temperature, pressure, and composition can lead to higher overall productivity and/or product selectivity than the best steady operation. Recently, the emergence of catalysts whose intrinsic properties can be made to oscillate with time, introduces advanced forcing capabilities that can be “programmed” into the catalysts to broaden the scope and applicability of periodic operation to surface chemistry. In this work, an algorithmic approach is implemented to significantly accelerate the discovery and optimization of periodic steady states of catalytic reactors. Decomposition of complex dynamics into fundamental mechanistic fast–slow steps is seen to improve conceptual understanding of the relationship between binding energy oscillation protocols and overall catalytic rates. Finding structured forcing protocols, optimally tailored to the multiple time scales of a given individual mechanism, requires an efficient search of high-dimensional parameter spaces. Here, this is enabled here through active learning (Bayesian optimization, enhanced by our proposed Bayesian continuation). Implementation of these methods is shown to accelerate the evaluation of catalyst programs by up to several orders of magnitude. Faster screening of programmable catalysts to discover periodic steady states enables the optimization of catalytic operating protocols and thus opens the possibility for catalyst engineering based on optimal forcing programs to control rate and product selectivity, even for complex multistep catalytic mechanisms.

catalysis↗

Autoclass: An automatic classification system

The task of inferring a set of classes and class descriptions most likely to explain a given data set can be placed on a firm theoretical foundation using Bayesian statistics. Within this framework, and using various mathematical and algorithmic approximations, the AutoClass System searches for the most probable classifications, automatically choosing the number of classes and complexity of class descriptions. A simpler version of AutoClass has been applied to many large real data sets, has discovered new independently-verified phenomena, and has been released as a robust software package. Recent extensions allow attributes to be selectively correlated within particular classes, and allow classes to inherit, or share, model parameters through a class hierarchy. The mathematical foundations of AutoClass are summarized.

Stutz, John↗

Bayesian classification theory

The task of inferring a set of classes and class descriptions most likely to explain a given data set can be placed on a firm theoretical foundation using Bayesian statistics. Within this framework and using various mathematical and algorithmic approximations, the AutoClass system searches for the most probable classifications, automatically choosing the number of classes and complexity of class descriptions. A simpler version of AutoClass has been applied to many large real data sets, has discovered new independently-verified phenomena, and has been released as a robust software package. Recent extensions allow attributes to be selectively correlated within particular classes, and allow classes to inherit or share model parameters though a class hierarchy. We summarize the mathematical foundations of AutoClass.

Hanson, Robin↗

Algorithms in Diffraction Profile Analysis

This chapter introduces several approaches to crystallographic structure refinement from diffraction profile data including the Rietveld method, global optimization methods, and Bayesian modeling. First, the Rietveld method and related nonlinear least squares approaches to analyzing diffraction profiles are briefly discussed. We then review the most common algorithms within global optimization as alternative methods of structure solution: grid search, simulated annealing, and genetic algorithms. As the Rietveld method is the standard tool for analyzing diffraction profile data, we catalogue its challenges and limitations. A Bayesian approach to diffraction profile analysis is presented as an alternative, along with several sampling algorithms including Gibbs sampling, variants of Metropolis sampling, Hamiltonian Monte Carlo, and approximate Bayesian computing. These sampling algorithms are applied to the fitting of a neutron diffraction profile from a National Institute of Standards and Technology silicon standard reference material, and their results are compared.

Singh, Susheela↗

A Multi-Objective Bayesian Optimized Human Assessed Multi-Target Generated Spectral Recommender System for Rapid Pareto Discoveries of Material Properties

Optimization for different tasks like material characterization, synthesis, and functional properties for desired applications over multi-dimensional control parameter and function spaces need a rapid strategic search through active learning. However, in all cases prior to optimization, the target material properties are assumed known and fixed, which mostly deviates from real-world scenarios in material synthesis. This can be critical for running expensive experiments on new materials, when the experimental results are fuzzy for any scientific outcomes due to improper target setting, ultimately wasting time and cost. The failure rate and cost are even higher over exploring on multi-target space, where we want to learn the pareto among multiple properties, to jointly optimize during material synthesis for desired applications. To address the challenge, here we introduce the human-operator attempt flexibility in the active learning based automated experiment framework, with generating multiple human assessed targets through a voting-based recommender system during real-time microscope measurements over the large material image space, sequentially learn/update multiple desired targets through a weighting system, and adaptively search in multiple material properties functional space for non-dominated pareto discoveries to maximize the custom structural similarity based acquisition function. We term this a multi-objective Bayesian optimized human assessed multi-target generated spectral recommender systems (MOBO-HAM-SRS). The approach has been demonstrated to peizoresponse force spectroscopy of a ferroelectric thin film, exploring with different kernels and acquisition functions. This work shows an advancement towards human-AI collaborated automated experiments, steering optimization trajectories through human overpowering AI at the early stage when uncertainty is high and AI overpowering human at the later stage with rapid exploration towards optimal goal, following human-assessed multiple targets properties.

Biswas, Arpan↗

Automated and highly parallelized Bayesian optimization scheme for direct drive fusion experiments on OMEGA

Finding the optimal implosion design on existing experimental facilities for inertial confinement fusion requires an exhaustive search of the vast design parameter space. This is infeasible both with experiments and with simulations. Consequently, a large fraction of the experimentally realizable design space remains unexplored, and new design schemes are challenging to optimize in a reasonable time frame. On the OMEGA laser facility, predictive machine learning models have been developed to accurately forecast the result of an experiment using only inexpensive simulations and the large dataset of prior experimental data. However, the full design space remains vast enough to be unassailable with simple optimization techniques. Here we develop an automated and optimally parallel Bayesian optimization algorithm that can entirely optimize the target and pulse shape of a direct-drive ICF implosion under a given design paradigm. We use this algorithm to find a markedly improved design for the performance implosions on OMEGA that is predicted to hydroequivalently scale to ignition at 2.15 MJ.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimizing training trajectories in variational autoencoders via latent Bayesian optimization approach *

Unsupervised and semi-supervised ML methods such as variational autoencoders (VAE) have become widely adopted across multiple areas of physics, chemistry, and materials sciences due to their capability in disentangling representations and ability to find latent manifolds for classification and/or regression of complex experimental data. Like other ML problems, VAEs require hyperparameter tuning, e.g. balancing the Kullback–Leibler and reconstruction terms. However, the training process and resulting manifold topology and connectivity depend not only on hyperparameters, but also their evolution during training. Because of the inefficiency of exhaustive search in a high-dimensional hyperparameter space for the expensive-to-train models, here we have explored a latent Bayesian optimization (zBO) approach for the hyperparameter trajectory optimization for the unsupervised and semi-supervised ML and demonstrated for joint-VAE with rotational invariances. We have demonstrated an application of this method for finding joint discrete and continuous rotationally invariant representations for modified national institute of standards and technology database (MNIST) and experimental data of a plasmonic nanoparticles material system. The performance of the proposed approach has been discussed extensively, where it allows for any high dimensional hyperparameter trajectory optimization of other ML models.

42 ENGINEERING↗

New results from the CUORE experiment

We report that the Cryogenic Underground Observatory for Rare Events (CUORE) is the first bolometric experiment searching for neutrino-less double-beta (0vββ) decay that has been able to reach the one-ton scale. The detector, located at the Laboratori Nazionali del Gran Sasso in Italy, consists of an array of 988 TeO 2 crystals arranged in a compact cylindrical structure of 19 towers. Following the completion of the detector construction in August 2016, CUORE began its first physics data run in 2017 at a base temperature of about 10 mK. Following multiple optimization campaigns in 2018, CUORE is currently in stable operating mode. In 2019, CUORE released its second result of the search for 0vββ corresponding to a TeO 2 exposure of 372.5 kg∙yr and a median exclusion sensitivity to a 130 Te 0vββ decay half-life of 1.7 ∙ 10 25 yr. We find no evidence for 0vββ decay and set a 90% C.I. Bayesian lower limit of 3.2 ∙ 10 25 yr on the 130 Te 0vββ decay half-life. We present the current status of CUORE’s search for 0vββ. We give an update of the CUORE background model and the measurement of the 130 Te two neutrino double-beta (2vββ) decay half-life. Eventually, we show the preliminary results on half-life limits from the analysis of 130 Te 0vββ and 2vββ decay to the first 0 + excited state of 130 Xe.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Discovering Planetary Nebula Geometries: Explorations with a Hierarchy of Models

Astronomical objects known as planetary nebulae (PNe) consist of a shell of gas expelled by an aging medium-sized star as it makes its transition from a red giant to a white dwarf. In many cases this gas shell can be approximately described as a prolate ellipsoid. Knowledge of the physics of ionization processes in this gaseous shell enables us to construct a model in three dimensions (3D) called the Ionization-Bounded Prolate Ellipsoidal Shell model (IBPES model). Using this model we can generate synthetic nebular images, which can be used in conjunction with Hubble Space Telescope (HST) images of actual PNe to perform Bayesian model estimation. Since the IBPES model is characterized by thirteen parameters, model estimation requires the search of a 13-dimensional parameter space. The 'curse of dimensionality,' compounded by a computationally intense forward problem, makes forward searches extremely time-consuming and frequently causes them to become trapped in local solutions. We find that both the speed and of the search can be improved by judiciously reducing the dimensionality of the search space. Our basic approach employs a hierarchy of models of increasing complexity that converges to the IBPES model. Earlier studies establish that a hierarchical sequence converges more quickly, and to a better solution, than a search relying only on the most complex model. Here we report results for a hierarchy of five models. The first three models treat the nebula as a 2D image, while the last two models explore its characteristics as a 3D object and enable us to characterize the physics of the nebula. This five-model hierarchy is applied to HST images of ellipsoidal PNe to estimate their geometric properties and gas density profiles.

Huyser, Karen A.↗

Computational Inference of Vibratory System with Incomplete Modal Information Using Parallel, Interactive and Adaptive Markov Chains

Inverse analysis of vibratory system is an important subject in fault identification, model updating, and robust design and control. It is challenging subject because 1) the problem is oftentimes underdetermined while the measurements are limited and/or incomplete; 2) many combinations of parameters may yield results that are similar with respect to actual response measurements; and 3) uncertainties inevitably exist. The aim of this research is to leverage upon computational intelligence through statistical inference to facilitate an enhanced, probabilistic framework using incomplete modal response measurement. This new framework is built upon efficient inverse identification through optimization, whereas Bayesian inference is employed to account for the effect of uncertainties. To overcome the computational cost barrier, we adopt Markov chain Monte Carlo (MCMC) to characterize the target function/distribution. Instead of using single Markov chain in conventional Bayesian approach, we develop a new sampling theory with multiple parallel, interactive and adaptive Markov chains and incorporate it into Bayesian inference. This can harness the collective power of these Markov chains to realize the concurrent search of multiple local optima. The number of required Markov chains and their respective initial model parameters are automatically determined via Monte Carlo simulation-based sample pre-screening followed by K-means clustering analysis. These enhancements can effectively address the aforementioned challenges in finite element inverse analysis. The validity of this framework is systematically demonstrated through case studies.

K Zhou↗

Stopping criteria for ending autonomous, single detector radiological source searches

While the localization of radiological sources has traditionally been handled with statistical algorithms, such a task can be augmented with advanced machine learning methodologies. The combination of deep and reinforcement learning has provided learning-based navigation to autonomous, single-detector, mobile systems. However, these approaches lacked the capacity to terminate a surveying/search task without outside influence of an operator or perfect knowledge of source location (defeating the purpose of such a system). Two stopping criteria are investigated in this work for a machine learning navigated system: one based upon Bayesian and maximum likelihood estimation (MLE) strategies commonly used in source localization, and a second providing the navigational machine learning network with a “stop search” action. A convolutional neural network was trained via reinforcement learning in a 10 m × 10 m simulated environment to navigate a randomly placed detector-agent to a randomly placed source of varied strength (stopping with perfect knowledge during training). The network agent could move in one of four directions (up, down, left, right) after taking a 1 s count measurement at the current location. During testing, the stopping criteria for this navigational algorithm was based upon a Bayesian likelihood estimation technique of source presence, updating this likelihood after each step, and terminating once the confidence of the source being in a single location exceeded 0.9. A second network was trained and tested with similar architecture as the previous but which contained a fifth action: for self-stopping. The accuracy and speed of localization with set detector and source initializations were compared over 50 trials of MLE-Bayesian approach and 1000 trials of the CNN with self-stopping. The statistical stopping condition yielded a median localization error of ~1.41 m and median localization speed of 12 steps. The machine learning stopping condition yielded a median localization error of 0 m and median localization speed of 17 steps. This work demonstrated two stopping criteria available to a machine learning guided, source localization system.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗