Search NASA⌕ Search

SEARCH · Search NASA

Results for “Posterior sample”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Bayesian Static Parameter Estimation for Partially Observed Diffusions via Multilevel Monte Carlo

In this article we consider static Bayesian parameter estimation for partially observed diffusions that are discretely observed. We work under the assumption that one must resort to discretizing the underlying diffusion process, for instance, using the Euler--Maruyama method. Given this assumption, we show how one can use Markov chain Monte Carlo (MCMC) and particularly particle MCMC [C. Andrieu, A. Doucet, and R. Holenstein, J. R. Stat. Soc. Ser. B Stat. Methodol., 72 (2010), 269--342] to implement a new approximation of the multilevel (ML) Monte Carlo (MC) collapsing sum identity. Our approach comprises constructing an approximate coupling of the posterior density of the joint distribution over parameter and hidden variables at two different discretization levels and then correcting by an importance sampling method. The variance of the weights are independent of the length of the observed data set. The utility of such a method is that, for a prescribed level of mean square error, the cost of this MLMC method is provably less than i.i.d. sampling from the posterior associated to the most precise discretization. However the method here comprises using only known and efficient simulation methodologies. Finally, the theoretical results are illustrated by inference of the parameters of two prototypical processes given noisy partial observations of the process: the first is an Ornstein--Uhlenbeck process and the second is a more general Langevin equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Ensemble variational Fokker-Planck methods for data assimilation

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

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

nautilus : boosting Bayesian importance nested sampling with deep learning

ABSTRACT We introduce a novel approach to boost the efficiency of the importance nested sampling (INS) technique for Bayesian posterior and evidence estimation using deep learning. Unlike rejection-based sampling methods such as vanilla nested sampling (NS) or Markov chain Monte Carlo (MCMC) algorithms, importance sampling techniques can use all likelihood evaluations for posterior and evidence estimation. However, for efficient importance sampling, one needs proposal distributions that closely mimic the posterior distributions. We show how to combine INS with deep learning via neural network regression to accomplish this task. We also introduce nautilus, a reference open-source python implementation of this technique for Bayesian posterior and evidence estimation. We compare nautilus against popular NS and MCMC packages, including emcee, dynesty, ultranest, and pocomc, on a variety of challenging synthetic problems and real-world applications in exoplanet detection, galaxy SED fitting and cosmology. In all applications, the sampling efficiency of nautilus is substantially higher than that of all other samplers, often by more than an order of magnitude. Simultaneously, nautilus delivers highly accurate results and needs fewer likelihood evaluations than all other samplers tested. We also show that nautilus has good scaling with the dimensionality of the likelihood and is easily parallelizable to many CPUs.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2022

HYPHY: Deep Generative Conditional Posterior Mapping of Hydrodynamical Physics

Generating large-volume hydrodynamical simulations for cosmological observables is a computationally demanding task necessary for next-generation observations. In this work, we construct a novel fully convolutional variational autoencoder (VAE) to synthesize hydrodynamic fields conditioned on dark matter fields from N -body simulations. After training the model on a single hydrodynamical simulation, we are able to probabilistically map new dark-matter-only simulations to corresponding full hydrodynamical outputs. By sampling over the latent space of our VAE, we can generate posterior samples and study the variance of the mapping. We find that our reconstructed field provides an accurate representation of the target hydrodynamical fields as well as reasonable variance estimates. This approach has promise for the rapid generation of mocks as well as for implementation in a full inverse model of observed data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Accelerating astronomical and cosmological inference with preconditioned Monte Carlo

ABSTRACT We introduce preconditioned Monte Carlo (PMC), a novel Monte Carlo method for Bayesian inference that facilitates efficient sampling of probability distributions with non-trivial geometry. PMC utilizes a Normalizing Flow (NF) in order to decorrelate the parameters of the distribution and then proceeds by sampling from the preconditioned target distribution using an adaptive Sequential Monte Carlo (SMC) scheme. The results produced by PMC include samples from the posterior distribution and an estimate of the model evidence that can be used for parameter inference and model comparison, respectively. The aforementioned framework has been thoroughly tested in a variety of challenging target distributions achieving state-of-the-art sampling performance. In the cases of primordial feature analysis and gravitational wave inference, PMC is approximately 50 and 25 times faster, respectively, than nested sampling (NS). We found that in higher dimensional applications, the acceleration is even greater. Finally, PMC is directly parallelisable, manifesting linear scaling up to thousands of CPUs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Mass variance from archival X-ray properties of Dark Energy Survey Year-1 galaxy clusters

ABSTRACT Using archival X-ray observations and a lognormal population model, we estimate constraints on the intrinsic scatter in halo mass at fixed optical richness for a galaxy cluster sample identified in Dark Energy Survey Year-One (DES-Y1) data with the redMaPPer algorithm. We examine the scaling behaviour of X-ray temperatures, TX, with optical richness, λRM, for clusters in the redshift range 0.2 < z < 0.7. X-ray temperatures are obtained from Chandra and XMM observations for 58 and 110 redMaPPer systems, respectively. Despite non-uniform sky coverage, the TX measurements are $\gt 50{{\ \rm per\ cent}}$ complete for clusters with λRM > 130. Regression analysis on the two samples produces consistent posterior scaling parameters, from which we derive a combined constraint on the residual scatter, $\sigma _{\ln T \, |\, \lambda }= 0.275 \pm 0.019$. Joined with constraints for TX scaling with halo mass from the Weighing the Giants program and richness–temperature covariance estimates from the LoCuSS sample, we derive the richness-conditioned scatter in mass, $\sigma _{\ln M \, |\, \lambda }= 0.30 \pm 0.04\, _{({\rm stat})} \pm 0.09\, _{({\rm sys})}$, at an optical richness of approximately 100. Uncertainties in external parameters, particularly the slope and variance of the TX–mass relation and the covariance of TX and λRM at fixed mass, dominate the systematic error. The $95{{\ \rm per\ cent}}$ confidence region from joint sample analysis is relatively broad, $\sigma _{\ln M \, |\, \lambda }\in [0.14, \, 0.55]$, or a factor 10 in variance.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Mass Variance from Archival X-ray Properties of Dark Energy Survey Year-1 Galaxy Clusters

Using archival X-ray observations and a log-normal population model, we estimate constraints on the intrinsic scatter in halo mass at fixed optical richness for a galaxy cluster sample identified in Dark Energy Survey Year-One (DES-Y1) data with the redMaPPer algorithm. We examine the scaling behavior of X-ray temperatures, $T_X$, with optical richness, $\lambda_{RM}$, for clusters in the redshift range $0.2 50\%$ complete for clusters with $\lambda_{RM} > 130$. Regression analysis on the two samples produces consistent posterior scaling parameters, from which we derive a combined constraint on the residual scatter, $\sigma_{\ln Tx | \lambda} = 0.275 \pm 0.019$. Joined with constraints for $T_X$ scaling with halo mass from the Weighing the Giants program and richness--temperature covariance estimates from the LoCuSS sample, we derive the richness-conditioned scatter in mass, $\sigma_{\ln M | \lambda} = 0.30 \pm 0.04\, _{({\rm stat})} \pm 0.09\, _{({\rm sys})}$, at an optical richness of approximately 70. Uncertainties in external parameters, particularly the slope and variance of the $T_X$--mass relation and the covariance of $T_X$ and $\lambda_{RM}$ at fixed mass, dominate the systematic error. The $95\%$ confidence region from joint sample analysis is relatively broad, $\sigma_{\ln M | \lambda} \in [0.14, \, 0.55]$, or a factor ten in variance.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Bayesian analysis of (3 +1)⁢D relativistic nuclear dynamics with the RHIC beam energy scan data

This work presents a Bayesian inference study for relativistic heavy-ion collisions in the beam energy scan program at the BNL Relativistic Heavy-Ion Collider. The theoretical model simulates event-by-event (3+1)-dimensional [(3+1)⁢D] collision dynamics using hydrodynamics and hadronic transport theory. We analyze the model's 20-dimensional posterior distributions obtained using three model emulators with different accuracy and demonstrate the essential role of training an accurate model emulator in the Bayesian analysis. Our analysis provides robust constraints on the quark-gluon plasma's transport properties and various aspects of (3+1)⁢D relativistic nuclear dynamics. By running full model simulations with 100 parameter sets sampled from the posterior distribution, we make predictions for p T -differential observables and estimate their systematic theory uncertainty. Here, a sensitivity analysis is performed to elucidate how individual experimental observables respond to different model parameters, providing useful physics insights into the phenomenological model for heavy-ion collisions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2018

Umbrella sampling: a powerful method to sample tails of distributions

We present the umbrella sampling (US) technique and show that it can be used to sample extremely low-probability areas of the posterior distribution that may be required in statistical analyses of data. In this approach sampling of the target likelihood is split into sampling of multiple biased likelihoods confined within individual umbrella windows. We show that the US algorithm is efficient and highly parallel and that it can be easily used with other existing Markov Chain Monte Carlo (MCMC) samplers. The method allows the user to capitalize on their intuition and define umbrella windows and increase sampling accuracy along specific directions in the parameter space. Alternatively, one can define umbrella windows using an approach similar to parallel tempering. We provide a public code that implements US as a standalone PYTHON package. We present a number of tests illustrating the power of the US method in sampling low-probability areas of the posterior and show that this ability allows a considerably more robust sampling of multimodal distributions compared to standard sampling methods. We also present an application of the method in a real world example of deriving cosmological constraints using the supernova type Ia data. We show that US can sample the posterior accurately down to the approximate to 15 sigma credible region in the Omega(m) - Omega(Lambda) plane, while for the same computational effort the affine-invariant MCMC sampling implemented in the emcee code samples the posterior reliably only to approximate to 3 sigma.

cosmology: cosmological parameters↗
DOE OSTI2022

Challenges in Markov Chain Monte Carlo for Bayesian Neural Networks

Markov chain Monte Carlo (MCMC) methods have not been broadly adopted in Bayesian neural networks (BNNs). This paper initially reviews the main challenges in sampling from the parameter posterior of a neural network via MCMC. Such challenges culminate to lack of convergence to the parameter posterior. Nevertheless, this paper shows that a nonconverged Markov chain, generated via MCMC sampling from the parameter space of a neural network, can yield via Bayesian marginalization a valuable posterior predictive distribution of the output of the neural network. Further, classification examples based on multilayer perceptrons showcase highly accurate posterior predictive distributions. The postulate of limited scope for MCMC developments in BNNs is partially valid; an asymptotically exact parameter posterior seems less plausible, yet an accurate posterior predictive distribution is a tenable research avenue.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Advancing earth system model calibration: a diffusion-based method

Understanding of climate impact on ecosystems globally requires site-specific model calibration. Here we introduce a novel diffusion-based uncertainty quantification (DBUQ) method for efficient model calibration. DBUQ is a score-based diffusion model that leverages Monte Carlo simulation to estimate the score function and evaluates a simple neural network to quickly generate samples for approximating parameter posterior distributions. DBUQ is stable, efficient, and can effectively calibrate the model given diverse observations, thereby enabling rapid and site-specific model calibration on a global scale. This capability significantly advances Earth system modeling and our understanding of climate impacts on Earth systems. We demonstrate DBUQ's capability in E3SM land model calibration at the Missouri Ozark AmeriFlux forest site. Both synthetic and real-data applications indicate that DBUQ produces accurate parameter posterior distributions similar to those generated by Markov Chain Monte Carlo sampling but with 30X less computing time. This efficiency marks a significant stride in model calibration, paving the way for more effective and timely climate impact analyses.

Liu, Yanfang↗
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 OSTI2025

Karhunen–Loève deep learning method for surrogate modeling and approximate Bayesian parameter estimation

We evaluate the performance of the Karhunen-Loève Deep Neural Network (KL-DNN) framework for surrogate modeling and approximate Bayesian parameter estimation in partial differential equation models. In the surrogate model, the Karhunen-Loève (KL) expansions are used for the dimensionality reduction of the number of unknown parameters and variables, and a deep neural network is employed to relate the reduced space of parameters to that of the state variables. The KL-DNN surrogate model is used to formulate a maximum-a-posteriori-like least-squares problem, which is randomized to draw samples of the posterior distribution of the parameters. We test the proposed framework for a hypothetical unconfined aquifer via comparison with the forward MODFLOW and inverse PEST++ iterative ensemble smoother (IES) solutions as well as the state-of-the-art Fourier neural operator (FNO) and deep operator networks (DeepONets) operator learning surrogate models. Our results show that the KL-DNN surrogate model outperforms FNO and DeepONet for forward predictions. For solving inverse problems, the randomized algorithm provides the same or more accurate Bayesian predictions of the parameters than IES as evidenced by the higher log-predictive probability of both the estimated parameter field and the forecast hydraulic head. The posterior mean obtained from the randomized algorithm is closer to the reference parameter field than that obtained with FNO as the maximum a posteriori estimate.

Approximate Bayesian inference↗
DOE OSTI2025

Accelerating Hamiltonian Monte Carlo for Bayesian inference in neural networks and neural operators

Hamiltonian Monte Carlo (HMC) is a powerful and accurate method to sample from the posterior distribution in Bayesian inference. However, HMC techniques are computationally demanding for Bayesian neural networks due to the high dimensionality of the network’s parameter space and the non-convexity of their posterior distributions. Therefore, various approximation techniques, such as variational inference (VI) or stochastic gradient MCMC, are often employed to infer the posterior distribution of the network parameters. Such approximations introduce inaccuracies in the inferred distributions, resulting in unreliable uncertainty estimates. In this work, we propose a hybrid approach that combines inexpensive VI and accurate HMC methods to efficiently and accurately quantify uncertainties in neural networks and neural operators. The proposed approach leverages an initial VI training on the full network. We examine the influence of individual parameters on the prediction uncertainty, which shows that a large proportion of the parameters do not contribute substantially to uncertainty in the network predictions. This information is then used to significantly reduce the dimension of the parameter space, and HMC is performed only for the subset of network parameters that strongly influence prediction uncertainties. This yields a framework for accelerating the full batch HMC for posterior inference in neural networks. We demonstrate the efficiency and accuracy of the proposed framework on deep neural networks and operator networks, showing that inference can be performed for large networks with tens to hundreds of thousands of parameters. Finally, we show that this method can effectively learn surrogates for complex physical systems by modeling the operator that maps from upstream conditions to wall-pressure data on a cone in hypersonic flow.

Bayesian inference↗
DOE OSTI2021

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

DeepONet-grid-UQ: A trustworthy deep operator framework for predicting the power grid’s post-fault trajectories

This paper proposes a novel data-driven method for the reliable prediction of the power grid’s post-fault trajectories, i.e., the power grid’s dynamic response after a disturbance or fault. Here, the proposed method is based on the recently proposed concept of Deep Operator Networks (DeepONets). Unlike traditional neural networks that learn to approximate functions, DeepONets are designed to approximate nonlinear operators, i.e., mappings between infinite-dimensional spaces. Under this operator framework, we design a novel and efficient DeepONet that (i) takes as inputs the trajectories collected before and during the fault and (ii) outputs the predicted post-fault trajectories. In addition, we endow our method with the much-needed ability to balance efficiency with reliable/trustworthy predictions via uncertainty quantification. To this end, we propose and compare two novel methods that enable quantifying the predictive uncertainty. First, we propose a Bayesian DeepONet (B-DeepONet) that uses stochastic gradient Hamiltonian Monte-Carlo to sample from the posterior distribution of the DeepONet trainable parameters. Then, we design a Probabilistic DeepONet (Prob-DeepONet) that uses a probabilistic training strategy to enable quantifying uncertainty at virtually no extra computational cost. Finally, we validate the proposed methods’ predictive power and uncertainty quantification capability using the New York-New England power grid model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Uncertainty Quantification for Neutron Shield Using Convolutional Neural Networks

Uncertainty quantification from radiation transport calculations was conducted using a Bayesian inference approach. A surrogate model, using a convolutional neural network, was employed to emulate the neutron fluence, which was simulated with a Monte Carlo radiation transport model. This allowed for a computationally cheap approach to evaluate input parameters and to sample their corresponding posterior probability distributions. Experimental data from the literature were employed to perform uncertainty quantification studies for concrete shields. As a result, the method is a nonintrusive approach that enables studies with multiple input parameters and can be applied to any radiation transport model.

Bayesian inference↗