Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian 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 1,603 records · Page 89

MOOSE ProbML: Parallelizable Probabilistic Machine Learning and Uncertainty Quantification Capabilities

The Multiphysics Object Oriented Simulation Environment (MOOSE) is a widely used open- source finite element software for performing multiphysics multiscale simulations in a massively parallel fashion. Recently, the computational team at Idaho National Laboratory (INL) has implemented Probabilistic Machine Learning (ProbML) capabilities in MOOSE—in a parallelized fashion—and enable active learning with large-scale computational models for tasks such as surrogate model development, scale bridging, forward/inverse uncertainty quantification (UQ), Bayesian optimization, etc. This presentation summarizes these developments in MOOSE along with demonstrations on several real applications relevant to nuclear energy. At the fundamental level, samplers like Monte Carlo/Latin Hypercube, variance reduction, parallelized Markov Chain Monte Carlo (MCMC) support uncertainty propagation in both forward and inverse settings. These samplers can be integrated with the Gaussian processes (GP) suite in MOOSE, which offer several variants like scalar GPs, multi-output GPs, and deep GPs, to enable active learning. These GPs can be tuned using gradient-based optimization methods like Adam and its variants or gradient-free methods like the elliptical slice sampler (a variant of MCMC adept under Gaussian settings) for more complex covariance kernels or likelihoods whose gradient computations can be cumbersome. A variety of batch acquisition functions permit parallelized evaluation of the computational model and support different learning objectives with high efficiency like Bayesian inference, global surrogate development, optimization, etc. Furthermore, libtorch integration supports training, evaluation, and re-training of neural networks and other complex machine learning models in active learning settings. The impacts of these developments are shown on several real applications: (1) nuclear fuel inverse UQ and model inadequacy assessment using the Kennedy O’Hagan framework; (2) uncertainty aware surrogate modeling for additive manufacturing to predict field quantities; (3) nuclear reactor rare events analysis; and (4) complex fluid flow prediction using a global surrogate with quantified prediction uncertainty. Finally, the outlook of MOOSE ProbML is discussed for both outer-loop and inner-loop computations in the broad view to accelerate fuels and materials qualification, address gaps in knowledge and data, and assess new reactor/fuel systems.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Multi-fidelity Gaussian Process Bandit Optimisation

In many scientific and engineering applications, we are tasked with the maximisation of an expensive to evaluate black box function f. Traditional settings for this problem assume just the availability of this single function. However, in many cases, cheap approximations to f may be obtainable. For example, the expensive real world behaviour of a robot can be approximated by a cheap computer simulation. We can use these approximations to eliminate low function value regions cheaply and use the expensive evaluations of f in a small but promising region and speedily identify the optimum. We formalise this task as a multi-fidelity bandit problem where the target function and its approximations are sampled from a Gaussian process. We develop MF-GP-UCB, a novel method based on upper confidence bound techniques. In our theoretical analysis we demonstrate that it exhibits precisely the above behaviour and achieves better bounds on the regret than strategies which ignore multi-fidelity information. Empirically, MF-GP-UCB outperforms such naive strategies and other multi-fidelity methods on several synthetic and real experiments.

97 MATHEMATICS AND COMPUTING↗

Development of a Severe Accident Analysis Engine Using Approximate Reasoning

In hypothetical severe accident scenarios, nuclear power plant safety is challenged by core degradation and release of fission products. To aid the plant operator and technical support center staff, research has been performed to develop understanding of severe accident phenomenology, assessing their risk and devise measures to mitigate accident consequences (Sehgal, 2011). Nuclear power plant accidents involve highly complex physical and chemical interactions, a large number of safety related systems, and emergency operating procedures (EOP) and severe accident management guidelines (SAMG). Large number of factors with uncertainty and stress can overwhelm the operators. The overall objective of the present research is to develop a methodology and tools that an operator can use to predict severe accident progression and make effective decisions to arrest and manage the accident under large uncertainties. Towards this goal, this study examines a novel approach that brings to bear a combined use of techniques in artificial intelligence (Russel and Norvig, 2010), including Bayesian Network (BN), Answer Set Programming (ASP) and Fuzzy Inference (FI) to achieve faster-than-real-time, yet sufficiently accurate analysis of severe accident progression. Bayesian network (BN) is a type of probabilistic graphical models that can be used to represent knowledge and conditional dependencies about an uncertain realm. It is useful for capturing the causal relationships in a complex system. It also allows prediction via Bayesian inference (Kelly and Smith, 2012). It is composed of nodes and edges, which express random variables and probabilistic relationships between the nodes, respectively. This relationship, given by conditional probability is calculated using stochastic methods. The BN is used in several systems for analysis and management of accident risk; e.g. (Knochenhauer and Frid, 2010). In those systems, the nodes or so-called 'effective factors' are presumably known within the network by system descriptions in SAMGs. There are two steps to configure the BN, namely (i) identifying compositions within the network and (ii) defining conditional dependency between nodes. The first step is performed following the spirit of ASP (Baral, 2003) using Prolog (Wielemaker, 2005). Knowledge representation is used to build databases required for processing by ASP. Knowledge representation is defined as the expression of knowledge in a way that is understandable to both human and computers. Originally knowledge indicates data, information and facts. To focus, knowledge should be formed to achieve a goal. In a severe accident, key physics and safety related components status are defined according to a failure mode. The conditional dependencies between nodes are generated by approximate reasoning using Fuzzy inference (Zadeh, 1995). Fuzzy logic is a multiple-valued logic to treat ambiguous features such as linguistic description. It indicates possibility, which is distinguished from probability. Fuzzy set consists of linguistic variables according to the fixed rule. In other words, even uncertain states could be expressed as not binary logic, but as many-value logic by rule-based technology. Fuzzy control system is comprised of Fuzzy inference engine that is performed based on the 'If-Then Rule'. The 'If-Then Rule' is of the following form. If Y1 is B11 and Y2 is B12 then Z is C1. If Y1 is B21 and Y2 is B22 then Z is C2. Y1 and Y2 are inputs, which indicate conditional variables. Z indicates decision-making and both B and C are linguistic variables. With this rule-based technique, the approximate reasoning can be realized by Fuzzy inference. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Calibrating hypersonic turbulence flow models with the HIFiRE-1 experiment using data-driven machine-learned models.

In this paper we study the efficacy of combining machine-learning methods with projection-based model reduction techniques for creating data-driven surrogate models of computationally expensive, high-fidelity physics models. Such surrogate models are essential for many-query applications e.g., engineering design optimization and parameter estimation, where it is necessary to invoke the high-fidelity model sequentially, many times. Surrogate models are usually constructed for individual scalar quantities. However there are scenarios where a spatially varying field needs to be modeled as a function of the model’s input parameters. Here we develop a method to do so, using projections to represent spatial variability while a machine-learned model captures the dependence of the model’s response on the inputs. The method is demonstrated on modeling the heat flux and pressure on the surface of the HIFiRE-1 geometry in a Mach 7.16 turbulent flow. The surrogate model is then used to perform Bayesian estimation of freestream conditions and parameters of the SST (Shear Stress Transport) turbulence model embedded in the high-fidelity (Reynolds-Averaged Navier–Stokes) flow simulator, using shock-tunnel data. The paper provides the first-ever Bayesian calibration of a turbulence model for complex hypersonic turbulent flows. We find that the primary issues in estimating the SST model parameters are the limited information content of the heat flux and pressure measurements and the large model-form error encountered in a certain part of the flow.

42 ENGINEERING↗

Gaussian processes with built-in dimensionality reduction: Applications to high-dimensional uncertainty propagation

Uncertainty quantification (UQ) tasks, such as model calibration, uncertainty propagation, and optimization under uncertainty, typically require several thousand evaluations of the underlying computer codes. To cope with the cost of simulations, one replaces the real response surface with a cheap surrogate based, e.g., on polynomial chaos expansions, neural networks, support vector machines, or Gaussian processes (GP). However, the number of simulations required to learn a generic multivariate response grows exponentially as the input dimension increases. This curse of dimensionality can only be addressed, if the response exhibits some special structure that can be discovered and exploited. A wide range of physical responses exhibit a special structure known as an active subspace (AS). An AS is a linear manifold of the stochastic space characterized by maximal response variation. The idea is that one should first identify this low dimensional manifold, project the high-dimensional input onto it, and then link the projection to the output. If the dimensionality of the AS is low enough, then learning the link function is a much easier problem than the original problem of learning a high-dimensional function. The classic approach to discovering the AS requires gradient information, a fact that severely limits its applicability. Furthermore, and partly because of its reliance to gradients, it is not able to handle noisy observations. The latter is an essential trait if one wants to be able to propagate uncertainty through stochastic simulators, e.g., through molecular dynamics codes. In this work, we develop a probabilistic version of AS which is gradient-free and robust to observational noise. Our approach relies on a novel Gaussian process regression with built-in dimensionality reduction. In particular, the AS is represented as an orthogonal projection matrix that serves as yet another covariance function hyper-parameter to be estimated from the data. To train the model, we design a two-step maximum likelihood optimization procedure that ensures the orthogonality of the projection matrix by exploiting recent results on the Stiefel manifold, i.e., the manifold of matrices with orthogonal columns. The additional benefit of our probabilistic formulation, is that it allows us to select the dimensionality of the AS via the Bayesian information criterion. We validate our approach by showing that it can discover the right AS in synthetic examples without gradient information using both noiseless and noisy observations. We demonstrate that our method is able to discover the same AS as the classical approach in a challenging one-hundred-dimensional problem involving an elliptic stochastic partial differential equation with random conductivity. Finally, we use our approach to study the effect of geometric and material uncertainties in the propagation of solitary waves in a one dimensional granular system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Machine learning with knowledge constraints for process optimization of open-air perovskite solar cell manufacturing

Perovskite photovoltaics (PV) have achieved rapid development in the past decade in terms of power conversion efficiency of small-area lab-scale devices; however, successful commercialization still requires further development of low-cost, scalable, and high-throughput manufacturing techniques. One of the critical challenges of developing a new fabrication technique is the high-dimensional parameter space for optimization, but machine learning (ML) can readily be used to accelerate perovskite PV scaling. Herein, we present an ML-guided framework of sequential learning for manufacturing process optimization. We apply our methodology to the Rapid Spray Plasma Processing (RSPP) technique for perovskite thin films in ambient conditions. With a limited experimental budget of screening 100 process conditions, we demonstrated an efficiency improvement to 18.5% as the best-in-our-lab device fabricated by RSPP, and we also experimentally found 10 unique process conditions to produce the top-performing devices of more than 17% efficiency, which is 5 times higher rate of success than the control experiments with pseudo-random Latin hypercube sampling. Our model is enabled by three innovations: (a) flexible knowledge transfer between experimental processes by incorporating data from prior experimental data as a probabilistic constraint; (b) incorporation of both subjective human observations and ML insights when selecting next experiments; (c) adaptive strategy of locating the region of interest using Bayesian optimization first, and then conducting local exploration for high-efficiency devices. Furthermore, in virtual benchmarking, our framework achieves faster improvements with limited experimental budgets than traditional design-of-experiments methods (e.g., one-variable-at-a-time sampling). This framework shows the capability of incorporating researchers’ domain knowledge into the ML-guided optimization loop; therefore, it has the potential to facilitate the wider adoption of ML in scaling to perovskite PV manufacturing.

14 SOLAR ENERGY↗

Numerical convergence and validation of the DIMP inverse particle transport model

The data integration with modeled predictions (DIMP) model is a promising inverse radiation transport method for solving the special nuclear material (SNM) holdup problem. Unlike previous methods, DIMP is a completely passive nondestructive assay technique that requires no initial assumptions regarding the source distribution or active measurement time. DIMP predicts the most probable source location and distribution through Bayesian inference and quasi-Newtonian optimization of predicted detector re-sponses (using the adjoint transport solution) with measured responses. DIMP performs well with for-ward hemispherical collimation and unshielded measurements, but several considerations are required when using narrow-view collimated detectors. DIMP converged well to the correct source distribution as the number of synthetic responses increased. DIMP also performed well for the first experimental validation exercise after applying a collimation factor, and sufficiently reducing the source search vol-ume's extent to prevent the optimizer from getting stuck in local minima. DIMP's simple point detector response function (DRF) is being improved to address coplanar false positive/negative responses, and an angular DRF is being considered for integration with the next version of DIMP to account for highly collimated responses. Overall, DIMP shows promise for solving the SNM holdup inverse problem, especially once an improved optimization algorithm is implemented.

42 ENGINEERING↗

A novel probabilistic regression model for electrical peak demand estimate of commercial and manufacturing buildings

Due to the high cost of electricity in commercial and industrial sectors, demand forecast models have gained increasing attention. However, there are two unresolved issues: (1) Models are not adaptable when exposed to previously unknown data (2) The value of regression methods vs. state-of-the-art machine learning models has not been made apparent before. This study’s goal is to develop probabilistic demand estimation models. Herein, we propose a probabilistic Bayesian regression framework that can not only estimate future demands with high accuracy but also be updated once new information is available. By applying the proposed algorithm to two real-world case studies (commercial and manufacturing), we show a 40.3% and 30.8% improvement in terms of mean absolute error for the two cases. Moreover, the proposed technique outperforms powerful machine learning approaches, including support vector machine by 10.39%, random forest by 6.17%, and multilayer perceptron by 9.14% in terms of mean absolute percentage error.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Transfer learning driven design optimization for inertial confinement fusion

Transfer learning is a promising approach to create predictive models that incorporate simulation and experimental data into a common framework. In this technique, a neural network is first trained on a large database of simulations and then partially retrained on sparse sets of experimental data to adjust predictions to be more consistent with reality. Previously, this technique has been used to create predictive models of Omega [Humbird et al., IEEE Trans. Plasma Sci. 48, 61–70 (2019)] and NIF [Humbird et al., Phys. Plasmas 28, 042709 (2021); Kustowski et al., Mach. Learn. 3, 015035 (2022)] inertial confinement fusion (ICF) experiments that are more accurate than simulations alone. Here, in this work, we conduct a transfer learning driven hypothetical ICF campaign in which the goal is to maximize experimental neutron yield via Bayesian optimization. The transfer learning model achieves yields within 5% of the maximum achievable yield in a modest-sized design space in fewer than 20 experiments. Furthermore, we demonstrate that this method is more efficient at optimizing designs than traditional model calibration techniques commonly employed in ICF design. Such an approach to ICF design could enable robust optimization of experimental performance under uncertainty.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analysis and optimization of seismic monitoring networks with Bayesian optimal experimental design

SUMMARY Monitoring networks increasingly aim to assimilate data from a large number of diverse sensors covering many sensing modalities. Bayesian optimal experimental design (OED) seeks to identify data, sensor configurations or experiments which can optimally reduce uncertainty and hence increase the performance of a monitoring network. Information theory guides OED by formulating the choice of experiment or sensor placement as an optimization problem that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge and models of expected observation data. Therefore, within the context of seismo-acoustic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize a sensor network’s ability to locate seismic events from arrival time data of detected seismic phases at the regional-scale. This framework requires five elements: (i) A likelihood function that describes the distribution of detection and traveltime data from the sensor network, (ii) A prior distribution that describes a priori belief about seismic events, (iii) A Bayesian solver that uses a prior and likelihood to identify the posterior distribution of seismic events given the data, (iv) An algorithm to compute EIG about seismic events over a data set of hypothetical prior events, (v) An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we explore many relevant questions to monitoring such as: how to trade off sensor fidelity and earth model uncertainty; how sensor types, number and locations influence uncertainty; and how prior models and constraints influence sensor placement.

58 GEOSCIENCES↗

Assay-based background projection for the Majorana Demonstrator using Monte Carlo uncertainty propagation

The background index (BI) is an important quantity to project and calculate the half-life sensitivity of neutrinoless double-𝛽 decay (0⁢𝜈⁢𝛽⁢𝛽) experiments. An analysis framework is presented to calculate the BI using the specific activities, masses, and simulated efficiencies of an experiments components as distributions. This Bayesian framework includes a unified approach to combine specific activities from assay. Monte Carlo uncertainty propagation is used to build a BI distribution from the specific activity, mass, and efficiency distributions. This method is applied to the M AJORANA D EMONSTRATOR , which deployed arrays of high-purity Ge detectors enriched in 76 Ge to search for 0⁢𝜈⁢𝛽⁢𝛽. The original assay-based projection is requantified in the new framework, using the as-built geometry of the Demonstrator and additional assay information. While 47% higher than the original projection, the resulting BI of [8.95±0.36]×10 −4 cts/(keVkgyr) from the 232 Th and 238 U decay chains does not account for the higher-than-expected BI observed by the D EMONSTRATOR . Finally, this method enables us to demonstrate the statistical incompatibility between the D EMONSTRATOR 's observed background and the assay results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Evidence for production of single top quarks

We present first evidence for the production of single top quarks in the D0 detector at the Fermilab Tevatron pp collider. The standard model predicts that the electroweak interaction can produce a top quark together with an antibottom quark or light quark, without the antiparticle top-quark partner that is always produced from strong-coupling processes. Top quarks were first observed in pair production in 1995, and since then, single top-quark production has been searched for in ever larger data sets. In this analysis, we select events from a 0.9 fb{sup -1} data set that have an electron or muon and missing transverse energy from the decay of a W boson from the top-quark decay, and two, three, or four jets, with one or two of the jets identified as originating from a b hadron decay. The selected events are mostly backgrounds such as W+jets and tt events, which we separate from the expected signals using three multivariate analysis techniques: boosted decision trees, Bayesian neural networks, and matrix-element calculations. A binned likelihood fit of the signal cross section plus background to the data from the combination of the results from the three analysis methods gives a cross section for single top-quark production of {sigma}(pp{yields}tb+X,tqb+X)=4.7{+-}1.3 pb. The probability to measure a cross section at this value or higher in the absence of signal is 0.014%, corresponding to a 3.6 standard deviation significance. The measured cross section value is compatible at the 10% level with the standard model prediction for electroweak top-quark production. We use the cross section measurement to directly determine the Cabibbo-Kobayashi-Maskawa quark mixing matrix element that describes the Wtb coupling and find |V{sub tb}f{sub 1}{sup L}|=1.31{sub -0.21}{sup +0.25}, where f{sub 1}{sup L} is a generic vector coupling. This model-independent measurement translates into 0.68<|V{sub tb}|{<=}1 at the 95% C.L. in the standard model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Combining Push-Forward Measures and Bayes' Rule to Construct Consistent Solutions to Stochastic Inverse Problems

We formulate, and present a numerical method for solving, an inverse problem for inferring parameters of a deterministic model from stochastic observational data on quantities of interest. The solution, given as a probability measure, is derived using a Bayesian updating approach for measurable maps that finds a posterior probability measure, that when propagated through the deterministic model produces a push-forward measure that exactly matches the observed probability measure on the data. Our approach for finding such posterior measures, which we call consistent Bayesian inference or push-forward based inference, is simple and only requires the computation of the push-forward probability measure induced by the combination of a prior probability measure and the deterministic model. We establish existence and uniqueness of observation-consistent posteriors and present both stability and error analyses. We also discuss the relationships between consistent Bayesian inference, classical/statistical Bayesian inference, and a recently developed measure-theoretic approach for inference. Finally, analytical and numerical results are presented to highlight certain properties of the consistent Bayesian approach and the differences between this approach and the two aforementioned alternatives for inference.

97 MATHEMATICS AND COMPUTING↗

Bayesian Static Parameter Estimation for Partially Observed Diffusions via Multilevel Monte Carlo

In this article we consider static Bayesian parameter estimation for partially observed diffusions that are discretely observed. We work under the assumption that one must resort to discretizing the underlying diffusion process, for instance, using the Euler--Maruyama method. Given this assumption, we show how one can use Markov chain Monte Carlo (MCMC) and particularly particle MCMC [C. Andrieu, A. Doucet, and R. Holenstein, J. R. Stat. Soc. Ser. B Stat. Methodol., 72 (2010), 269--342] to implement a new approximation of the multilevel (ML) Monte Carlo (MC) collapsing sum identity. Our approach comprises constructing an approximate coupling of the posterior density of the joint distribution over parameter and hidden variables at two different discretization levels and then correcting by an importance sampling method. The variance of the weights are independent of the length of the observed data set. The utility of such a method is that, for a prescribed level of mean square error, the cost of this MLMC method is provably less than i.i.d. sampling from the posterior associated to the most precise discretization. However the method here comprises using only known and efficient simulation methodologies. Finally, the theoretical results are illustrated by inference of the parameters of two prototypical processes given noisy partial observations of the process: the first is an Ornstein--Uhlenbeck process and the second is a more general Langevin equation.

97 MATHEMATICS AND COMPUTING↗

Overhead longwave infrared hyperspectral material identification using radiometric models

Material detection algorithms used in hyperspectral data processing are computationally efficient but can produce relatively high numbers of false positives. Material identification performed as a secondary processing step on detected pixels can help separate true and false positives. This paper presents a material identification processing chain for longwave infrared hyperspectral data of solid materials collected from airborne platforms. The algorithms utilize unwhitened radiance data and an iterative algorithm that determines the temperature, humidity, and ozone of the atmospheric profile. Pixel unmixing is done using constrained linear regression and Bayesian Information Criteria for model selection. The resulting product includes an optimal atmospheric profile and full radiance material model that includes material temperature, abundance values, and several fit statistics. A logistic regression method utilizing all model parameters to improve identification is also presented. This paper details the processing chain and provides justification for the algorithms used. Several examples are provided using modeled data at different noise levels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Transitional Markov Chain Monte Carlo Sampler in UQTk

Transitional Markov Chain Monte Carlo (TMCMC) is a variant of a class of Markov Chain Monte Carlo algorithms known as tempering-based methods. In this report, the implementation of TMCMC in the Uncertainty Quantification Toolkit is investigated through the sampling of high-dimensional distributions, multi-modal distributions, and nonlinear manifolds. Furthermore, the Bayesian model evidence estimates obtained from TMCMC are tested on problems with known analytical solutions and shown to provide consistent results.

97 MATHEMATICS AND COMPUTING↗

Bayesian Symbolic Regression: Addressing Challenges in Estimating Fractional Bayes Factors and Application to Fatigue Crack Growth Modeling

This research pioneers advancements in computational mechanics by integrating Bayesian-based uncertainty quantification into symbolic regression, specifically focusing on the critical task of accurately estimating the fractional Bayes factor for selecting arbitrary equations. In our exploration, we rigorously study two prominent methods—sequential Monte Carlo and the Laplace approximation—employed for computing the fractional Bayes factor. Our findings underscore the limitations of the Laplace approximation, revealing its diminished accuracy in nonlinear and multimodal scenarios. Specifically, the Laplace approximation is shown to underpredict fractional Bayes factor on a wide set of equations associated with a symbolic regression benchmark. This comparative analysis sheds light on the nuanced performance of these techniques, guiding researchers toward more informed choices in uncertainty quantification within symbolic regression. Furthermore, we showcase the practical utility of these enhanced symbolic regression tools through their application to a real-world problem in fatigue crack growth modeling, emphasizing their efficacy in capturing the complexities of mechanical systems.

Geoffrey Bomarito↗

Accurate and Timely Forecasts of Geologic Carbon Storage using Machine Learning Methods

Carbon capture and storage is one strategy to reduce greenhouse gas emissions. One approach to storing the captured CO2 is to inject it into deep saline aquifers. However, dynamics of the injected CO2 plume is uncertain and the potential for leakage back to the atmosphere must be assessed. Thus, accurate and timely forecasts of CO2 storage via real-time measurements integration becomes very crucial. This study proposes a learning-based, inverse-free prediction method that can accurately and rapidly forecast CO2 movement and distribution with uncertainty quantification based on limited simulation and observation data. The machine learning techniques include dimension reduction, multivariate data analysis, and Bayesian learning. The outcome is expected to provide CO2 storage site operators with an effective tool for real-time decision making.

Lu, Dan↗