Search NASA⌕ Search

SEARCH · Search NASA

Results for “Monte Carlo ensemble 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 37 records · Page 2

Scalable Risk Assessment of Rare Events in Power Systems With Uncertain Wind Generation and Loads

Risk assessment of rare events has become increasingly important in power system planning and operation with the increasing integration of renewable energy and the presence of system uncertainties. However, quantifying the risk posed by rare events via the traditional method, i.e., Monte Carlo sampling (MCS), incurs substantial computational expense stemming from the vast ensemble of power flow simulations. To accelerate the assessment, this paper proposes a Deep Neural Network (DNN)-kernelized vector-valued Gaussian Process (VVGP) approach with excellent computational efficiency while maintaining high accuracy. Consequently, serving as a surrogate model for the power flow solver, the DNN-kernelized VVGP enables significantly faster but accurate risk assessment compared to the power flow solver. The developed surrogate model evaluates low-order N - k events that contain more than 90% instances by adeptly capturing the topological features while the high-order N - k events are assessed via a power flow solver, thereby striking a balance between computational efficiency and uncertainty quantification accuracy. Moreover, the model incorporates a Support Vector Machine (SVM) classifier to resample concerning low-probability tail events to counteract the biases potentially introduced during the DNN-kernelized VVGP evaluations. Simulations conducted on the modified IEEE 24-bus, 118-bus, and European 1354-bus systems demonstrate that the proposed method maintains the accuracy benchmark set by MCS while significantly reducing computational demands in large-scale power systems as compared to other state-of-the-art methods.

17 WIND ENERGY↗

Multilevel Monte Carlo methods for the Grad-Shafranov free boundary problem

The equilibrium configuration of a plasma in an axially symmetric reactor is described mathematically by a free boundary problem associated with the celebrated Grad-Shafranov equation. The presence of uncertainty in the model parameters introduces the need to quantify the variability in the predictions. This is often done by computing a large number of model solutions on a computational grid for an ensemble of parameter values and then obtaining estimates for the statistical properties of solutions. In this study, we explore the savings that can be obtained using multilevel Monte Carlo methods, which reduce costs by performing the bulk of the computations on a sequence of spatial grids that are coarser than the one that would typically be used for a simple Monte Carlo simulation. We examine this approach using both a set of uniformly refined grids and a set of adaptively refined grids guided by a discrete error estimator. Numerical experiments show that multilevel methods dramatically reduce the cost of simulation, with cost reductions typically on the order of 60 or more and possibly as large as 200. Furthermore, adaptive griding results in more accurate computation of geometric quantities such as x-points associated with the model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Boundary-induced classical generalized Gibbs ensemble with angular momentum

We investigate how confinement geometry leads to the emergence of a Generalized Gibbs Ensemble (GGE) in classical systems. Unlike the standard Gibbs ensemble, the GGE includes additional conserved quantities, such as angular momentum, that arise from boundary-induced symmetries. Using analytical arguments based on the maximum entropy principle, we show that circular boundaries preserve angular momentum and drive the system toward a chiral, non-ergodic GGE that violates time-reversal symmetry. This ensemble differs fundamentally from the Gibbs case, producing near-boundary condensation and revealing how geometry alone can alter thermal equilibration. To quantify these effects, we introduce an order parameter measuring deviations from Gibbs behavior and demonstrate that conventional Monte Carlo methods must incorporate angular momentum conservation under such conditions. Our study highlights how geometric constraints shape non-equilibrium statistical ensembles and lead to subtle departures from the Bohr-van Leeuwen theorem. These predictions are validated through detailed simulations of confined classical hard-disk gases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GenAI4UQ: A software for forward and inverse uncertainty quantification using conditional generative AI

We introduce GenAI4UQ, a software package for forward and inverse uncertainty quantification in model calibration, parameter estimation, and ensemble forecasting. GenAI4UQ leverages a generative AI-based conditional modeling framework to address limitations of traditional inverse modeling techniques, such as Markov Chain Monte Carlo (MCMC) methods. By replacing computationally intensive iterative processes with a direct, learned mapping, GenAI4UQ enables efficient calibration of input parameters and generation of predictions directly from observations. The software supports rapid ensemble forecasting with robust uncertainty quantification while maintaining computational and storage efficiency. Built-in auto-tuning of hyperparameters simplifies model training, ensuring accessibility for users with varying expertise. Its versatile conditional generative framework is applicable across diverse scientific domains. While GenAI4UQ offers significant advantages in flexibility and efficiency, users should interpret its uncertainty estimates with caution in data-sparse scenarios, as the model may overestimate uncertainty—an effect common to all surrogate-based approaches including MCMC with surrogate models. Despite this, GenAI4UQ transforms inverse modeling by providing a fast, reliable, and user-friendly solution. It empowers researchers and practitioners to quickly estimate parameter distributions and generate model predictions for new observations, facilitating efficient decision-making and advancing the state of uncertainty quantification in computational modeling.

97 MATHEMATICS AND COMPUTING↗

Representing Socio‐Economic Uncertainty in Human System Models

Abstract Socio‐economic development pathways and their implications for the environment are highly uncertain, and energy transitions will involve complex interactions among sectors. Here, traditional Monte Carlo analysis is paired with scenario discovery techniques to provide a richer portrait of these complexities. Modeled uncertain input variables include costs of advanced energy technologies, energy efficiency trends, fossil fuel resource availability, elasticities of substitution for labor, capital, and energy across economic sectors, population growth, and labor and capital productivity. The sampled values are simulated through a multi‐sector, multi‐region, recursively dynamic model of the world economy to explore a range of possible future outcomes. We find that many patterns of energy and technology development are possible for various long‐term environmental pathways and that sectoral output for most sectors is little affected through 2050 by the long‐term temperature target, but with tight constraints on emissions, emission intensities must fall much more rapidly. Scenario discovery techniques are applied to the large uncertainty ensembles to explore if there are prevailing storylines behind outcomes of interest. An illustrative investigation focused on different levels of economic growth shows many combinations of pathways and no single storyline emerging for a given economic outcome. This method can be extended to other outcomes of interest, exploring the nature of scenarios with both tail and median outcomes. Sampling from a Monte Carlo generated ensemble provides a rich set of scenarios to investigate, and potentially aids in avoiding heuristic biases in less structured scenario approaches.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Scalable Quantum Monte Carlo Method for Polariton Chemistry via Mixed Block Sparsity and Tensor Hypercontraction Method

We present a reduced-scaling auxiliary-field quantum Monte Carlo (AFQMC) framework designed for large molecular systems and ensembles, with or without coupling to optical cavities. Our approach leverages the natural block sparsity of the Cholesky decomposition (CD) of electron repulsion integrals in molecular ensembles and employs tensor hypercontraction (THC) to efficiently compress low-rank Cholesky blocks. By representing the Cholesky vectors in a mixed format, keeping high-rank blocks in block-sparse form and compressing low-rank blocks with THC, we reduce the scaling of exchange-energy evaluation from quartic to robust cubic in the number of molecular orbitals N, while lowering memory from cubic toward quadratic. Benchmark analyses on one-, two-, and three-dimensional molecular ensembles (up to ∼1,200 orbitals) show that (a) the number of nonzeros in Cholesky tensors grows linearly with system size across dimensions; (b) the average numerical rank increases sublinearly and does not saturate at these sizes; and (c) rank heterogeneity─some blocks nearly full rank and many low rank, naturally motivates the proposed mixed block sparsity and THC scheme for efficient calculation of exchange energy. In conclusion, we demonstrate that the mixed scheme yields cubic wall-time scaling with favorable prefactors and preserves AFQMC accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Unbinned extraction of $γ$ from $B\to DK$ with normalizing flows

We introduce an unbinned method for extracting the CKM angle $γ$ from the decay chain $B^\pm \to (D \to K_S π^+ π^-) K^\pm$ using normalizing flows (NFs). The NFs, trained on $D$ decay data, learn a faithful continuous representation of the amplitude and strong phase variation over the $D\to K_Sπ^+π^-$ Dalitz plot whose fidelity improves with increased data sample sizes. With this input, the $B$ decay data can be used to extract the parameters $r_B$, $δ_B$, and $γ$. We test the method on Monte Carlo generated data, where it successfully recovers the injected value of $γ$ within uncertainties. The present implementation propagates statistical uncertainties from finite training data via an ensemble of independently trained flows, and does not attempt to capture the effects of systematic experimental errors. We explore two versions of the method that differ in how the trigonometric constraint on phase variation is encoded, and comment on the possible extension to Bayesian NFs, which would provide direct uncertainty estimates on the learned densities without requiring ensemble training.

Grossman, Yuval [Cornell U., LEPP]↗

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimizers for stabilizing likelihood-free inference

A growing number of applications in particle physics and beyond use neural networks as unbinned likelihood ratio estimators applied to real or simulated data. Precision requirements on the inference tasks demand a high-level of stability from these networks, which are affected by the stochastic nature of training. We show how physics concepts can be used to stabilize network training through a physics-inspired optimizer. In particular, the energy conserving descent (ECD) optimization framework uses classical Hamiltonian dynamics on the space of network parameters to reduce the dependence on the initial conditions while also stabilizing the result near the minimum of the loss function. We develop a version of this optimizer known as , which has few free hyperparameters with limited ranges guided by physical reasoning. We apply to representative likelihood-ratio estimation tasks in particle physics and find on average that it out-performs the widely used Adam optimizer. We expect that ECD will be a useful tool for wide array of data-limited problems, where it is computationally expensive to exhaustively optimize hyperparameters and mitigate fluctuations with ensembling.

Monte Carlo methods↗

Realistic simulations of spin squeezing and cooperative coupling effects in large ensembles of interacting two-level systems

We describe an efficient numerical method for simulating the dynamics of interacting spin ensembles in the presence of dephasing and decay. The method builds on the discrete truncated Wigner approximation for isolated systems, which combines the mean-field dynamics of a spin ensemble with a Monte Carlo sampling of discrete initial spin values to account for quantum correlations. Here we show how this approach can be generalized for dissipative spin systems by replacing the deterministic mean-field evolution by a stochastic process, which describes the decay of coherences and populations while preserving the length of each spin. We demonstrate the application of this technique for simulating nonclassical spin-squeezing effects or the dynamics and steady states of cavity QED models with 10 5 interacting two-level systems. This opens up the possibility to perform accurate real-scale simulations of a diverse range of experiments in quantum optics or with solid-state spin ensembles under realistic laboratory conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗

Scalable Bayesian Physics-Informed Kolmogorov-Arnold Networks

Uncertainty quantification (UQ) plays a pivotal role in scientific machine learning, especially when surrogate models are used to approximate complex systems. Although multilayer perceptions (MLPs) are commonly employed as surrogates, they often suffer from overfitting due to their large number of parameters. Kolmogorov-Arnold networks (KANs) offer an alternative solution with fewer parameters. However, gradient-based inference methods, such as Hamiltonian Monte Carlo (HMC), may result in computational inefficiency when applied to KANs, especially for large-scale datasets, due to the high cost of back-propagation. To address these challenges, we propose a novel approach, combining the dropout Tikhonov ensemble Kalman inversion (DTEKI) with Chebyshev KANs. This gradient-free method effectively mitigates overfitting and enhances numerical stability. In addition, we incorporate the active subspace method to reduce the parameter-space dimensionality, allowing us to improve the accuracy of predictions and obtain more reliable uncertainty estimates. Extensive experiments demonstrate the efficacy of our approach in various test cases, including scenarios with large datasets and high noise levels. Our results show that the new method achieves comparable or better accuracy, much higher efficiency as well as stability compared to HMC, in addition to scalability. Moreover, by leveraging the low-dimensional parameter subspace, our method preserves prediction accuracy while substantially reducing further the computational cost.

97 MATHEMATICS AND COMPUTING↗

Monte Carlo Simulations of Crystal Defects in Open Ensembles

Zero- and two-dimensional crystal defects form in open statistical ensembles, such as the grand canonical, that are usually inaccessible with conventional simulation techniques. This longstanding challenge is overcome with a new Hamiltonian Monte Carlo method that samples energy-biased gradual transformations. In conclusion, the method enables free energy calculations for nonideal point defects and the direct prediction of finite-temperature interface structures.

Grain boundaries↗

Pooling Data Improves Multimodel IDF Estimates over Median-Based IDF Estimates: Analysis over the Susquehanna and Florida

Traditional multimodel methods for estimating future changes in precipitation intensity, duration, and frequency (IDF) curves rely on mean or median of models’ IDF estimates. Such multimodel estimates are impaired by large estimation uncertainty, shadowing their efficacy in planning efforts. Here, assuming that each climate model is one representation of the underlying data generating process, i.e., the Earth system, we propose a novel extension of current methods through pooling model data: (i) evaluate performance of climate models in simulating the spatial and temporal variability of the observed annual maximum precipitation (AMP), (ii) bias-correct and pool historical and future AMP data of reasonably performing models, and (iii) compute IDF estimates in a nonstationary framework from pooled historical and future model data. Pooling enhances fitting of the extreme value distribution to the data and assumes that data from reasonably performing models represent samples from the “true” underlying data generating distribution. Through Monte Carlo simulations with synthetic data, we show that return periods derived from pooled data have smaller biases and lesser uncertainty than those derived from ensembles of individual model data. We apply this method to NA-CORDEX models to estimate changes in 24-h precipitation intensity–frequency (PIF) estimates over the Susquehanna watershed and Florida peninsula. Our approach identifies significant future changes at more stations compared to median-based PIF estimates. The analysis suggests that almost all stations over the Susquehanna and at least two-thirds of the stations over the Florida peninsula will observe significant increases in 24-h precipitation for 2–100-yr return periods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advanced Multilevel Monte Carlo Methods

This article reviews the application of some advanced Monte Carlo techniques in the context of multilevel Monte Carlo (MLMC). MLMC is a strategy employed to compute expectations, which can be biassed in some sense, for instance, by using the discretization of an associated probability law. The MLMC approach works with a hierarchy of biassed approximations, which become progressively more accurate and more expensive. Additionally, using a telescoping representation of the most accurate approximation, the method is able to reduce the computational cost for a given level of error versus i.i.d. sampling from this latter approximation. All of these ideas originated for cases where exact sampling from couples in the hierarchy is possible. This article considers the case where such exact sampling is not currently possible. We consider some Markov chain Monte Carlo and sequential Monte Carlo methods, which have been introduced in the literature, and we describe different strategies that facilitate the application of MLMC within these methods.

97 MATHEMATICS AND COMPUTING↗

Multilevel Monte Carlo Predictions of First Passage Times in Three-Dimensional Discrete Fracture Networks: A Graph-Based Approach

In this paper, we present a method combining multilevel Monte Carlo (MLMC) and a graph-based primary subnetwork identification algorithm to provide estimates of the mean and variance of the distribution of first passage times in fracture media at significantly lower computational cost than standard Monte Carlo (MC) methods. Simulations of solute transport are performed using a discrete fracture network (DFN), and instead of using various grid resolutions for levels in the MLMC, which is standard practice in MLMC, we identify a hierarchy of subnetworks in the DFN based on the shortest topological paths through the network using a graph-based method. While the mean of these ensembles is of critical importance, the variance is also essential in fractured media where uncertainty is an overarching theme, and understanding variability across an ensemble is a requirement for safety assessments. The method provides good estimates of the mean and variance at two orders of magnitude lower computational cost than MC.

54 ENVIRONMENTAL SCIENCES↗

Understanding Differences in Water Adsorption Isotherms: Structural Variations, Force Fields, and Monte Carlo Simulation Approaches

Accurate prediction of water adsorption in micro- and mesoporous materials with hydrophobic pores is essential for the design and characterization of advanced adsorbent materials for separation and energy applications. Here, we assess the reproducibility and consistency of water adsorption isotherms in two microporous all-silica MFI zeolite structures (MFI-K and MFI-O) using two different zeolite force fields and three simulation approaches: grand canonical Monte Carlo (GCMC), Gibbs ensemble Monte Carlo (GEMC), and transition matrix Monte Carlo (TMMC). We demonstrate that consistent treatment of the bulk fluid phase in GCMC and TMMC simulations is critical for reconciling isotherms across methods, and we construct simulation-based equations of state for the TIP4P water model to enable rigorous fugacity-to-pressure conversions. Large shifts in the isotherms are observed for two zeolite force fields developed using different parametrization strategies, with the GCS force field representing implicitly a defect-containing all-silica zeolite, whereas the TraPPE-zeo force field accurately represents an essentially defect-free all-silica zeolite. While water in the van Koningsveld structure of MFI exhibits a first-order phase transition and condensation-like step for adsorption near room temperature, water in the Olson structure of MFI displays continuous adsorption, attributed to differences in the adsorption free energy landscapes. Structural analysis reveals that small geometric variations, particularly Si–O–Si bond angles near the strongest adsorption sites, lead to these substantial differences in adsorption behavior. Furthermore, our results highlight the sensitivity of simulated water adsorption isotherms in hydrophobic frameworks to seemingly small differences in the framework structures, force field parametrization, and simulation approaches.

36 MATERIALS SCIENCE↗

Continuous integration data-driven platform of industrial-scale subsurface storage for real-time analytics

This project helped address the growing need for efficient and scalable models to support geological carbon and energy storage, which are crucial for achieving net-zero emissions. Traditionally accurate high-fidelity numerical models have been used to simulate relevant storage processes under a handful of processes, however such models are computationally demanding, making uncertainty quantification impractical. Consequently, we first developed a machine learning framework, based on Graph Neural Operators (GNOs), to improving the accuracy of model predictions for a fixed computational budget. We then developed an Ensemble of Improved Neural Operators (ENO), which uses bagging and Monte Carlo dropout techniques, to further improve prediction accuracy. Lastly, we developed the way to explain progressive transfer learning methods to reduce the amount of training data and computational cost of training (i.e., reduce trainable parameters) when using our models for multiple storage sites. Our numerical investigation, which used real-world case studies, demonstrated that our framework can significantly improve the safety and efficiency of geological storage operations, with potential applications in other domains such as geothermal reservoirs and climate modeling.

54 ENVIRONMENTAL SCIENCES↗