Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic methods”

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 145 records · Page 8

Post-hoc reweighting of hadron production in the Lund string model

We present a method for reweighting flavor selection in the Lund string fragmentation model. This is the process of calculating and applying event weights enabling fast and exact variation of hadronization parameters on pre-generated event samples. The procedure is post hoc, requiring only a small amount of additional information stored per event, and allowing for efficient estimation of hadronization uncertainties without repeated simulation. Weight expressions are derived from the hadronization algorithm itself, and validated against direct simulation for a wide range of observables and parameter shifts. The hadronization algorithm can be viewed as a hierarchical Markov process with stochastic rejections, a structure common to many complex simulations outside of high-energy physics. This perspective makes the method modular, extensible, and potentially transferable to other domains. We demonstrate the approach in Pythia, including both coverage considerations and timing benefits. For the purpose of this paper, our goal is to develop and demonstrate the the formalism, and we therefore exclude several model variations for baryon production (popcorn model, junction production) needed for proton collisions. These will be the topic of a future paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Transient anisotropic kernel for probabilistic learning on manifolds

PLoM (Probabilistic Learning on Manifolds) is a method introduced in 2016 for handling small training datasets by projecting an Itô equation from a stochastic dissipative Hamiltonian dynamical system, acting as the MCMC generator, for which the KDE-estimated probability measure with the training dataset is the invariant measure. PLoM performs a projection on a reduced-order vector basis related to the training dataset, using the diffusion maps (DMAPS) basis constructed with a time-independent isotropic kernel. In this paper, we propose a new ISDE projection vector basis built from a transient anisotropic kernel, providing an alternative to the DMAPS basis to improve statistical surrogates for stochastic manifolds with heterogeneous data. The construction ensures that for times near the initial time, the DMAPS basis coincides with the transient basis. For larger times, the differences between the two bases are characterized by the angle of their spanned vector subspaces. The optimal instant yielding the optimal transient basis is determined using an estimation of mutual information from Information Theory, which is normalized by the entropy estimation to account for the effects of the number of realizations used in the estimations. Consequently, this new vector basis better represents statistical dependencies in the learned probability measure for any dimension. Three applications with varying levels of statistical complexity and data heterogeneity validate the proposed theory, showing that the transient anisotropic kernel improves the learned probability measure.

Diffusion maps↗

Effect of pattern transfer process on roughness of block copolymer patterns from directed self-assembly

Block copolymer-directed self-assembly (DSA) remains promising for improving pattern quality and reducing the stochastic variations that challenge high numerical aperture extreme ultraviolet lithography. Equally critical is refining pattern transfer methods for accurately transferring the rectified DSA features to the underlying substrate. We compare two atomic layer deposition (ALD)-based techniques: sequential infiltration synthesis (SIS) and dry liftoff, applied to polystyrene-block-poly(methyl methacrylate) (PS-b-PMMA) DSA patterns. Both methods utilize aluminum oxide hard masks, with one synthesized through infiltration into the PMMA domains and the other through conformal ALD coating. High-resolution scanning electron micrographs were analyzed to measure line edge, width, and placement roughness for both the line (PMMA) and space (PS) features. Although both methods yielded similar overall 3σ rms roughness, they differed significantly in the frequency-dependent power spectral density (PSD) profiles. SIS reduced line placement roughness at length scales associated with the polymer pitch, but increased space width roughness at low frequencies, whereas dry liftoff mimicked the frequency content of the original guiding pattern. This study underscores the importance of PSD evaluation in selecting optimal pattern transfer strategies for specific applications.

Block copolymers↗

Stellar Mass Calibrations for Local Low-mass Galaxies

The stellar masses of galaxies are measured from integrated light via several methods—however, few of these methods were designed for low-mass (M ⋆ ≲ 10 8 M ⊙ ) “dwarf” galaxies, whose properties (e.g., stochastic star formation, low metallicity) pose unique challenges for estimating stellar masses. In this work, we quantify the precision and accuracy at which stellar masses of low-mass galaxies can be recovered using UV/optical/IR photometry. We use mock observations of 469 low-mass galaxies from a variety of models, including both semi-empirical models (GRUMPY and UniverseMachine-SAGA) and cosmological baryonic zoom-in simulations (MARVELous Dwarfs and FIRE-2), to test literature color–M ⋆ /L relations and multiwavelength spectral energy distribution (SED) mass estimators. We identify a list of “best practices” for measuring stellar masses of low-mass galaxies from integrated photometry. We find that literature color–M ⋆ /L relations are often unable to capture the bursty star formation histories (SFHs) of low-mass galaxies, and we develop an updated prescription for stellar mass based on g − r color that is better able to recover stellar masses for the bursty low-mass galaxies in our sample (with ∼0.1 dex precision). SED fitting can also precisely recover stellar masses of low-mass galaxies, but this requires thoughtful choices about the form of the assumed SFH: Parametric SFHs can underestimate stellar mass by as much as ∼0.4 dex, while nonparametric SFHs recover true stellar masses with insignificant offset (−0.03 ± 0.11 dex). Finally, we also caution that noninformative (wide) dust attenuation priors may introduce M ⋆ uncertainties of up to ∼0.6 dex.

de los Reyes, Mithi A. C. [Amherst College, MA (Un↗

Nonadiabatic Force Matching for Alchemical Free-Energy Estimation

We propose a method to compute free-energy differences from nonadiabatic alchemical transformations by using flow-based generative models. The method, nonadiabatic force matching, hinges on estimating the dissipation along an alchemical switching process in terms of a nonadiabatic force field that can be learned through stochastic flow matching. The learned field can be used in conjunction with short-time trajectory data to evaluate upper and lower bounds on the alchemical free energy that variationally converge to the exact value if the field is optimal. Applying the method to evaluate the alchemical free energy of atomistic models shows that it can substantially reduce the simulation cost of a free-energy estimate at a negligible loss of accuracy when compared with thermodynamic integration.

Computational chemistry↗

Numerical analysis of a time discretized method for nonlinear filtering problem with Lévy process observations

Abstract In this paper, we consider a nonlinear filtering model with observations driven by correlated Wiener processes and point processes. We first derive a Zakai equation whose solution is an unnormalized probability density function of the filter solution. Then, we apply a splitting-up technique to decompose the Zakai equation into three stochastic differential equations, based on which we construct a splitting-up approximate solution and prove its half-order convergence. Furthermore, we apply a finite difference method to construct a time semi-discrete approximate solution to the splitting-up system and prove its half-order convergence to the exact solution of the Zakai equation. Finally, we present some numerical experiments to demonstrate the theoretical analysis.

Mathematics↗

Wake-Resolving Acoustic Tomography: Advances through Numerical Covariance Methods

Acoustic tomography offers path-integrated measurements of atmospheric velocity and temperature fluctuations with high spatial resolution. Classical implementations of time-dependent stochastic inversion rely on homogeneous, isotropic covariance models that are poorly suited to the anisotropic structure of wind turbine wakes. By directly estimating heterogeneous covariances from large-eddy simulations (LESs) into the time-dependent stochastic inversion operator, we relax implicit assumptions in the analytical models used historically. Retrievals using these LES-informed models improve agreement with true fields in variance, turbulent kinetic energy, and spectral content compared to analytical and precursor-based covariance models. The results indicate that LES-informed covariance models can enhance the accuracy of acoustic tomography retrievals in complex, anisotropic flows such as wind turbine wakes in some cases and highlight instances where analytical models still offer competitive performance, despite their simplifying assumptions.

17 WIND ENERGY↗

Evaluation of Seismic Artificial Intelligence with Uncertainty

Artificial intelligence has transformed the seismic community with deep learning models (DLMs) that are trained to complete specific tasks within workflows. However, there is still a lack of robust evaluation frameworks for evaluating and comparing DLMs. Here, we address this gap by designing an evaluation framework that jointly incorporates two crucial aspects: performance uncertainty and learning efficiency. To target these aspects, we meticulously construct the training, validation, and test splits using a clustering method tailored to seismic data and enact an expansive training design to segregate performance uncertainty arising from stochastic training processes and random data sampling. The framework’s ability to guard against misleading declarations of model superiority is demonstrated through the evaluation of PhaseNet (Zhu and Beroza, 2018), a popular seismic phase picking DLM, under three training approaches. Our framework helps practitioners choose the best model for their problem and set performance expectations by explicitly analyzing model performance with uncertainty at varying budgets of training data.

58 GEOSCIENCES↗

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗

FEDERATED LEARNING ON STOCHASTIC NEURAL NETWORKS

Federated learning is a machine learning paradigm that leverages edge computing on client devices to optimize models while maintaining user privacy by ensuring that local data remain on the device. However, since all data are collected by clients, federated learning is susceptible to latent noise in local datasets. Factors such as limited measurement capabilities or human errors may introduce inaccuracies in client data. To address this challenge, we propose the use of a stochastic neural network as the local model within the federated learning framework. Stochastic neural networks not only facilitate the estimation of the true underlying states of the data but also enable the quantification of latent noise. We refer to our federated learning approach, which incorporates stochastic neural networks as local models, as federated stochastic neural networks. In this work we will present numerical experiments demonstrating the performance and effectiveness of our method, particularly in handling nonindependent and identically distributed data.

97 MATHEMATICS AND COMPUTING↗

Voltage Probability Density Function Shaping Control Strategy Considering Grid Operational Uncertainties

It is well-known that power systems operation always affected by various uncertainties which make the bus voltage a random process that can be characterized by its probability density function (PDF) at any time instant. In this context, this paper presents a novel PDF-based voltage control framework for power systems. By modeling voltage as a stochastic process, we formulate a stochastic differential equationthat captures grid uncertainties. The associated Fokker-Planck-Kolmogorov equation is derived to describe the evolution of the voltage PDF, which enables the formulation of a PDF-shaping control strategy. To simplify the PDF control formulation, a B-spline neural network is introduced for real-time estimation and regulation of the voltage distribution. The proposed PDF control law updates voltage references for energy storage systems and synchronous generators using real-time PDF measurements and feedback signals. The proposed method is validated on a modified Kundur’s two-area system. Simulation results demonstrate that the controller can significantly improve the voltage stability under stochastic conditions, highlighting its effectiveness in modern inverter-rich grids.

Gui, Yonghao [ORNL] (ORCID:0000000250435534)↗

Machine learning approach for vibronically renormalized electronic band structures

Here, we present a machine learning (ML) method for efficient computation of vibrational thermal expectation values of physical properties from first principles. Our approach is based on the nonperturbative frozen phonon formulation in which stochastic Monte Carlo algorithm is employed to sample configurations of nuclei in a supercell at finite temperatures based on a first-principles phonon model. A deep-learning neural network is trained to accurately predict physical properties associated with sampled phonon configurations, thus bypassing the time-consuming ab initio calculations. To incorporate the point-group symmetry of the electronic system into the ML model, group-theoretical methods are used to develop a symmetry-invariant descriptor for phonon configurations in the supercell. We apply our ML approach to compute the temperature dependent electronic energy gap of silicon based on density functional theory (DFT). We show that, with less than a hundred DFT calculations for training the neural network model, an order of magnitude larger number of sampling can be achieved for the computation of the vibrational thermal expectation values. Our work highlights the promising potential of ML techniques for finite temperature first-principles electronic structure methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Resimulation-based self-supervised learning for pretraining physics foundation models

Self-supervised learning (SSL) is at the core of training modern large machine learning models, providing a scheme for learning powerful representations that can be used in a variety of downstream tasks. However, SSL strategies must be adapted to the type of training data and downstream tasks required. We propose resimulation-based self-supervised representation learning (RS3L), a novel simulation-based SSL strategy that employs a method of resimulation to drive data augmentation for contrastive learning in the physical sciences, particularly, in fields that rely on stochastic simulators. By intervening in the middle of the simulation process and rerunning simulation components downstream of the intervention, we generate multiple realizations of an event, thus producing a set of augmentations covering all physics-driven variations available in the simulator. Using experiments from high-energy physics, we explore how this strategy may enable the development of a foundation model; we show how RS3L pretraining enables powerful performance in downstream tasks such as discrimination of a variety of objects and uncertainty mitigation. In addition to our results, we make the RS3L dataset publicly available for further studies on how to improve SSL strategies.

97 MATHEMATICS AND COMPUTING↗

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

Hydrodynamic fluctuations near a Hopf bifurcation: Stochastic onset of vortex shedding behind a circular cylinder

Here, we investigate hydrodynamic fluctuations in the flow past a circular cylinder near the critical Reynolds number Re c for the onset of vortex shedding. Starting from the fluctuating Navier-Stokes equations, we perform a perturbation expansion around Re c to derive analytical expressions for the statistics of the fluctuating lift force. Molecular-level simulations using the direct simulation Monte Carlo method support the theoretical predictions of the lift power spectrum and amplitude distribution. Notably, we have been able to collect sufficient statistics at distances Re ⁡/ Re c – 1 = O ⁡(10 –3 ) from the instability that confirm the appearance of non-Gaussian fluctuations, and we observe that they are associated with intermittent vortex shedding. These results emphasize how unavoidable thermal-noise-induced fluctuations become dramatically amplified in the vicinity of oscillatory flow instabilities and that their onset is fundamentally stochastic.

42 ENGINEERING↗

Thermodynamic consistency and fluctuations in mesoscopic stochastic simulations of reactive gas mixtures

It is essential that mesoscopic simulations of reactive systems reproduce the correct statistical distributions at thermodynamic equilibrium. By considering a compressible fluctuating hydrodynamics (FHD) simulation method of ideal gas mixtures undergoing reversible reactions described by the chemical Langevin equations, we show that thermodynamic consistency in reaction rates and the use of instantaneous temperatures for the evaluation of reaction rates is required for fluctuations for the overall system to be correct. We then formulate the required properties of a thermodynamically consistent reaction (TCR) model. As noted in the literature, while reactions are often discussed in terms of forward and reverse rates, these rates should not be modeled independently because they must be compatible with thermodynamic equilibrium for the system. Using a simple TCR model where each chemical species has constant heat capacity, we derive the explicit condition that the forward and reverse reaction rate constants must satisfy in order for the system to be thermodynamically consistent. We perform equilibrium and non-equilibrium simulations of ideal gas mixtures undergoing a reversible dimerization reaction to measure the fluctuational behavior of the system numerically. We confirm that FHD simulations with the TCR model give the correct static structure factor of equilibrium fluctuations. For the statistically steady simulation of a gas mixture between two isothermal walls with different temperatures, we show using the TCR model that the temperature variance agrees with the corresponding thermodynamic-equilibrium temperature variance in the interior of the system, whereas noticeable deviations are present in regions near walls, where chemistry is far from equilibrium.

Polimeno, Matteo [University of California, Merced↗

Improving statistical precision in Monte Carlo samples with negative weights via reweighting and uncertainty quantification

High statistical precision is critical for Monte Carlo (MC) samples in high energy physics and is degraded by negatively weighted events. This paper investigates a procedure to learn the relationship between the negative and positive weight distributions of any sample, allowing the reduction of statistical uncertainty by reweighting kinematically equivalent events with the same sign. A robust uncertainty quantification method is required for the practical application of such method. Two methods for the estimation of the reweighting uncertainty are developed: one at the event and another one at the final observable level. The latter method is strongly favored. The gains in statistical precision are then quantified. The method is demonstrated on Sherpa vector boson plus jets samples when using all generated events and when restricted to the signal region of a mock analysis. It is demonstrated to significantly reduce stochastic behavior in sparse MC samples while decreasing the overall uncertainty with a sufficiently well-known reweighting function.

Monte Carlo methods↗