Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian sampling”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Quantum-Inspired Bayesian Sampling for Uncertainty Quantification and Machine Learning (Final Technical Report)

With increasing simulation and measurement data, machine learning and artificial intelligence have been widely used in computational decision-making of complex engineering systems. The resulting tools, such as uncertainty quantification solvers, reinforcement learning, and physics-informed machine learning, have achieved great success in critical DOE tasks such as material discovery and design, energy system modeling and control, and numerical weather and climate prediction. A core topic in scientific machine learning and artificial intelligence is Bayesian inference: given an observed data set, people want to estimate the posterior distribution of a (possibly large) number of hidden parameters. Due to the flexibility and weak assumptions, Bayesian sampling has been the mainstream Bayesian inference solvers despite the rapid progress of approximate Bayesian inference. Classical Bayesian sampling methods such as Markov-chain Monte Carlo suffer from a low-acceptance rate due to the random walk nature, therefore state-of-the-art techniques use Hamiltonian Monte Carlo and its variants to efficiently draw posterior samples in a high dimension. The key idea of Hamiltonian Monte Carlo and its variants is to simulate the Hamiltonian dynamics of a classical particle with a fixed mass, and their performance significantly degrades when the posterior distribution is highly spiky or has multiple modes. Leveraging the idea of quantum physics, this project has investigated new theory, algorithms and applications of Bayesian inference (especially Bayesian sampling). The main results include: (1) novel quantum-inspired Bayesian sampling methods that can lead to better accuracy for challenging multi-modal or spiky distributions, (2) more scalable machine learning framework leveraging tensor-compressed Bayesian inference, and (3) Bayesian and sampling approaches for verifying the robustness of continuous and binary neural networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimizing Neutrino Flavor Conversion Measurements through Machine Learning

The phenomenon of neutrino flavor conversion whereby the flavor of a neutrino particle can change between its time of production and later detection was the first definitive evidence of physics beyond the Standard Model. Some of the oscillation parameters used to describe this conversion are not yet well measured, leaving important questions still open regarding flavor conversion both in vacuum and as neutrinos travel through matter. NOvA is a long-baseline neutrino oscillation experiment that uses Fermilab's predominantly $\nu_\mu$ NuMI beam. A 14 kton oil-based liquid scintillator far detector 810 km away is used to measure neutrino oscillation through the $\nu_\mu$ disappearance and $\nu_e$ appearance channels. Super-K is a 50 kton water Cherenkov detector, which measures the disappearance of $\nu_e$ produced during solar fusion. The high density environment of the sun decreases the $\nu_e$ survival probability at higher energies observable in Super-K compared to the vacuum-dominated oscillations at lower energies. However, the transition region is overshadowed by radioactive background in the detector. In both of these experiments, the separation of neutrino detection events from background and classification of neutrino flavor are crucial tasks that benefit from the introduction of machine learning. Chapter 1 gives an overview of neutrinos and the context under which flavor conversion is measured in this dissertation. Chapters 2-7 present the results of a Bayesian sampling approach for the latest NOvA 3-flavor oscillation analysis with $26.6 \times 10^{20}$ protons on target in neutrino mode and $12.5 \times 10^{20}$ in antineutrino mode collected over 10 years. Chapters 8-13 present the results of extending the Super-K solar analysis to lower energies during its fourth phase with 2970 days of livetime.

Yankelevich, Alejandro Jaime [UC, Irvine]↗
DOE OSTI2026

Optimizing Neutrino Flavor Conversion Measurements through Machine Learning

The phenomenon of neutrino flavor conversion whereby the flavor of a neutrino particle can change between its time of production and later detection was the first definitive evidence of physics beyond the Standard Model. Some of the oscillation parameters used to describe this conversion are not yet well measured, leaving important questions still open regarding flavor conversion both in vacuum and as neutrinos travel through matter. NOvA is a long-baseline neutrino oscillation experiment that uses Fermilab's predominantly $\nu_\mu$ NuMI beam. A 14 kton oil-based liquid scintillator far detector 810 km away is used to measure neutrino oscillation through the $\nu_\mu$ disappearance and $\nu_e$ appearance channels. Super-K is a 50 kton water Cherenkov detector, which measures the disappearance of $\nu_e$ produced during solar fusion. The high density environment of the sun decreases the $\nu_e$ survival probability at higher energies observable in Super-K compared to the vacuum-dominated oscillations at lower energies. However, the transition region is overshadowed by radioactive background in the detector. In both of these experiments, the separation of neutrino detection events from background and classification of neutrino flavor are crucial tasks that benefit from the introduction of machine learning. Chapter 1 gives an overview of neutrinos and the context under which flavor conversion is measured in this dissertation. Chapters 2-7 present the results of a Bayesian sampling approach for the latest NOvA 3-flavor oscillation analysis with $26.6 \times 10^{20}$ protons on target in neutrino mode and $12.5 \times 10^{20}$ in antineutrino mode collected over 10 years. Chapters 8-13 present the results of extending the Super-K solar analysis to lower energies during its fourth phase with 2970 days of livetime.

Yankelevich, Alejandro Jaime [UC, Irvine]↗
DOE OSTI2026

Optimizing Neutrino Flavor Conversion Measurements through Machine Learning

The phenomenon of neutrino flavor conversion whereby the flavor of a neutrino particle can change between its time of production and later detection was the first definitive evidence of physics beyond the Standard Model. Some of the oscillation parameters used to describe this conversion are not yet well measured, leaving important questions still open regarding flavor conversion both in vacuum and as neutrinos travel through matter. NOvA is a long-baseline neutrino oscillation experiment that uses Fermilab's predominantly $\nu_\mu$ NuMI beam. A 14 kton oil-based liquid scintillator far detector 810 km away is used to measure neutrino oscillation through the $\nu_\mu$ disappearance and $\nu_e$ appearance channels. Super-K is a 50 kton water Cherenkov detector, which measures the disappearance of $\nu_e$ produced during solar fusion. The high density environment of the sun decreases the $\nu_e$ survival probability at higher energies observable in Super-K compared to the vacuum-dominated oscillations at lower energies. However, the transition region is overshadowed by radioactive background in the detector. In both of these experiments, the separation of neutrino detection events from background and classification of neutrino flavor are crucial tasks that benefit from the introduction of machine learning. Chapter 1 gives an overview of neutrinos and the context under which flavor conversion is measured in this dissertation. Chapters 2-7 present the results of a Bayesian sampling approach for the latest NOvA 3-flavor oscillation analysis with $26.6 \times 10^{20}$ protons on target in neutrino mode and $12.5 \times 10^{20}$ in antineutrino mode collected over 10 years. Chapters 8-13 present the results of extending the Super-K solar analysis to lower energies during its fourth phase with 2970 days of livetime.

Yankelevich, Alejandro Jaime [UC, Irvine] (ORCID:0↗
DOE OSTI2025

Improving the Parameterization of Cloud and Rain Microphysics in E3SM using Novel Observationally-Constrained Bayesian Approach (Final Technical Report)

In this project, we sought to develop new cloud and rain microphysics frameworks within the Energy Exascale Earth System Model (E3SM). This work encompassed two primary avenues of research: 1) Further development of a Bayesian-based scheme called BOSS (Bayesian Observationally-constrained Statistical-physical Scheme) to represent cloud and rain microphysics, testing it in realistic high-resolution cloud models, and implementing it in E3SM; 2) Development of a methodology utilizing machine learning to enable computationally tractable use of tractable use of Markov chain Monte Carlo sampling for Bayesian parameter estimation in Earth system and cloud models. In this project, we adapted the BOSS microphysics scheme, originally formulated for rain-only, to include all liquid-phase microphysical processes for cloud and rain, in particular the processes that mediate between these two categories, for example the conversion from cloud to rain through collision and coalescence of drops. We constrained the scheme via comparison and testing against a detailed model that explicitly represents the evolution of cloud and rain particles, called a bin microphysics scheme.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

The 2025 Evaluation of Experimental Thermonuclear Reaction Rates (ETR25)

This work describes the formalism for estimating thermonuclear reaction rates for astrophysical applications, emphasizing modern statistical approaches such as Monte Carlo sampling and Bayesian models. We discuss related topics including the calculation of resonance energies from nuclear Q values, indirect estimates of particle partial widths, and matching of reaction rates at elevated temperatures to statistical model results. We have evaluated available experimental data on cross sections, resonance energies and strengths, partial widths, lifetimes, spin-parities, and spectroscopic factors. Based on these results, we have estimated numerical values of 78 experimental charged-particle thermonuclear reaction rates for target nuclei in the A = 2–40 mass region, for temperatures ranging from 1 MK to 10 GK. For each reaction, three rate values are provided: low, median, and high, corresponding to the 16th, 50th, and 84th percentiles, respectively, of the cumulative reaction rate probability density distribution. Additionally, we present the factor uncertainty of each rate at each temperature grid point. These results enable users to sample the reaction rate probability density in nucleosynthesis calculations, facilitating uncertainty estimates of nuclidic abundances. The rates presented here refer to their laboratory values. For use in stellar model simulations, these values need to be corrected for the effects of thermal excitations of the interacting nuclei. For each reaction, we include graphs that illustrate the fractional contributions to the overall reaction rate along with the associated uncertainty. These visuals are designed to assist both stellar modelers and nuclear experimentalists by identifying the primary sources of rate uncertain=^texttx);ty at specific stellar temperatures. A graphical comparison with earlier Monte Carlo rates is also provided.

Nuclear astrophysics↗
DOE OSTI2025

A Bayesian approach to time-domain photonic Doppler velocimetry analysis

Photonic Doppler velocimetry (PDV) is an established technique for measuring the velocities of fast-moving surfaces in high-energy-density experiments. In the standard approach to PDV analysis, the short-time Fourier transform (STFT) is used to generate a spectrogram from which the velocity history of the target is inferred. The user chooses the form, duration, and separation of the window function. Here, in this study, we present a Bayesian approach to infer the velocity directly from the PDV oscilloscope trace, without using the spectrogram for analysis. This is clearly a difficult inference problem due to the highly periodic nature of the data, but we find that with carefully chosen prior distributions for the model parameters, we can accurately recover the injected velocity from synthetic data. We validate this method using PDV data collected at the STAR two-stage light gas gun at Sandia National Laboratories, recovering shock-front velocities in quartz that are consistent with those inferred using the STFT-based approach and are interpolated across regions of low signal-to-noise data. Although this method does not rely on the same user choices as the STFT, we caution that it can be prone to misspecification if the chosen model is not sufficient to capture the velocity behavior. Analysis using posterior predictive checks can be used to establish whether a better model is required, although more complex models come with additional computational cost, often taking more than several hours to converge when sampling the Bayesian posterior. We, therefore, recommend it be viewed as a complementary method to that of the STFT-based approach.

Allison, James R. [First Light Fusion Ltd., Yarnto↗
DOE OSTI2026

Chiral interactions and superfluidity in the calcium isotopic chain

We perform ab initio calculations of three-point mass differences in the odd- and even-mass 39−49Ca isotopes to probe nuclear superfluidity via empirical neutron pairing gaps. We also quantify the sensitivity of those gaps to the parameters of the interaction at mean-field level. Recent studies employing accurate chiral nuclear interactions have found these gaps to be too small. We show that experimental values can be reproduced at mean-field level by substantially increasing the attraction of the singlet 𝑆 -wave two-nucleon contact interaction, but doing so induces an unphysical bound state of the dineutron. The sensitivity of these predictions to the full calibration of the nuclear interaction is then studied by performing Bayesian posterior sampling in a delta-full chiral effective field theory at third chiral order. We find that pairing gaps remain largely unaffected, leaving the explanation of nuclear superfluidity as a future task for improved many-body modeling and refined interactions at higher chiral orders.

Hagen, Gaute [ORNL] (ORCID:0000000160191687)↗
DOE OSTI2026

Hybrid-BPR (Bayesian Personalized Ranking with Feature Embeddings and Explicit Negative Sampling) [SWR-26-039]

Hybrid-BPR is a Python library for Bayesian Personalized Ranking (BPR) with two key capabilities that go beyond standard BPR implementations: 1. User and item feature embeddings - incorporate content-based signals (genres, tags, metadata) alongside collaborative filtering. 2. Implicit negative interactions - use observed non-interactions (e.g. viewed-but-not-clicked) as negative training signal instead of random sampling from the full item space. The software is built for recommender systems research with MLflow experiment tracking, parallel hyperparameter sweeps, and standard ranking metrics.

Sandhu, Rimple [National Laboratory of the Rockies↗
DOE OSTI2025

Simulation driven adaptive sampling for neutron-diffraction based strain mapping of additively manufactured parts

Neutron diffraction based strain mapping is a useful technique for measuring residual strains in additively manufactured (AM) metal parts. The measurement is traditionally done by scanning the sample in a point-wise raster pattern to extract the strain at each position. Since the overall scan can span several hours, adaptive sampling approaches using Bayesian optimization based on Gaussian process (BO-GP) regression have been introduced—demonstrating that even with a fraction of the typically made measurements the dominant strain patterns in the sample can be reconstructed. However, the parameters of the BO-GP algorithm have to be carefully chosen for best performance, and the movement time between arbitrary points can offset the time savings from a reduced number of measurement locations. In this paper, we propose algorithms to refine the BO-GP based methods by using simulations of strain patterns in AM parts based on the materials and the process used to print them. We demonstrate that the simulated strain patterns can be used to help choose better parameters for the BO-GP based framework—leading to low reconstruction error for the final strain pattern. Furthermore, we show that the strain mapping experiment can be initialized with a sampling pattern learnt from the simulation data and ordered to reduce movement time, dramatically enabling reduction in the overall time required to run the baseline BO-GP method.

Gaussian process regression↗
DOE OSTI2024

Emulating ab initio computations of infinite nucleonic matter

We construct efficient emulators for the computation of the infinite nuclear matter equation of state. These emulators are based on the subspace-projected coupled-cluster method for which we here develop a new algorithm called small-batch voting to eliminate spurious states that might appear when emulating quantum many-body methods based on a non-Hermitian Hamiltonian. The efficiency and accuracy of these emulators facilitate a rigorous statistical analysis within which we explore nuclear matter predictions for > 10 6 different parametrizations of a chiral interaction model with explicit Δ -isobars at next-to-next-to leading order. Constrained by nucleon-nucleon scattering phase shifts and bound-state observables of light nuclei up to He 4 , we use history matching to identify nonimplausible domains for the low-energy coupling constants of the chiral interaction. Within these domains we perform a Bayesian analysis using sampling and importance resampling with different likelihood calibrations and study correlations between interaction parameters, calibration observables in light nuclei, and nuclear matter saturation properties. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

A novel framework for increasing research transparency: Exploring the connection between diversity and innovation

A split sample/dual method research protocol is demonstrated to increase transparency while reducing the probability of false discovery. We apply the protocol to examine whether diversity in ownership teams increases or decreases the likelihood of a firm reporting a novel innovation using data from the 2018 United States Census Bureau’s Annual Business Survey. Transparency is increased in three ways: 1) all specification testing and identifying potentially productive models is done in an exploratory subsample that 2) preserves the validity of hypothesis test statistics fromde novoestimation in the holdout confirmatory sample with 3) all findings publicly documented in an earlier registered report and in this journal publication. Bayesian estimation procedures that leverage information from the exploratory stage included in the confirmatory stage estimation replace traditional frequentist null hypothesis significance testing. In addition to increasing statistical power by using information from the full sample, Bayesian methods directly estimate a probability distribution for the magnitude of an effect, allowing much richer inference. Estimated magnitudes of diversity along academic discipline, race, ethnicity, and foreign-born status dimensions are positively associated with innovation. A maximally diverse ownership team on these dimensions would be roughly six times more likely to report new-to-market innovation than a homophilic team.

Science & Technology - Other Topics↗
DOE OSTI2024

High-Dimensional Bayesian Optimization via Semi-Supervised Learning with Optimized Unlabeled Data Sampling

We introduce a novel semi-supervised learning approach, named Teacher-Student Bayesian Optimization (TSBO ), integrating the teacher-student paradigm into BO to minimize expensive labeled data queries for the first time. TSBO incorporates a teacher model, an unlabeled data sampler, and a student model. The student is trained on unlabeled data locations generated by the sampler, with pseudo labels predicted by the teacher. The interplay between these three components implements a unique selective regularization to the teacher in the form of student feedback. This scheme enables the teacher to predict high-quality pseudo labels, enhancing the generalization of the GP surrogate model in the search space. To fully exploit TSBO , we propose two optimized unlabeled data samplers to construct effective student feedback that well aligns with the objective of Bayesian optimization. Furthermore, we quantify and leverage the uncertainty of the teacher-student model for the provision of reliable feedback to the teacher in the presence of risky pseudo-label predictions. TSBO demonstrates significantly improved sample-efficiency in several global optimization tasks under tight labeled data budgets. The implementation is available at https://github.com/reminiscenty/TSBO-Official.

Yin, Yuxuan↗
DOE OSTI2024

Forward variable selection enables fast and accurate dynamic system identification with Karhunen-Loève decomposed Gaussian processes

A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Loève (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed kernels have the potential to be very fast, and do not depend on the selection of a reduced set of inducing points. However KL decompositions lead to high dimensionality, and variable selection thus becomes paramount. This paper reports a new method of forward variable selection, enabled by the ordered nature of the basis functions in the KL expansion of the Bayesian Smoothing Spline ANOVA kernel (BSS-ANOVA), coupled with fast Gibbs sampling in a fully Bayesian approach. It quickly and effectively limits the number of terms, yielding a method with competitive accuracies, training and inference times for tabular datasets of low feature set dimensionality. Theoretical computational complexities are O ( N P 2 ) in training and O ( P ) per point in inference, where N is the number of instances and P the number of expansion terms. The inference speed and accuracy makes the method especially useful for dynamic systems identification, by modeling the dynamics in the tangent space as a static problem, then integrating the learned dynamics using a high-order scheme. The methods are demonstrated on two dynamic datasets: a ‘Susceptible, Infected, Recovered’ (SIR) toy problem, along with the experimental ‘Cascaded Tanks’ benchmark dataset. Comparisons on the static prediction of time derivatives are made with a random forest (RF), a residual neural network (ResNet), and the Orthogonal Additive Kernel (OAK) inducing points scalable GP, while for the timeseries prediction comparisons are made with LSTM and GRU recurrent neural networks (RNNs) along with the SINDy package.

Hayes, Kyle↗
DOE OSTI2025

Scalable Algorithms for Inverse Problems With High-Dimensional Parameter Spaces

Inverse problems, which involve inferring unknown parameters from observed data, present significant computational challenges, especially in large-scale settings with high-dimensional unknown parameters and nonlinear relationships between the unknowns and observations. Bayesian inference provides an approach for addressing these problems, often relying on sequential sampling methods like Markov chain Monte Carlo (MCMC) to approximate the posterior distribution of the parameters. However, MCMC methods become computationally demanding as the dimensionality of the problem increases, particularly in large-scale systems where likelihood evaluations rely on solving partial differential equations (PDEs) on large spatial domains with finely resolved meshes. To overcome these limitations, recent advancements have focused on designing scalable computa tional techniques – for both PDE simulations and sampling strategies – to make Bayesian methods feasible for high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗