Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian network”

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 739 records · Page 41

Two Jupiter-mass Planets Discovered by the KMTNet Survey in 2017

We report two microlensing events, KMT-2017-BLG-1038 and KMT-2017-BLG-1146, that are caused by planetary systems. These events were discovered by Korea Microlensing Telescope Network survey observations from the 2017 bulge season. The discovered systems consist of a planet and host star with mass ratios of 5.3{sub −0.4}{sup +0.2}×10{sup −3} and 2.0{sub −0.1}{sup +0.6}×10{sup −3}, respectively. Based on a Bayesian analysis assuming a Galactic model without stellar remnant hosts, we find that the planet KMT-2017-BLG-1038Lb is a super-Jupiter-mass planet (M{sub p} =2.04{sub −1.15}{sup +2.02} M{sub J}) orbiting a mid-M dwarf host (M{sub h}=0.37{sub −0.20}{sup +0.36} M{sub ⊙}) that is located at 6.01{sub −1.72}{sup +1.27} kpc toward the Galactic bulge. The other planet, KMT-2017-BLG-1146Lb, is a sub-Jupiter-mass planet (M{sub p}=0.71{sub −0.42}{sup +0.80} M{sub J}) orbiting a mid-M dwarf host (M{sub h}=0.33{sub −0.20}{sup +0.36} M{sub ⊙}) at a distance of 6.50{sub −2.00}{sup +1.38} kpc toward the Galactic bulge. Both are potentially gaseous planets that are beyond their hosts’ snow lines. These typical microlensing planets will be routinely discovered by second-generation microlensing surveys, rapidly increasing the number of detections.

79 ASTRONOMY AND ASTROPHYSICS↗

Generating a 4D Global CH(4) Product by Assimilating TROPOMI column CH(4) in NASA’s GEOS GCM

Examination of temporal and spatial CH4 variability is crucial for better understanding the human and natural processes driving climate change and ultimately designing mitigation strategies. Here we present an analysis framework that uses NASA’s GEOS General Circulation Model (GCM) to construct a high-resolution, time varying picture of atmospheric CH4 consistent with measurements from a variety of platforms, both in situ and remotely sensed. The resulting time varying atmospheric CH4 product can (i) support interpretation of high-resolution point source detection approaches, (ii) provide reanalysis fields for CH4 and other greenhouse gases, and (iii) supply boundary conditions for regional models. Our approach starts with a set of CH4 emissions from various inventories that have been adjusted to match the global annual growth rate over recent decades. These emissions are transported by the GEOS GCM, which in turn is constrained by meteorology from NASA’s Modern-Era Retrospective analysis for Research and Applications, Version 2 (MERRA-2) product. The simulated atmospheric field is compared with CH4 measurements, such as those from the TROPOspheric Monitoring Instrument (TROPOMI), and adjustments calculated following a Bayesian protocol. The accuracy of the resultant optimal atmospheric CH4 field can be demonstrated by its improved agreement (compared to a direct simulation of the CH4 inventories) with a host of independent CH4 measurements, such as those from the Total Carbon Column Observation Network (TCCON) and in situ observations from surface and airborne platforms.

Nikolay V. Balashov↗

An Ensemble Approach for Forecasting Net Interchange Schedule

The net interchange schedule (NIS) is the sum of the transactions (MW) between an ISO/RTO and its neighbors. Effective forecasting of the submitted NIS can improve grid operation efficiency. This paper applies a Bayesian model averaging (BMA) technique to forecast submitted NIS. As an ensemble approach, the BMA method aggregates different forecasting models in order to improve forecasting accuracy and consistency. In this study, the BMA method is compared to two alternative approaches: a stepwise regression method and an artificial neural network (ANN) trained for NIS forecasting. In our comparative analysis, we use field measurement data from the Pennsylvania, New Jersey, and Maryland (PJM) Regional Transmission Organization (RTO) to train and test each method. Our preliminary results indicate that ensemble-based methods can provide more accurate and consistent NIS forecasts in comparison to non-ensemble alternate methods.

Vlachopoulou, Maria↗

Training Spiking Neural Networks with Synaptic Plasticity under Integer Representation

Neuromorphic computing is emerging as a promising Beyond Moore computing paradigm that employs event-triggered computation and non-von Neumann hardware. Spike Timing Dependent Plasticity (STDP) is a well-known bio-inspired learning rule that relies on activities of locally connected neurons to adjust the weights of their respective synapses. In this work, we analyze a basic STDP rule and its sensitivity on the different hyperparameters for training spiking neural networks (SNNs) with supervision, customized for a neuromorphic hardware implementation with integer weights. We compare the classification performance on four UCI datasets (iris, wine, breast cancer and digits) that depict varying levels of complexity. We perform a search for optimal set of hyperparameters using both grid search and Bayesian optimization. Through the use of Bayesian optimization, we show the general trends in hyperparameter sensitivity in SNN classification problem. With the best sets of hyperparameters, we achieve accuracies comparable to some of the best performing SNNs on these four datasets. With a highly optimized supervised STDP rule we show that these accuracies can be achieved with just 20 epochs of training.

Kulkarni, Shruti↗

A computer program for estimation from incomplete multinomial data

Coding is given for maximum likelihood and Bayesian estimation of the vector p of multinomial cell probabilities from incomplete data. Also included is coding to calculate and approximate elements of the posterior mean and covariance matrices. The program is written in FORTRAN 4 language for the Control Data CYBER 170 series digital computer system with network operating system (NOS) 1.1. The program requires approximately 44000 octal locations of core storage. A typical case requires from 72 seconds to 92 seconds on CYBER 175 depending on the value of the prior parameter.

Credeur, K. R.↗

Techno-economic implications and cost of forecasting errors in solar PV power production using optimized deep learning models

Accurate solar Photovoltaic (PV) power forecasting is important for enhancing both the performance and economic feasibility of PV systems. This study evaluates several deep learning models, including Dense Neural Networks (DNN), Long Short-Term Memory (LSTM), Convolutional Neural Networks (CNN), and a hybrid LSTMCNN model, for predicting PV power production one day in advance. Prior to optimization, the models exhibited relatively high errors, with the best model (DNN) achieving a Root Mean Square Error (RMSE) of 31.13 kW and a coefficient of determination (R 2 ) of 62.15 %. After employing Bayesian optimization, the LSTM-CNN model demonstrated the best performance, with the RMSE reduced to 9.79 kW and R 2 improved to 97.62 %, showcasing significant enhancement in predictive accuracy. Here, the economic evaluation considered three cases: rewards for underestimation (0.08 USD/kWh), no rewards, and penalties for both over-and underestimation (120 % of the utility tariff). In the rewards scenario, the LSTM-CNN model reduced the Levelized Cost of Electricity (LCOE) by 4 %, while in the penalty scenario, a backup diesel generator would have increased the LCOE by 49 %. Additionally, the LSTM-CNN model minimized financial losses, achieving the lowest penalties and maximizing net cash flow compared to other models, demonstrating its overall technical and economic superiority.

Deep learning↗

Coexistent quantum channel characterization using quantum process tomography with spectrally resolved detection

The coexistence of classical and quantum signals over the same optical fiber is critical for quantum networks operating within the existing communications infrastructure. Here, we characterize the quantum channel that results from distributing approximate single-photon polarization-encoded qubits simultaneously with classical light of varying intensities through a 25 km fiber-optic channel. We use spectrally resolved quantum process tomography with a newly developed Bayesian reconstruction method to estimate the quantum channel from experimental data, both with and without classical noise. Furthermore, we show that the coexistent fiber-based quantum channel has high process fidelity with an ideal depolarizing channel if the noise is dominated by Raman scattering. These results aid future development of quantum repeater designs and quantum error-correcting codes which benefit from realistic channel error models.

Chapman, Joseph↗

Implementation of Dynamic Extensible Adaptive Locally Exchangeable Measures (IDEALEM) v 0.1

Handling large streaming data is essential for various applications such as network traffic analysis, social networks, energy cost trends, and environment modeling. However, it is in general intractable to store, compute, search, and retrieve large streaming data. This software addresses a fundamental issue, which is to reduce the size of large streaming data and still obtain accurate statistical analysis. As an example, when a high-speed network such as 100 Gbps network is monitored, the collected measurement data rapidly grows so that polynomial time algorithms (e.g., Gaussian processes) become intractable. One possible solution to reduce the storage of vast amounts of measured data is to store a random sample, such as one out of 1000 network packets. However, such static sampling methods (linear sampling) have drawbacks: (1) it is not scalable for high-rate streaming data, and (2) there is no guarantee of reflecting the underlying distribution. In this software, we implemented a dynamic sampling algorithm, based on the recent technology from the relational dynamic bayesian online locally exchangeable measures, that reduces the storage of data records in a large scale, and still provides accurate analysis of large streaming data. The software can be used for both online and offline data records.

Sim, Alex↗

Bayesian sequential optimal experimental design for nonlinear models using policy gradient reinforcement learning

We present a mathematical framework and computational methods for optimally designing a finite sequence of experiments. This sequential optimal experimental design (sOED) problem is formulated as a finite-horizon partially observable Markov decision process (POMDP) under a Bayesian setting and with information-theoretic utilities. The formulation is general and may accommodate continuous random variables, non-Gaussian posteriors, and nonlinear forward models. The sOED design policy incorporates elements of feedback and lookahead simultaneously, and we show it to generalize the commonly-used batch and greedy design strategies. We solve for the sOED policy using the policy gradient (PG) method from reinforcement learning, and provide a derivation for the PG expression in the sOED context. Adopting an actor-critic approach, the policy and value functions are parameterized using deep neural networks and improved via PG estimates produced from simulated episodes of designs and observations. The new PG-sOED algorithm is first validated on a linear-Gaussian benchmark, and then compared against other design baselines on a sensor movement problem for contaminant source inversion in a convection-diffusion field. As a result, we provide explanation for the policy behaviors using knowledge of the underlying physical process.

97 MATHEMATICS AND COMPUTING↗

Evaluating the Potential and Challenges of an Uncertainty Quantification Method for Long Short–Term Memory Models for Soil Moisture Predictions

Recently, recurrent deep networks have shown promise to harness newly available satellite–sensed data for long–term soil moisture projections. However, to be useful in forecasting, deep networks must also provide uncertainty estimates. Here we evaluated Monte Carlo dropout with an input–dependent data noise term (MCD+N), an efficient uncertainty estimation framework originally developed in computer vision, for hydrologic time series predictions. MCD+N simultaneously estimates a heteroscedastic input–dependent data noise term (a trained error model attributable to observational noise) and a network weight uncertainty term (attributable to insufficiently constrained model parameters). Although MCD+N has appealing features, many heuristic approximations were employed during its derivation, and rigorous evaluations and evidence of its asserted capability to detect dissimilarity were lacking. To address this, we provided an in–depth evaluation of the scheme's potential and limitations. We showed that for reproducing soil moisture dynamics recorded by the Soil Moisture Active Passive (SMAP) mission, MCD+N indeed gave a good estimate of predictive error, provided that we tuned a hyperparameter and used a representative training data set. The input–dependent term responded strongly to observational noise, while the model term clearly acted as a detector for physiographic dissimilarity from the training data, behaving as intended. However, when the training and test data were characteristically different, the input–dependent term could be misled, undermining its reliability. Additionally, due to the data–driven nature of the model, data noise also influences network weight uncertainty, and therefore the two uncertainty terms are correlated. Altogether, this approach has promise, but care is needed to interpret the results.

54 ENVIRONMENTAL SCIENCES↗

Stochastic machine learning via sigma profiles to build a digital chemical space

This work establishes a different paradigm on digital molecular spaces and their efficient navigation by exploiting sigma profiles. To do so, the remarkable capability of Gaussian processes (GPs), a type of stochastic machine learning model, to correlate and predict physicochemical properties from sigma profiles is demonstrated, outperforming state-of-the-art neural networks previously published. The amount of chemical information encoded in sigma profiles eases the learning burden of machine learning models, permitting the training of GPs on small datasets which, due to their negligible computational cost and ease of implementation, are ideal models to be combined with optimization tools such as gradient search or Bayesian optimization (BO). Gradient search is used to efficiently navigate the sigma profile digital space, quickly converging to local extrema of target physicochemical properties. While this requires the availability of pretrained GP models on existing datasets, such limitations are eliminated with the implementation of BO, which can find global extrema with a limited number of iterations. A remarkable example of this is that of BO toward boiling temperature optimization. Holding no knowledge of chemistry except for the sigma profile and boiling temperature of carbon monoxide (the worst possible initial guess), BO finds the global maximum of the available boiling temperature dataset (over 1,000 molecules encompassing more than 40 families of organic and inorganic compounds) in just 15 iterations (i.e., 15 property measurements), cementing sigma profiles as a powerful digital chemical space for molecular optimization and discovery, particularly when little to no experimental data is initially available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Continuous Time Group Discovery in Dynamic Graphs

With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.

97 MATHEMATICS AND COMPUTING↗

Prediction of non-intuitive metabolic targets with bayesian metabolic control analysis to improve 3-hydroxypropionic acid production in Aspergillus niger

Development of efficient bioconversion processes is limited by the ability to predictably improve metabolic flux. Here we deployed Bayesian Metabolic Control Analysis as a platform to integrate multi-omics data with metabolic modeling and evaluated its ability to predict genetic interventions that improve metabolic flux. Global Metabolomics and proteomics data was collected from 17 Aspergillus niger strains engineered to produce the platform biochemical 3-hydroxypropionic acid from which seven actional genetic interventions were predicted from significant flux control coefficients. Of the suggested genetic interventions, two were present within the intuitively designed strains used for training (malonic semialdehyde dehydrogenase and pyruvate carboxylase) while five predicted targets were present within non-intuitive areas of the metabolic network including 5-formyltetrahydrofolate deformylase and four mitochondrial enzymes, alcohol dehydrogenase, succinyl-CoA ligase, aspartate aminotransferase, and malate dehydrogenase. Six of the targets were validated in the highest performing 3-HP strain used for multi-omics data generation which contained a prior disruption of the highest scoring target malonic semialdehyde dehydrogenase. Predicted directional perturbation of five of the six tested targets significantly improved titer and rate of 3-HP production and two significantly improved yield. The greatest improvements were observed following disruption of the non-intuitive target succinyl-CoA ligase which increased titer by 39% and yield by 29% (to 20.4 g/L 3-HP and 0.31 g 3-HP/g glucose) over the strains used for training. This study demonstrates the utility of Bayesian Metabolic Control Analysis and highlights the ability to predict meaningful genetic targets in unexpected areas of metabolism to improve engineered strains for bioconversion.

3-hydroxypropionic acid↗

Transfer learning driven design optimization for inertial confinement fusion

Transfer learning is a promising approach to create predictive models that incorporate simulation and experimental data into a common framework. In this technique, a neural network is first trained on a large database of simulations and then partially retrained on sparse sets of experimental data to adjust predictions to be more consistent with reality. Previously, this technique has been used to create predictive models of Omega [Humbird et al., IEEE Trans. Plasma Sci. 48, 61–70 (2019)] and NIF [Humbird et al., Phys. Plasmas 28, 042709 (2021); Kustowski et al., Mach. Learn. 3, 015035 (2022)] inertial confinement fusion (ICF) experiments that are more accurate than simulations alone. Here, in this work, we conduct a transfer learning driven hypothetical ICF campaign in which the goal is to maximize experimental neutron yield via Bayesian optimization. The transfer learning model achieves yields within 5% of the maximum achievable yield in a modest-sized design space in fewer than 20 experiments. Furthermore, we demonstrate that this method is more efficient at optimizing designs than traditional model calibration techniques commonly employed in ICF design. Such an approach to ICF design could enable robust optimization of experimental performance under uncertainty.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

Faint-Source-Star Planetary Microlensing: The Discovery of the Cold Gas-Giant Planet OGLE-2014-BLG-0676Lb

We report the discovery of a planet OGLE-2014-BLG-0676Lb via gravitational microlensing. Observations for the lensing event were made by the following groups: Microlensing Observations in Astrophysics; Optical Gravitational Lensing Experiment; Wise Observatory; RoboNETLas Cumbres Observatory Global Telescope; Microlensing Network for the Detection of Small Terrestrial Exoplanets; and -FUN. All analyses of the light-curve data favoura lens system comprising a planetary mass orbiting a host star. The most-favoured binary lens model has a mass ratio between the two lens masses of (4.78 +/- 0.13) 10(exp -3). Subject to some important assumptions, a Bayesian probability density analysis suggests the lens system comprises a 3.09(+1.02/-1.12) MJ planet orbiting a 0.62(+0.20/-0.22) solar mass host star at a deprojected orbital separation of 4.40(+2.16/-1.46) au. The distance to the lens system is 2.22(+0.96/-0.83) kpc. Planet OGLE-2014-BLG-0676Lb provides additional data to the growing number of cool planets discover redusing gravitational microlensing against which planetary formation theories may be tested. Most of the light in the baseline of this event is expected to come from the lens and thus high-resolution imaging observations could confirm our planetary model interpretation.

OGLE-2014-BLG-0676Lb↗

A Hybrid Gradient Method to Designing Bayesian Experiments for Implicit Models

Bayesian experimental design (BED) aims at designing an experiment to maximize the information gathering from the collected data. The optimal design is usually achieved by maximizing the mutual information (MI) between the data and the model parameters. When the analytical expression of the MI is unavailable, e.g.,having implicit models with intractable data distributions, a neural network-based lower bound of the MI was recently proposed and a gradient ascent method was used to maximize the lower bound [1]. However, the approach in [1] requires a pathwise sampling path to compute the gradient of the MI lower bound with respect to the design variables, and such a pathwise sampling path is usually inaccessible for implicit models. In this work, we propose a hybrid gradient approach that leverages recent advances in variational MI estimator and evolution strategies (ES)combined with black-box stochastic gradient ascent (SGA) to maximize the MI lower bound. This allows the design process to be achieved through a unified scalable procedure for implicit models without sampling path gradients. Several experiments demonstrate that our approach significantly improves the scalability of BED for implicit models in high-dimensional design space.

Zhang, Jiaxin↗