Search NASA⌕ Search

SEARCH · Search NASA

Results for “Metropolis Hastings Monte Carlo Algorithm”

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

Bayesian forecasting and uncertainty quantifying of stream flows using Metropolis–Hastings Markov Chain Monte Carlo algorithm

This paper presents a Bayesian approach using Metropolis-Hastings Markov Chain Monte Carlo algorithm and applies this method for daily river flow rate forecast and uncertainty quantification for Zhujiachuan River using data collected from Qiaotoubao Gage Station and other 13 gage stations in Zhujiachuan watershed in China. The proposed method is also compared with the conventional maximum likelihood estimation (MLE) for parameter estimation and quantification of associated uncertainties. While the Bayesian method performs similarly in estimating the mean value of daily flow rate, it performs over the conventional MLE method on uncertainty quantification, providing relatively narrower reliable interval than the MLE confidence interval and thus more precise estimation by using the related information from regional gage stations. As a result, the Bayesian MCMC method might be more favorable in the uncertainty analysis and risk management.

58 GEOSCIENCES↗

Metropolis–Hastings Monte Carlo Method for Neutron Emissivity Tomographic Inversion in Tokamak Plasma

The article presents a new approach to plasma neutron emissivity reconstruction based on the Metropolis–Hastings Monte Carlo algorithm. The algorithm is based on a biased random walk. A dedicated computer code generates pseudo-random samples within the domain that contains the solution. The properly chosen objective function ensures convergence to the desired solution. The method allows to overcome the problem of trapping in local minima by accepting, with some finite probability, changes in the direction opposite to that indicated by the objective function. The developed method was tested using a synthetic data set. The results show that the method provides reliable reconstructions and thus can be used as an alternative or complementary method to the commonly applied ones. The method capabilities were also tested against noise present in the line-integrated projections.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Bayesian Monte-Carlo Evaluation Framework for Imperfect Data [Slides]

BMC evaluation is a tool to address imperfect data & models, non-linear models, and non-normal PDFs. New posterior PDFs may need new storage formats to allow storage of non-normal PDFs. Storing posterior sets allows for: variance, covariance, skewness, etc.

97 MATHEMATICS AND COMPUTING↗

BayesCLUMPY: BAYESIAN INFERENCE WITH CLUMPY DUSTY TORUS MODELS

Our aim is to present a fast and general Bayesian inference framework based on the synergy between machine learning techniques and standard sampling methods and apply it to infer the physical properties of clumpy dusty torus using infrared photometric high spatial resolution observations of active galactic nuclei. We make use of the Metropolis-Hastings Markov Chain Monte Carlo algorithm for sampling the posterior distribution function. Such distribution results from combining all a priori knowledge about the parameters of the model and the information introduced by the observations. The main difficulty resides in the fact that the model used to explain the observations is computationally demanding and the sampling is very time consuming. For this reason, we apply a set of artificial neural networks that are used to approximate and interpolate a database of models. As a consequence, models not present in the original database can be computed ensuring continuity. We focus on the application of this solution scheme to the recently developed public database of clumpy dusty torus models. The machine learning scheme used in this paper allows us to generate any model from the database using only a factor of 10{sup -4} of the original size of the database and a factor of 10{sup -3} in computing time. The posterior distribution obtained for each model parameter allows us to investigate how the observations constrain the parameters and which ones remain partially or completely undetermined, providing statistically relevant confidence intervals. As an example, the application to the nuclear region of Centaurus A shows that the optical depth of the clouds, the total number of clouds, and the radial extent of the cloud distribution zone are well constrained using only six filters. The code is freely available from the authors.

79 ASTRONOMY AND ASTROPHYSICS↗

Markov Chain Monte Carlo Used in Parameter Inference of Magnetic Resonance Spectra

In this paper, we use Boltzmann statistics and the maximum likelihood distribution derived from Bayes’ Theorem to infer parameter values for a Pake Doublet Spectrum, a lineshape of historical significance and contemporary relevance for determining distances between interacting magnetic dipoles. A Metropolis Hastings Markov Chain Monte Carlo algorithm is implemented and designed to find the optimum parameter set and to estimate parameter uncertainties. In conclusion, the posterior distribution allows us to define a metric on parameter space that induces a geometry with negative curvature that affects the parameter uncertainty estimates, particularly for spectra with low signal to noise.

43 PARTICLE ACCELERATORS↗

Bayesian Monte-Carlo Evaluation Framework for Imperfect Nuclear Data [Slides]

BMC evaluation is a tool used to address imperfect data and models, non-linear models, and non-normal PDFs. ENDF-6 format does not allow non-normal parameter PDFs. Storing posterior sets allows for variance, covariance, skewness, etc. To better predict criticality, we should document non-normal parameter PDFs (i.e. asymmetric uncertainty) and consider non-linear sensitivity of $k_{\text{eff}}$ to resonance parameters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Bayesian Monte-Carlo Framework: New Methods for Resonance Parameter Evaluation [Slides]

BMC evaluation is a tool to address imperfect data & models, non-linear models, and non-normal PDFs. ENDF-6 format does not allow non-normal parameter PDFs. Storing posterior sets allow for variance, covariance, skewness, etc. To better predict criticality, we could document non-normal parameter PDFs (i.e. asymmetric uncertainty), consider non-linear sensitivity of $\kappa$ eff to resonance parameters, and reduce uncertainty in key resonance parameters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Automatic Step Size Selection in Random Walk Metropolis Algorithms

Practitioners of Markov chain Monte Carlo (MCMC) may hesitate to use random walk Metropolis- Hastings algorithms, especially variable-at-a-time algorithms with many parameters, because these algorithms require users to select values of tuning parameters (step sizes). These algorithms perform poorly if the step sizes are set to be too low or too high. We show in this paper that it is not difficult for an algorithm to tune these step sizes automatically to obtain a desired acceptance probability, since the logit of the acceptance probability is very nearly linear in the log of the step size, with known slope coefficient. These ideas work in most applications, including single parameter or block moves on the linear, log, or logit scales. We discuss the implementation of this algorithm in the software package YADAS.

97 MATHEMATICS AND COMPUTING↗

Bayesian analysis of the flutter margin method in aeroelasticity

A Bayesian statistical framework is presented for Zimmerman and Weissenburger flutter margin method which considers the uncertainties in aeroelastic modal parameters. The proposed methodology overcomes the limitations of the previously developed least-square based estimation technique which relies on the Gaussian approximation of the flutter margin probability density function (pdf). Using the measured free-decay responses at subcritical (preflutter) airspeeds, the joint non-Gaussain posterior pdf of the modal parameters is sampled using the Metropolis–Hastings (MH) Markov chain Monte Carlo (MCMC) algorithm. The posterior MCMC samples of the modal parameters are then used to obtain the flutter margin pdfs and finally the flutter speed pdf. The usefulness of the Bayesian flutter margin method is demonstrated using synthetic data generated from a two-degree-of-freedom pitch-plunge aeroelastic model. The robustness of the statistical framework is demonstrated using different sets of measurement data. In conclusion, it will be shown that the probabilistic (Bayesian) approach reduces the number of test points required in providing a flutter speed estimate for a given accuracy and precision.

97 MATHEMATICS AND COMPUTING↗

Model-independent limits and constraints on extended theories of gravity from cosmic reconstruction techniques

The onset of dark energy domination depends on the particular gravitational theory driving the cosmic evolution. Model independent techniques are crucial to test the both the present ΛCDM cosmological paradigm and alternative theories, making the least possible number of assumptions about the Universe. In this paper we investigate whether cosmography is able to distinguish between different gravitational theories, by determining bounds on model parameters for three different extensions of General Relativity, namely quintessence, F (Τ) and f ( R ) gravitational theories. We expand each class of theories in powers of redshift z around the present time, making no additional assumptions. This procedure is an extension of previous work and can be seen as the most general approach for testing extended theories of gravity through the use of cosmography. In the case of F (Τ) and f ( R ) theories, we show that some assumptions on model parameters often made in previous works are superfluous or even unjustified. We use data from the Union 2.1 supernovae catalogue, baryonic acoustic oscillation data and H ( z ) differential age compilations, which probe cosmology on different scales of the cosmological evolution. We perform a Monte Carlo analysis using a Metropolis-Hastings algorithm with a Gelman-Rubin convergence criterion, reporting 1-σ and 2-σ confidence levels. To do so, we perform two distinct fits, assuming only data within z < 1 first and then without limitations in redshift. We obtain the corresponding numerical intervals in which coefficients span, and find that the data is compatible the ΛCDM limit of all three theories at the 1-σ level, while still compatible with quite a large portion of parameter space. We compare our results to the truncated ΛCDM paradigm, demonstrating that our bounds divert from the expectations of previous works, showing that the permitted regions of coefficients are significantly modified and in general widened with respect to values usually reported in the existing literature. Finally, we test the extended theories through the Bayesian selection criteria AIC and BIC.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient Subset Simulation using Hamiltonian Neural Network enhanced Markov Chain Monte Carlo Methods

The Monte Carlo method delivers an unbiased estimate of the probability of failure. However, the variance of the estimate depends on the number of evaluated samples. This number must be very large for estimations of a low probability of failure. If the evaluation of each sample is computationally expensive, the crude Monte Carlo simulation strategy is impracticable. Therefore, subset simulations are used to reduce the required number of evaluations. Subset simulations require a Markov Chain Monte Carlo sampler, such as the random walk Metropolis-Hastings algorithm. The algorithm, however, struggles with sampling in low-probability regions, especially if they are narrow. As a consequence, advanced Markov Chain Monte Carlo simulations have been developed. In particular, the Hamiltonian Monte Carlo method explores the target distribution rapidly. Driven by the idea of Hamiltonian dynamics, this sampler provides a non-random walk through the target distribution. The incorporation of subset simulation and Hamiltonian Monte Carlo methods has shown promising results for reliability analysis. One downside of the Hamiltonian Monte Carlo method is that gradient evaluations are computationally expensive, especially when dealing with high-dimensional problems and evaluating long trajectories. We show that integrating Hamiltonian neural networks in Hamiltonian Monte Carlo simulations significantly speeds up the sampling task. Furthermore, the enhancement of adaptive trajectory length within the Hamiltonian Monte Carlo results in the efficient proposal of the following states. Based on this recent enhancement, we provide a fast sampling strategy for subset simulations using Hamiltonian neural networks to replace the evaluation of the gradient and significantly speed up the Hamiltonian Monte Carlo simulation.

97 MATHEMATICS AND COMPUTING↗

(U) Validation and Optimization of a 1-Dimensional Quasi-Isentropic Compression Model Using a Functionally Graded Material Flyer Plate

The fields studying highly compressed materials have been around for many years. These fields have given birth to better understandings of the solar fusion cycle and the liquid-metallic core of Jupiter. The highest pressures achieved have been at the National Ignition Facility (NIF) and more recently, the Z-Machine. One method to achieve higher levels of compression is to use quasi-isentropic (QI) compression. In practice, this means minimizing the amount of temperature increase of the target material. In their paper, J.H. Nguyen et. al. manufactured a functionally graded material (FGM) in order to help them achieve QI compression. The aim of the study described in this paper is to validate a 1-dimensional (1D) FLAG model that uses an FGM flyer to compress a copper (Cu) target. Once validated, the density/composition profile of the FGM is varied and optimized using Markov Chain Monte Carlo, specifically using a Metropolis-Hastings algorithm to find the optimal FGM profile that minimizes the temperature increase in the copper.

36 MATERIALS SCIENCE↗

Bayesian inference of Stochastic reaction networks using Multifidelity Sequential Tempered Markov Chain Monte Carlo

Stochastic reaction network models are often used to explain and predict the dynamics of gene regulation in single cells.These models usually involve several parameters, such as the kinetic rates of chemical reactions, that are not directly measurable and must be inferred from experimental data. Bayesian inference provides a rigorous probabilistic frame-work for identifying these parameters by finding a posterior parameter distribution that captures their uncertainty.Traditional computational methods for solving inference problems such as Markov Chain Monte Carlo methods based on classical Metropolis-Hastings algorithm involve numerous serial evaluations of the likelihood function, which in turn requires expensive forward solutions of the chemical master equation (CME). We propose an alternate approach based on a multifidelity extension of the Sequential Tempered Markov Chain Monte Carlo (ST-MCMC) sampler. This algorithm is built upon Sequential Monte Carlo and solves the Bayesian inference problem by decomposing it into a sequence of efficiently solved subproblems that gradually increase both model fidelity and the influence of the observed data. We reformulate the finite state projection (FSP) algorithm, a well-known method for solving the CME, to produce a hierarchy of surrogate master equations to be used in this multifidelity scheme. To determine the appropriate fidelity, we introduce a novel information-theoretic criteria that seeks to extract the most information about the ultimate Bayesian posterior from each model in the hierarchy without inducing significant bias. This novel sampling scheme is tested with high performance computing resources using biologically relevant problems.

97 MATHEMATICS AND COMPUTING↗

Accelerating Markov Chain Monte Carlo sampling with diffusion models

Global fits of physics models require efficient methods for exploring high-dimensional and/or multimodal posterior functions. We introduce a novel method for accelerating Markov Chain Monte Carlo (MCMC) sampling by pairing a Metropolis-Hastings algorithm with a diffusion model that can draw global samples with the aim of approximating the posterior. We briefly review diffusion models in the context of image synthesis before providing a streamlined diffusion model tailored towards low-dimensional data arrays. We then present our adapted Metropolis-Hastings algorithm which combines local proposals with global proposals taken from a diffusion model that is regularly trained on the samples produced during the MCMC run. Our approach leads to a significant reduction in the number of likelihood evaluations required to obtain an accurate representation of the Bayesian posterior across several analytic functions, as well as for a physical example based on a global fit of parton distribution functions. Our method is extensible to other MCMC techniques, and we briefly compare our method to similar approaches based on normalising flows. A code implementation can be found at https://github.com/NickHunt-Smith/MCMC-diffusion.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Convergence acceleration of Monte Carlo many-body perturbation methods by direct sampling

In the Monte Carlo many-body perturbation (MC-MP) method, the conventional correlation-correction formula, which is a long sum of products of low-dimensional integrals, is first recast into a short sum of high-dimensional integrals over electron-pair and imaginary-time coordinates. These high-dimensional integrals are then evaluated by the Monte Carlo method with random coordinates generated by the Metropolis–Hasting algorithm according to a suitable distribution. The latter algorithm, while advantageous in its ability to sample nearly any distribution, introduces autocorrelation in sampled coordinates, which in turn increases the statistical uncertainty of the integrals and thus the computational cost. It also involves wasteful rejected moves and an initial “burn-in” step as well as displays hysteresis. Here, an algorithm is proposed that directly produces a random sequence of electron-pair coordinates for the same distribution used in the MC-MP method, which is free from autocorrelation, rejected moves, a burn-in step, or hysteresis. Furthermore, this direct-sampling algorithm is shown to accelerate second- (MC-MP2) and third-order Monte Carlo many-body perturbation (MC-MP3) calculations by up to 222% and 38%, respectively.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Determination of nuclear PDFs using Markov chain Monte Carlo methods

Global QCD analyses of nuclear parton distribution functions (nPDFs) have traditionally relied on the Hessian method for uncertainty estimation. However, the inherent Gaussian approximation and reliance on local curvature often prove insufficient for nPDF fits, which are frequently characterized by limited data constraints and non-Gaussian likelihoods. In this paper, we present the first nPDF determination based on Markov Chain Monte Carlo (MCMC) techniques, implemented within the nCTEQ framework using an adaptive Metropolis-Hastings algorithm. The MCMC approach enables a direct mapping of the posterior distribution and reveals a highly nontrivial parameter-space structure, including multiple modes and pronounced non-Gaussian behavior, particularly for the valence PDFs. We perform the first single-nucleus global analysis of lead PDFs using exclusively lead data and compare it to a multi-nuclei fit employing a standard analytic A dependence. The inclusion of lighter nuclei reduces quark uncertainties and modifies the shape of the lead PDFs, while leaving the gluon distribution largely unaffected. A complementary Hessian analysis exposes systematic limitations of the Gaussian approximation. Our results demonstrate that MCMC methods provide a more reliable framework for uncertainty quantification in nPDF determinations.

Derakhshanian, N. [Institute of Nuclear Physics Po↗

A parallel evolutionary multiple-try metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large, complex, and constrained spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hastings ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel computing architecture through the integration of a parallel EA framework that guides Markov chains running in parallel.

97 MATHEMATICS AND COMPUTING↗

New Algorithms for Estimating Spacecraft Position Using Scanning Techniques for Deep Space Network Antennas

As more and more nonlinear estimation techniques become available, our interest is in finding out what performance improvement, if any, they can provide for practical nonlinear problems that have been traditionally solved using linear methods. In this paper we examine the problem of estimating spacecraft position using conical scan (conscan) for NASA's Deep Space Network antennas. We show that for additive disturbances on antenna power measurement, the problem can be transformed into a linear one, and we present a general solution to this problem, with the least square solution reported in literature as a special case. We also show that for additive disturbances on antenna position, the problem is a truly nonlinear one, and we present two approximate solutions based on linearization and Unscented Transformation respectively, and one 'exact' solution based on Markov Chain Monte Carlo (MCMC) method. Simulations show that, with the amount of data collected in practice, linear methods perform almost the same as MCMC methods. It is only when we artificially reduce the amount of collected data and increase the level of noise that nonlinear methods show significantly better accuracy than that achieved by linear methods, at the expense of more computation.

Metropolis-Hastings (MH)↗