Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic 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 505 records · Page 28

Uncertainty analysis for unprotected accidents in sodium-cooled fast reactors.

Reactor safety analyses often utilize a deterministic approach where in addition to performing best estimate calculations, uncertainty is accommodated by performing calculations with pessimistic values for input parameters that are important to safety. Here, a stochastic approach is considered for explicitly including uncertainty in safety parameters by applying Monte Carlo sampling coupled with established deterministic reactor safety analysis tools. The Monte Carlo approach yields frequency distributions for reactor safety metrics (e.g., peak temperatures) that can be compared to performance limits, allowing for an improved determination of the safety margin and a clear determination of which safety parameters are most important to the transient response. Because the approach enables the estimation of probabilities for violating safety boundaries, it should be useful in a risk-based regulatory environment. It has the advantage of not requiring any substantial rewriting of existing safety analysis computer codes.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

PERIOD ESTIMATION FOR SPARSELY SAMPLED QUASI-PERIODIC LIGHT CURVES APPLIED TO MIRAS

We develop a nonlinear semi-parametric Gaussian process model to estimate periods of Miras with sparsely sampled light curves. The model uses a sinusoidal basis for the periodic variation and a Gaussian process for the stochastic changes. We use maximum likelihood to estimate the period and the parameters of the Gaussian process, while integrating out the effects of other nuisance parameters in the model with respect to a suitable prior distribution obtained from earlier studies. Since the likelihood is highly multimodal for period, we implement a hybrid method that applies the quasi-Newton algorithm for Gaussian process parameters and search the period/frequency parameter space over a dense grid. A large-scale, high-fidelity simulation is conducted to mimic the sampling quality of Mira light curves obtained by the M33 Synoptic Stellar Survey. The simulated data set is publicly available and can serve as a testbed for future evaluation of different period estimation methods. The semi-parametric model outperforms an existing algorithm on this simulated test data set as measured by period recovery rate and quality of the resulting period–luminosity relations.

79 ASTRONOMY AND ASTROPHYSICS↗

Technical Report on Modeling for Quasispecies Abundance Inference with Confidence Intervals from Metagenomic Sequence Data

The overall aim of this project is to develop a software package, called MetaQuant, that can determine the constituents of a complex microbial sample and estimate their relative abundances by analysis of metagenomic sequencing data. The goal for Task 1 is to create a generative model describing the stochastic process underlying the creation of sequence read pairs in the data set. The stages in this generative process include the selection of a source genome sequence for each read pair, with probability dependent on its abundance in the sample. The other stages describe the evolution of the source genome from its nearest common ancestor with a reference genome, breakage of the source DNA into short fragments, and the errors in sequencing the ends of the fragments to produce read pairs.

59 BASIC BIOLOGICAL SCIENCES↗

Experimental demonstration of optical stochastic cooling

Particle accelerators and storage rings have been transformative instruments of discovery, and, for many applications, innovations in particle-beam cooling have been a principal driver of that success. Stochastic cooling (SC), one of the most important conceptual and technological advances in this area cools a beam through granular sampling and correction of its phase-space structure, thus bearing resemblance to a ‘Maxwell’s demon’. The extension of SC from the microwave regime up to optical frequencies and bandwidths has long been pursued, as it could increase the achievable cooling rates by three to four orders of magnitude and provide a powerful tool for future accelerators. First proposed nearly 30 years ago, optical stochastic cooling (OSC) replaces the conventional microwave elements of SC with optical-frequency analogues and is, in principle, compatible with any species of charged-particle beam. Here we describe a demonstration of OSC in a proof-of-principle experiment at the Fermi National Accelerator Laboratory’s Integrable Optics Test Accelerator. The experiment used 100-MeV electrons and a non-amplified configuration of OSC with a radiation wavelength of 950 nm, and achieved strong, simultaneous cooling of the beam in all degrees of freedom. This realization of SC at optical frequencies serves as a foundation for more advanced experiments with high-gain optical amplification, and advances opportunities for future operational OSC systems with potential benefit to a broad user community in the accelerator-based sciences.

43 PARTICLE ACCELERATORS↗

Insights into the variability of nucleated amyloid polymerization by a minimalistic model of stochastic protein assembly

Self-assembly of proteins into amyloid aggregates is an important biological phenomenon associated with human diseases such as Alzheimer’s disease. Amyloid fibrils also have potential applications in nano-engineering of biomaterials. The kinetics of amyloid assembly show an exponential growth phase preceded by a lag phase, variable in duration as seen in bulk experiments and experiments that mimic the small volumes of cells. Here, to investigate the origins and the properties of the observed variability in the lag phase of amyloid assembly currently not accounted for by deterministic nucleation dependent mechanisms, we formulate a new stochastic minimal model that is capable of describing the characteristics of amyloid growth curves despite its simplicity. We then solve the stochastic differential equations of our model and give mathematical proof of a central limit theorem for the sample growth trajectories of the nucleated aggregation process. These results give an asymptotic description for our simple model, from which closed form analytical results capable of describing and predicting the variability of nucleated amyloid assembly were derived. We also demonstrate the application of our results to inform experiments in a conceptually friendly and clear fashion. Our model offers a new perspective and paves the way for a new and efficient approach on extracting vital information regarding the key initial events of amyloid formation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

97 MATHEMATICS AND COMPUTING↗

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗

Two stochastic models useful in petroleum exploration

A model of the petroleum exploration process that tests empirically the hypothesis that at an early stage in the exploration of a basin, the process behaves like sampling without replacement is proposed along with a model of the spatial distribution of petroleum reserviors that conforms to observed facts. In developing the model of discovery, the following topics are discussed: probabilitistic proportionality, likelihood function, and maximum likelihood estimation. In addition, the spatial model is described, which is defined as a stochastic process generating values of a sequence or random variables in a way that simulates the frequency distribution of areal extent, the geographic location, and shape of oil deposits

Kaufman, G. M.↗

Numerical methods for the weakly compressible Generalized Langevin Model in Eulerian reference frame

A well established approach for the computation of turbulent flow without resolving all turbulent flow scales is to solve a filtered or averaged set of equations, and to model non-resolved scales by closures derived from transported probability density functions (PDF) for velocity fluctuations. Effective numerical methods for PDF transport employ the equivalence between the Fokker–Planck equation for the PDF and a Generalized Langevin Model (GLM), and compute the PDF by transporting a set of sampling particles by GLM (Pope (1985) [1]). The natural representation of GLM is a system of stochastic differential equations in a Lagrangian reference frame, typically solved by particle methods. A representation in a Eulerian reference frame, however, has the potential to significantly reduce computational effort and to allow for the seamless integration into a Eulerian-frame numerical flow solver. GLM in a Eulerian frame (GLMEF) formally corresponds to the nonlinear fluctuating hydrodynamic equations derived by Nakamura and Yoshimori (2009) [12]. Unlike the more common Landau–Lifshitz Navier–Stokes (LLNS) equations these equations are derived from the underdamped Langevin equation and are not based on a local equilibrium assumption. Similarly to LLNS equations the numerical solution of GLMEF requires special considerations. In this paper we investigate different numerical approaches to solving GLMEF with respect to the correct representation of stochastic properties of the solution. We find that a discretely conservative staggered finite-difference scheme, adapted from a scheme originally proposed for turbulent incompressible flow, in conjunction with a strongly stable (for non-stochastic PDE) Runge–Kutta method performs better for GLMEF than schemes adopted from those proposed previously for the LLNS. We show that equilibrium stochastic fluctuations are correctly reproduced.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On unifying randomized methods for inverse problems

This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems with Gaussian priors by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a sample average approximation (SAA). More importantly, we are able to prove a single theoretical result that guarantees the asymptotic convergence for a variety of randomized methods. Additionally, viewing randomized methods as an SAA enables us to prove, for the first time, a single non-asymptotic error result that holds for randomized methods under consideration. Another important consequence of our unified framework is that it allows us to discover new randomization methods. Here, we present various numerical results for linear, nonlinear, algebraic, and PDE-constrained inverse problems that verify the theoretical convergence results and provide a discussion on the apparently different convergence rates and the behavior for various randomized methods.

42 ENGINEERING↗

On the Impact Angle of Hurricane Sandy's New Jersey Landfall

Hurricane Sandy's track crossed the New Jersey coastline at an angle closer to perpendicular than any previous hurricane in the historic record, one of the factors contributing to recordsetting peak-water levels in parts of New Jersey and New York. To estimate the occurrence rate of Sandy-like tracks, we use a stochastic model built on historical hurricane data from the entire North Atlantic to generate a large sample of synthetic hurricanes. From this synthetic set we calculate that under long-term average climate conditions, a hurricane of Sandy's intensity or greater (category 1+) makes NJ landfall at an angle at least as close to perpendicular as Sandy's at an average annual rate of 0.0014 yr-1 (95% confidence range 0.0007 to 0.0023); i.e., a return period of 714 years (95% confidence range 435 to 1429).

hurricanes↗

Optimizing Integrated Terminal Airspace Operations Under Uncertainty

In the terminal airspace, integrated departures and arrivals have the potential to increase operations efficiency. Recent research has developed geneticalgorithm- based schedulers for integrated arrival and departure operations under uncertainty. This paper presents an alternate method using a machine jobshop scheduling formulation to model the integrated airspace operations. A multistage stochastic programming approach is chosen to formulate the problem and candidate solutions are obtained by solving sample average approximation problems with finite sample size. Because approximate solutions are computed, the proposed algorithm incorporates the computation of statistical bounds to estimate the optimality of the candidate solutions. A proof-ofconcept study is conducted on a baseline implementation of a simple problem considering a fleet mix of 14 aircraft evolving in a model of the Los Angeles terminal airspace. A more thorough statistical analysis is also performed to evaluate the impact of the number of scenarios considered in the sampled problem. To handle extensive sampling computations, a multithreading technique is introduced.

air traffic optimization↗

Method and apparatus for constructing informative outcomes to guide multi-policy decision making

In Multi-Policy Decision-Making (MPDM), many computationally-expensive forward simulations are performed in order to predict the performance of a set of candidate policies. In risk-aware formulations of MPDM, only the worst outcomes affect the decision making process, and efficiently finding these influential outcomes becomes the core challenge. Recently, stochastic gradient optimization algorithms, using a heuristic function, were shown to be significantly superior to random sampling. In this disclosure, it was shown that accurate gradients can be computed-even through a complex forward simulation—using approaches similar to those in dep networks. The proposed approach finds influential outcomes more reliably, and is faster than earlier methods, allowing one to evaluate more policies while simultaneously eliminating the need to design an easily-differentiable heuristic function.

Olson, Edwin↗

Resource frugal optimizer for quantum machine learning

Quantum-enhanced data science, also known as quantum machine learning (QML), is of growing interest as an application of near-term quantum computers. Variational QML algorithms have the potential to solve practical problems on real hardware, particularly when involving quantum data. However, training these algorithms can be challenging and calls for tailored optimization procedures. Specifically, QML applications can require a large shot-count overhead due to the large datasets involved. In this work, we advocate for simultaneous random sampling over both the dataset as well as the measurement operators that define the loss function. We consider a highly general loss function that encompasses many QML applications, and we show how to construct an unbiased estimator of its gradient. This allows us to propose a shot-frugal gradient descent optimizer called Refoqus (REsource Frugal Optimizer for QUantum Stochastic gradient descent). Our numerics indicate that Refoqus can save several orders of magnitude in shot cost, even relative to optimizers that sample over measurement operators alone.

97 MATHEMATICS AND COMPUTING↗

Noise analysis of grating-based x-ray differential phase contrast imaging

The sensitivity of x-ray radiographic images, meaning the minimal detectable change in the thickness or in the index of refraction of a sample, is directly related to the uncertainty of the measurement method. In the following work, we report on the recent development of quantitative descriptions for the stochastic error of grating-based differential phase contrast imaging (DPCi). Our model includes the noise transfer characteristics of the x-ray detector and the jitter of the phase steps. We find that the noise in DPCi depends strongly on the phase stepping visibility and the sample properties. The results are supported by experimental evidence acquired with our new instrument with a field of view of 50x70 mm{sup 2}. Our conclusions provide general guidelines to optimize grating interferometers for specific applications and problems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Sensitivity of Simulated Deep Convection to a Stochastic Ice Microphysics Framework

Ice microphysics parameterizations in models must make major simplifications relative to observations, typically employing empirical relationships to represent average functional properties of particles. However, previous studies have established that ice particle properties vary even in similar cloud types and thermodynamic environments, and it remains unclear how this so-called “natural variability” impacts simulated deep convection. This uncertainty is addressed by implementing a stochastic framework into the Predicted Particle Properties microphysics scheme in the Weather Research and Forecasting model. The approach stochastically varies the coefficients of the mass-size (m-D) relationship (m=aD b ) for unrimed and partially rimed ice. Using guidance from aircraft in situ measurements obtained during the Midlatitude Continental Convective Clouds Experiment (MC3E), the scheme samples from distributions of the prefactor (a) and the exponent (b) of the m-D relationship. Simulations of two MC3E deep convective cases indicate that the stochastic m-D scheme produces considerable variability of anvil cirrus cloud optical depth (τ) distributions, even for the same ice water path (IWP). Thus, the stochastic scheme produces variable cloud radiative forcing that is independent of IWP. This τ-IWP relationship variability is nonexistent using the deterministic m-D ensemble. Additional sensitivity tests are performed in which the fallspeed-size relationship (V=cD d ) is stochastically varied, resulting in variable precipitation amounts and rain rate distributions. Results are presented in the context of satellite and precipitation observations and include comparison with other ensemble configurations using perturbed initial and lateral boundary conditions and small-amplitude noise added to the potential temperature field.

54 ENVIRONMENTAL SCIENCES↗