Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic approximation”

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 667 records · Page 37

Bayesian and variational Bayesian approaches for flows in heterogeneous random media

In this paper, we study porous media flows in heterogeneous stochastic media. We propose an efficient forward simulation technique that is tailored for variational Bayesian inversion. As a starting point, the proposed forward simulation technique decomposes the solution into the sum of separable functions (with respect to randomness and the space), where each term is calculated based on a variational approach. This is similar to Proper Generalized Decomposition (PGD). Next, we apply a multiscale technique to solve for each term (as in ) and, further, decompose the random function into 1D fields. As a result, our proposed method provides an approximation hierarchy for the solution as we increase the number of terms in the expansion and, also, increase the spatial resolution of each term. We use the hierarchical solution distributions in a variational Bayesian approximation to perform uncertainty quantification in the inverse problem. We conduct a detailed numerical study to explore the performance of the proposed uncertainty quantification technique and show the theoretical posterior concentration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A master equation and moment approach for biochemical systems with creation-time-dependent bimolecular rate functions

Noise and stochasticity are fundamental to biology and derive from the very nature of biochemical reactions where thermal motion of molecules translates into randomness in the sequence and timing of reactions. This randomness leads to cell-to-cell variability even in clonal populations. Stochastic biochemical networks have been traditionally modeled as continuous-time discrete-state Markov processes whose probability density functions evolve according to a chemical master equation (CME). In diffusion reaction systems on membranes, the Markov formalism, which assumes constant reaction propensities is not directly appropriate. This is because the instantaneous propensity for a diffusion reaction to occur depends on the creation times of the molecules involved. In this work, we develop a chemical master equation for systems of this type. While this new CME is computationally intractable, we make rational dimensional reductions to form an approximate equation, whose moments are also derived and are shown to yield efficient, accurate results. This new framework forms a more general approach than the Markov CME and expands upon the realm of possible stochastic biochemical systems that can be efficiently modeled.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Radiative transfer theory for inhomogeneous media with random extinction and scattering coefficients

The small-angle scattering approximation of the scalar radiative transfer equation (RTE) is examined for the case where the extinction and scattering coefficients have a component that is a deterministic function of position along the propagation path and a component that is a random function of position transverse to the propagation direction. It is found that the resulting stochastic RTE can be reduced to a system of two stochastic integrodifferential equations for the average and fluctuating components of the radiant intensity. Two transfer equations are obtained describing the average radiant intensity and the spatial correlation function of the intensity fluctuations. The average intensity equation is then solved and applied to a simple propagation scenario. An approximate solution is also derived for the equation giving the correlation function. The developed equations can be applied to problems involving short wavelength electromagnetic wave propagation through media possessing the variable characteristics of turbulence and turbidity, such as plasmas, the atmosphere, and the ocean.

Manning, Robert M.↗

Microgrid design and multi-year dispatch optimization under climate-informed load and renewable resource uncertainty

Microgrids are an increasingly popular solution to provide energy resilience in response to increasing grid dependency and the growing impacts of climate change on grid operations. However, existing microgrid models do not currently consider the uncertain and long-term impacts of climate change when determining a set of design and operational decisions to minimize long-term costs or meet a resilience threshold. In this paper, we develop a novel scenario generation method that accounts for the uncertain effects of (i) climate change on variable renewable energy availability, (ii) extreme heat events on site load, and (iii) population and electrification trends on load growth. Additionally, we develop a two-stage stochastic programming extension of an existing microgrid design and dispatch optimization model to obtain uncertainty-informed and climate-resilient energy system decisions that minimizes long-term costs. Use of sample average approximation to validate our two case studies illustrates that the proposed methodology produces high-quality solutions that add resilience to systems with existing backup generation while reducing expected long-term costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Anomalous scaling in helical turbulent environment

The influence of helicity on the anomalous scaling of the single-time structure functions of a passive scalar advected by a non-Gaussian velocity field driven by the stochastic Navier-Stokes equation is investigated by the field theoretic renormalization group and the operator-product expansion within the second order of the perturbation theory (two-loop approximation). The set of compositeoperators with the minimal critical dimensions is identified and their dependence on the helicity parameter is found. It is shown that the contribution to the critical dimensions of the structure functions of a passive scalar is given only by parts of the composite operators which are independent of the helicity parameter. Therefore, it is shown that the spatial parity violation has no impact on the anomalous scaling behavior of the passively advected scalar quantity in the turbulent environment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Approximate Bayesian Model Inversion for PDEs with Heterogeneous and State-Dependent Coefficients

We present two approximate Bayesian inference methods for parameter estimation in partial differential equation (PDE) models with space-dependent and state-dependent parameters. We demonstrate that these methods provide accurate and cost-effective alternatives to Markov Chain Monte Carlo simulation. We assume a parameterized Gaussian prior on the unknown functions, and approximate the posterior density by a parameterized multivariate Gaussian density. The parameters of the prior and posterior are estimated from sparse observations of the PDE model's states and the unknown functions themselves by maximizing the evidence lower bound (ELBO), a lower bound on the log marginal likelihood of the observations. The first method, Laplace-EM, employs the expectation maximization algorithm to maximize the ELBO, with a Laplace approximation of the posterior on the E-step, and minimization of a Kullback-Leibler divergence on the M-step. The second method, DSVI-EB, employs the doubly stochastic variational inference (DSVI) algorithm, in which the ELBO is maximized via gradient-based stochastic optimization, with nosiy gradients computed via simple Monte Carlo sampling and Gaussian backpropagation. We apply these methods to identifying diffusion coefficients in linear and nonlinear diffusion equations, and we find that both methods provide accurate estimates of posterior densities and the hyperparameters of Gaussian priors. While the Laplace-EM method is more accurate, it requires computing Hessians of the physics model. The DSVI-EB method is found to be less accurate but only requires gradients of the physics model.

approximate Bayesian inference, model inversion, v↗

FOURIER ANALYSIS OF BLAZAR VARIABILITY: KLEIN–NISHINA EFFECTS AND THE JET SCATTERING ENVIRONMENT

The strong variability of blazars can be characterized by power spectral densities (PSDs) and Fourier frequency-dependent time lags. In previous work, we created a new theoretical formalism for describing the PSDs and time lags produced via a combination of stochastic particle injection and emission via the synchrotron, synchrotron self-Compton, and external Compton (EC) processes. This formalism used the Thomson cross section and simple δ-function approximations to model the synchrotron and Compton emissivities. Here we expand upon this work, using the full Compton cross section and detailed and accurate emissivities. Our results indicate good agreement between the PSDs computed using the δ-function approximations and those computed using the accurate expressions, provided the observed photons are produced primarily by electrons with energies exceeding the lower limit of the injected particle population. Breaks are found in the PSDs at frequencies corresponding to the cooling timescales of the electrons primarily responsible for the observed emission, and the associated time lags are related to the difference in electron cooling timescales between the two energy channels, as expected. If the electron cooling timescales can be determined from the observed time lags and/or the observed EC PSDs, then one could in principle use the method developed here to determine the energy of the external seed photon source for EC, which is an important unsolved problem in blazar physics.

79 ASTRONOMY AND ASTROPHYSICS↗

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10 different input distributions or histograms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uncertainty Quantification via Random Domain Decomposition and Probabilistic Collocation on Sparse Grids

Due to lack of knowledge or insufficient data, many physical systems are subject to uncertainty. Such uncertainty occurs on a multiplicity of scales. In this study, we conduct the uncertainty analysis of diffusion in random composites with two dominant scales of uncertainty: Large-scale uncertainty in the spatial arrangement of materials and small-scale uncertainty in the parameters within each material. A general two-scale framework that combines random domain decomposition (RDD) and probabilistic collocation method (PCM) on sparse grids to quantify the large and small scales of uncertainty, respectively. Using sparse grid points instead of standard grids based on full tensor products for both the large and small scales of uncertainty can greatly reduce the overall computational cost, especially for random process with small correlation length (large number of random dimensions). For one-dimensional random contact point problem and random inclusion problem, analytical solution and Monte Carlo simulations have been conducted respectively to verify the accuracy of the combined RDD-PCM approach. Additionally, we employed our combined RDD-PCM approach to two- and three-dimensional examples to demonstrate that our combined RDD-PCM approach provides efficient, robust and nonintrusive approximations for the statistics of diffusion in random composites.

97 MATHEMATICS AND COMPUTING↗

A statistical mechanics framework for polymer chain scission, based on the concepts of distorted bond potential and asymptotic matching

To design increasingly tough, resilient, and fatigue-resistant elastomers and hydrogels, the relationship between controllable network parameters at the molecular level (bond type, non-uniform chain length, entanglement density, etc.) to macroscopic quantities that govern damage and failure must be established. Many of the most successful constitutive models for elastomers have been rooted in statistical mechanical treatments of polymer chains. Typically, such constitutive models have used variants of the freely jointed chain model with rigid links. However, since the free energy state of a polymer chain is dominated by enthalpic bond distortion effects as the chain approaches its rupture point, bond extensibility ought to be accounted for if the model is intended to capture chain rupture. To that end, a new bond potential is supplemented to the freely jointed chain model (as derived in the u FJC framework of Buche and Silberstein (2021) and Buche et al. (2022)), which we have extended to yield a tractable, closed-form model of single chain behavior that should be amenable to continuum-level constitutive model development. Inspired by the asymptotically matched u FJC model response in both the low/intermediate chain force and high chain force regimes, a simple, quasi-polynomial bond potential energy function is derived. This bond potential exhibits harmonic behavior near the equilibrium state and anharmonic behavior for large bond stretches tending to a characteristic energy plateau (akin to the Lennard-Jones and Morse bond potentials). Using this bond potential, approximate yet highly-accurate analytical functions for bond stretch and chain force dependent upon chain stretch are established. Then, using this polymer chain model, a stochastic thermal fluctuation-driven chain rupture framework is developed. This framework is based upon a force-modified tilted bond potential that accounts for distortional bond potential energy, allowing for the derivation and subsequent calculation of the dissipated chain scission energy. Here, the cases of rate-dependent and rate-independent scission are accounted for throughout the rupture framework. The impact of Kuhn segment number on chain rupture behavior is also investigated. The model is fit to single chain mechanical response data collected from atomic force microscopy tensile tests for validation and to glean deeper insight into the molecular physics taking place. Due to their analytical nature, this polymer chain model and the associated rupture framework can in the future be implemented in finite element models accounting for fracture and fatigue in polydisperse elastomer networks.

36 MATERIALS SCIENCE↗

Vertex renormalization, regularization and inhomogeneous flows

We describe a propagator renormalized, non-Markovian closure for inhomogeneous turbulent flows with particular emphasis on the role of the bare vertex terms. We outline a regularization procedure as an approximation to a formal vertex renormalization and comment on numerical and analytic investigations to higher order corrections.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms

A key component of variational quantum algorithms (VQAs) is the choice of classical optimizer employed to update the parameterization of an ansatz. It is well recognized that quantum algorithms will, for the foreseeable future, necessarily be run on noisy devices with limited fidelities. Thus, the evaluation of an objective function (e.g., the guiding function in the quantum approximate optimization algorithm (QAOA) or the expectation of the electronic Hamiltonian in variational quantum eigensolver (VQE)) required by a classical optimizer is subject not only to stochastic error from estimating an expected value but also to error resulting from intermittent hardware noise. Model-based derivative-free optimization methods have emerged as popular choices of a classical optimizer in the noisy VQA setting, based on empirical studies. However, these optimization methods were not explicitly designed with the consideration of noise. In this work we adapt recent developments from the “noise-aware numerical optimization” literature to these commonly used derivative-free model-based methods. We introduce the key defining characteristics of these novel noise-aware derivative-free model-based methods that separate them from standard model-based methods. In conclusion, we study an implementation of such noise-aware derivative-free model-based methods and compare its performance on demonstrative VQA simulations to classical solvers packaged in scikit-quant.

classical optimizers↗

Neutrino-driven Winds in Three-dimensional Core-collapse Supernova Simulations

Abstract In this paper, we analyze the neutrino-driven winds that emerge in 12 unprecedentedly long-duration 3D core-collapse supernova simulations done using the code F ornax . The 12 models cover progenitors with zero-age main-sequence mass between 9 and 60 solar masses. In all our models, we see transonic outflows that are at least 2 times as fast as the surrounding ejecta and that originate generically from a proto−neutron star surface atmosphere that is turbulent and rotating. We find that winds are common features of 3D simulations, even if there is anisotropic early infall. We find that the basic dynamical properties of 3D winds behave qualitatively similarly to those inferred in the past using simpler 1D models, but that the shape of the emergent wind can be deformed, very aspherical, and channeled by its environment. The thermal properties of winds for less massive progenitors very approximately recapitulate the 1D stationary solutions, while for more massive progenitors they deviate significantly owing to aspherical accretion. The Y e temporal evolution in winds is stochastic, and there can be some neutron-rich phases. Though no strong r -process is seen in any model, a weak r -process can be produced, and isotopes up to 90 Zr are synthesized in some models. Finally, we find that there is at most a few percent of a solar mass in the integrated wind component, while the energy carried by the wind itself can be as much as 10%–20% of the total explosion energy.

79 ASTRONOMY AND ASTROPHYSICS↗

Model reduction methods for population dynamics with fast-switching environments: Reduced master equations, stochastic differential equations, and applications

Here we study stochastic population dynamics coupled to fast external environments and combine expansions in the inverse switching rate of the environment and a Kramers–Moyal expansion in the inverse size of the population. This leads to a series of approximation schemes, capturing both intrinsic and environmental noise. These methods provide a means of efficient simulation and we show how they can be used to obtain analytical results for the fluctuations of population dynamics in switching environments. We place the approximations in relation to existing work on piecewise-deterministic and piecewise-diffusive Markov processes. Finally, we demonstrate the accuracy and efficiency of these model-reduction methods in different research fields, including systems in biology and a model of crack propagation.

59 BASIC BIOLOGICAL SCIENCES↗

Variational Bayesian strategies for high-dimensional, stochastic design problems

This paper is concerned with a lesser-studied problem in the context of model-based, uncertainty quantification (UQ), that of optimization/design/control under uncertainty. The solution of such problems is hindered not only by the usual difficulties encountered in UQ tasks (e.g. the high computational cost of each forward simulation, the large number of random variables) but also by the need to solve a nonlinear optimization problem involving large numbers of design variables and potentially constraints. We propose a framework that is suitable for a class of such problems and is based on the idea of recasting them as probabilistic inference tasks. To that end, we propose a Variational Bayesian (VB) formulation and an iterative VB–Expectation-Maximization scheme that is capable of identifying a local maximum as well as a low-dimensional set of directions in the design space, along which, the objective exhibits the largest sensitivity. We demonstrate the validity of the proposed approach in the context of two numerical examples involving thousands of random and design variables. In all cases considered the cost of the computations in terms of calls to the forward model was of the order of 100 or less. The accuracy of the approximations provided is assessed by information-theoretic metrics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A semi-intrusive deterministic approach to uncertainty quantification in non-linear fluid flow problems

This paper deals with the formulation of a semi-intrusive (SI) method allowing the computation of statistics of linear and non linear PDEs solutions. This method shows to be very efficient to deal with probability density function of whatsoever form, long-term integration and discontinuities in stochastic space. Given a stochastic PDE where randomness is defined on Ω, starting from (i) a description of the solution in term of a space variables, (ii) a numerical scheme defined for any event ω∈Ω and (iii) a (family) of random variables that may be correlated, the solution is numerically described by its conditional expectancies of point values or cell averages and its evaluation constructed from the deterministic scheme. One of the tools is a tessellation of the random space as in finite volume methods for the space variables. Then, using these conditional expectancies and the geometrical description of the tessellation, a piecewise polynomial approximation in the random variables is computed using a reconstruction method that is standard for high order finite volume space, except that the measure is no longer the standard Lebesgue measure but the probability measure. This reconstruction is then used to formulate a scheme on the numerical approximation of the solution from the deterministic scheme. This new approach is said semi-intrusive because it requires only a limited amount of modification in a deterministic solver to quantify uncertainty on the state when the solver includes uncertain variables. The effectiveness of this method is illustrated for a modified version of Kraichnan–Orszag three-mode problem where a discontinuous pdf is associated to the stochastic variable, and for a nozzle flow with shocks. The results have been analyzed in terms of accuracy and probability measure flexibility. Finally, the importance of the probabilistic reconstruction in the stochastic space is shown up on an example where the exact solution is computable, the viscous Burgers equation.

97 MATHEMATICS AND COMPUTING↗

Connecting the dots: Semi-analytical and random walk numerical solutions of the diffusion–reaction equation with stochastic initial conditions

We study a system with bimolecular irreversible kinetic reaction A+B→∅ where the underlying transport of reactants is governed by diffusion, and the local reaction term is given by the law of mass action. We consider the case where the initial concentrations are given in terms of an average and a white noise perturbation. Our goal is to solve the diffusion–reaction equation which governs the system, and we tackle it with both analytical and numerical approaches. To obtain an analytical solution, we develop the equations of moments and solve them approximately. To obtain a numerical solution, we develop a grid-less Monte Carlo particle tracking approach, where diffusion is modeled by a random walk of the particles, and reaction is modeled by annihilation of particles. The probability of annihilation is derived analytically from the particles' co-location probability. We rigorously derive the relationship between the initial number of particles in the system and the amplitude of white noise represented by that number. This enables us to compare the particle simulations and the approximate analytical solution and offer an explanation of the late time discrepancies. - Graphical abstract:.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

Portfolio methods support the combination of different algorithms and heuristics, including stochastic local search (SLS) heuristics, and have been identified as a promising approach to solve computationally hard problems. While successful in experiments, theoretical foundations and analytical results for portfolio-based SLS heuristics are less developed. This article aims to improve the understanding of the role of portfolios of heuristics in SLS. We emphasize the problem of computing most probable explanations (MPEs) in Bayesian networks (BNs). Algorithmically, we discuss a portfolio-based SLS algorithm for MPE computation, Stochastic Greedy Search (SGS). SGS supports the integration of different initialization operators (or initialization heuristics) and different search operators (greedy and noisy heuristics), thereby enabling new analytical and experimental results. Analytically, we introduce a novel Markov chain model tailored to portfolio-based SLS algorithms including SGS, thereby enabling us to analytically form expected hitting time results that explain empirical run time results. For a specific BN, we show the benefit of using a homogenous initialization portfolio. To further illustrate the portfolio approach, we consider novel additive search heuristics for handling determinism in the form of zero entries in conditional probability tables in BNs. Our additive approach adds rather than multiplies probabilities when computing the utility of an explanation. We motivate the additive measure by studying the dramatic impact of zero entries in conditional probability tables on the number of zero-probability explanations, which again complicates the search process. We consider the relationship between MAXSAT and MPE, and show that additive utility (or gain) is a generalization, to the probabilistic setting, of MAXSAT utility (or gain) used in the celebrated GSAT and WalkSAT algorithms and their descendants. Utilizing our Markov chain framework, we show that expected hitting time is a rational function - i.e. a ratio of two polynomials - of the probability of applying an additive search operator. Experimentally, we report on synthetically generated BNs as well as BNs from applications, and compare SGSs performance to that of Hugin, which performs BN inference by compilation to and propagation in clique trees. On synthetic networks, SGS speeds up computation by approximately two orders of magnitude compared to Hugin. In application networks, our approach is highly competitive in Bayesian networks with a high degree of determinism. In addition to showing that stochastic local search can be competitive with clique tree clustering, our empirical results provide an improved understanding of the circumstances under which portfolio-based SLS outperforms clique tree clustering and vice versa.

Mengshoel, Ole J.↗