Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized sampling”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Studies on the Composite System of Bi-2212 Glass Ceramic and MgB{sub 2} Superconductors

The composites of glass ceramic Bi-2212 and MgB{sub 2} superconductors were prepared at ambient conditions. The transmission electron microscopy images of the composite samples illustrate the presence of glass ceramic inclusions in bulk MgB{sub 2}. Temperature-dependent magnetization of the composite samples shows two superconducting transitions: one at 80 K corresponding to the Bi-2212 phase and a second one at 39 K corresponding to the MgB{sub 2} phase, suggesting that the two superconducting phases are separated with clear boundaries. The critical current density (J{sub c}) and pinning force values are increased in composite systems by an order of magnitude compared to that of individual samples. The pinning mechanism in the composite sample is the same as in the matrix phase. Reduced field maxima (h{sub max}) are observed at 0.15 for composite samples. A low value of h{sub max} for composite samples indicates the random orientation of grain boundaries and repulsive pinning force in the composite samples.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

What Can We Conclude about the Real Aspect Ratios of Ice Particle Aggregates from Two-Dimensional Images?

Abstract A simple numerical experiment was performed to investigate the result published in many papers that measurements indicate that aggregates may be well represented as oblate spheroids with mean aspect ratio (semiminor axis to semimajor axis length) of 0.6. The aspect ratio measurements are derived from two-dimensional projections of complex three-dimensional aggregates. Here, aggregates were modeled as ellipsoids with semiprincipal axes of length a, b, and c, which include oblate spheroids (a = b) as a class, and the projected aspect ratios of large numbers of two-dimensional projections of them were sampled. When sampling oblate spheroids with aspect ratio 0.6 over random orientations, the mean projected aspect ratio is 0.746. A mean projected aspect ratio of 0.6 is obtained for an oblate spheroid with aspect ratio of 0.33. When sampling randomly oriented ellipsoids with semiminor axes (b, c) varying from 0.10 to 1.00 in steps of 0.01, representing many complex shapes, the mean projected aspect ratio is 0.595, close to the measured mean projected aspect ratio of aggregates of 0.6. These experiments demonstrate that the conclusion one may safely draw from the projected aspect ratio measurements is that the mean aspect ratio of aggregates is lower than 0.6. Moreover, the projected aspect ratio distributions from measurements suggest a mixture of aggregate shapes, rather than only oblate spheroids as is often assumed.

Jiang, Zhiyuan↗
DOE OSTI2020

MAPPER – A NOVEL CAPABILITY TO SUPPORT NUCLEAR MODEL VALIDATION AND MAPPING OF BIASES AND UNCERTAINTIES

This paper overviews the initial results of a new project at the Oak Ridge National Laboratory -- supported via an internal seed funding program -- focused on the development of a novel computational capability, called MAPPER, to support model validation. The MAPPER development aims to eliminate the need for empirical criteria, such as similarity indices, often employed to identify applicable experiments for given application conditions. To achieve that, MAPPER employs an information-theoretic-based approach, based on the Kullback-Leibler (KL) divergence principle, to combine responses of available or to-be-built experiments with application responses of interest using a training set of samples generated using randomized execution of the experiments and the application high fidelity analysis models. These samples are condensed using reduced order modeling techniques in the form of a joint probability distribution function (PDF) connecting each application response of interest with a new effective experimental response. The initial focus of the MAPPER capability will be to support the confirmatory analysis required for criticality safety analysis of storage facilities which require k-eff biases to be known for safe operation. This paper reports some of the initial results obtained with MAPPER as applied to a set of critical experiments for which existing similarity-based methods have been shown to provide inaccurate estimates of the biases.

Mertyurek, Ugur↗
DOE OSTI2024

Using Parameter Sweep in WaterTAP to Analyze New Water Treatment Technologies

We describe a powerful and generalized parameter sweep tool in this report that was originally developed to analyze the performance of existing and novel water treatment models being developed in WaterTAP. Since WaterTAP is built upon IDAES and Pyomo, the parameter sweep tool can be used to systematically explore and debug the behavior of most Pyomo and IDAES numerical models. In order to enable meaningful analyses, the parameter sweep tool has been designed with the following features: 1) Model flexibility: The parameter sweep tool does not enforce any restrictions on the types of models that can be used with it. As long as a Pyomo model can be solved and the parameter is active and mutable, the tool only needs functions that describe how to run the model, the sweep parameters, and the output quantities of interest. 2) Flexible sampling: The parameter sweep tool has inbuilt functions to generate samples from a random distribution or a multidimensional Euclidean space. Furthermore, the users have to ability to supply samples generated from a tool of their choice. 3) Multiple sweep types: A user can choose from one of 3 types of parameter sweeps depending on their needs. 4) Detailed outputs: Outputs generated by the parameter sweep tool can be stored in detailed H5 file or user-friendly CSV files for post processing. 5) Parallel computing: The parameter sweep supports shared and distributed memory parallel computing to enable the use of high performance computers (HPC) for large-scale analyses. 6) Modular: The parameter sweep tool is self-contained and can easily be integrated within an outer-loop analysis or as desired by the user. 7) Ease of use: The tool is well documented and a simple sweep can be easily executed by following the online documentation in a few lines of code. We demonstrate the use of the parameter sweep tool on a simple water treatment system from the WaterTAP repository and show its parallel scaling performance on an Apple laptop and NREL's Eagle HPC. The parameter sweep tool is actively being used with models currently being developed within WaterTAP and we expect its use to grow beyond it to other IDAES and Pyomo models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fermionic Partial Tomography via Classical Shadows

Here we propose a tomographic protocol for estimating any k-body reduced density matrix (k-RDM) of an n-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all k-RDM elements to additive precision ϵ requires on the order of ($^{n}_{k}$)k 3/2 log(n)/ϵ 2 repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for k ≥ 2, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2–5 times more repetitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Midmorning Point Sampling May Not Accurately Represent Nitrous Oxide Emissions Following Fertilizer Applications

A common approach for measuring N 2 O emissions is to collect midmorning or early evening gas samples from experiments utilizing the chamber-based flux methodology. However, due to high spatial and temporal variability, N 2 O estimates based on midmorning or early evening sampling may not provide accurate estimates of total emissions. This study determined the impact of sampling collection timing on the precision and accuracy of N 2 O emissions estimates. Nitrous oxide emissions, air and soil temperatures, and soil moisture were measured for 21 d following the application of 224 kg urea-N ha –1 on 20 Sept. 2017, 11 Oct. 2017, and 1 May 2018, at six time intervals (0130–0230, 0530–0630, 0930–1030, 1330–1430, 1730–1830, and 2130–2230 h) over a 24-h period. Based on multiple daily measurements, point samples collected between 0930 and 1030 h (midmorning) were inconsistent in their ability to predict N 2 O emissions. However, samples collected between 2130 and 2230 h (early evening) were similar to average emissions. The number of randomly collected point samples to be within 20% of the mean 80% of the time over a 21-d period ranged from 13 samples for fertilizer applied on 20 Sept. 2017 to 48 samples for fertilizer applied on 11 Oct. 2017. This research indicates that management and climatic variability affect N 2 O emissions, and that accurate sampling protocols vary across management and climates. To reduce uncertainty, N 2 O sampling protocol should be tested under conditions likely to occur and where possible, near-continuous measurement systems should be adopted.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Node-degree aware edge sampling mitigates inflated classification performance in biomedical random walk-based graph representation learning

Motivation: Graph representation learning is a family of related approaches that learn low-dimensional vector representations of nodes and other graph elements called embeddings. Embeddings approximate characteristics of the graph and can be used for a variety of machine-learning tasks such as novel edge prediction. For many biomedical applications, partial knowledge exists about positive edges that represent relationships between pairs of entities, but little to no knowledge is available about negative edges that represent the explicit lack of a relationship between two nodes. For this reason, classification procedures are forced to assume that the vast majority of unlabeled edges are negative. Existing approaches to sampling negative edges for training and evaluating classifiers do so by uniformly sampling pairs of nodes. Results: We show here that this sampling strategy typically leads to sets of positive and negative examples with imbalanced node degree distributions. Using representative heterogeneous biomedical knowledge graph and random walk-based graph machine learning, we show that this strategy substantially impacts classification performance. If users of graph machine-learning models apply the models to prioritize examples that are drawn from approximately the same distribution as the positive examples are, then performance of models as estimated in the validation phase may be artificially inflated. We present a degree-aware node sampling approach that mitigates this effect and is simple to implement. Availability and implementation: Our code and data are publicly available at https://github.com/monarch-initiative/negativeExampleSelection.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Coarse-Grained Density Functional Theory Predictions via Deep Kernel Learning

Scalable electronic predictions are critical for soft materials design. Recently, the Electronic Coarse-Graining (ECG) method was introduced to renormalize all-atom quantum chemical (QC) predictions to coarse-grained (CG) resolutions using deep neural networks (DNNs). While DNNs can learn complex representations that prove challenging for kernel-based methods, they are susceptible to overfitting and the overconfidence of uncertainty estimations. Here, we develop ECG within a GPU-accelerated Deep Kernel Learning (DKL) framework to enable CG QC predictions using range-separated hybrid density functional theory (DFT), obtaining a 107 speedup relative to naive all-atom QC. By treating the predicted electronic properties as random Gaussian Processes, DKL incorporates CG mapping degeneracy by learning the distribution of electronic energies as a function of CG configuration. DKL-ECG accurately reproduces molecular orbital energies from range-separated DFT while facilitating efficient training via active learning using the uncertainties provided by DKL. Further, we show that while active learning algorithms enable efficient sampling of a more diverse configurational space relative to random sampling, all explored query methods exhibit comparable performance for the examined system. We attribute this result to the significant overlap of the feature space and output property distributions across multiple temperatures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Rapid Identification of X-ray Diffraction Patterns Based on Very Limited Data by Interpretable Convolutional Neural Networks

Large volumes of data from material characterizations call for rapid and automatic data analysis to accelerate materials discovery. Herein, we report a convolutional neural network (CNN) that was trained based on theoretical data and very limited experimental data for fast identification of experimental X-ray diffraction (XRD) patterns of metal–organic frameworks (MOFs). To augment the data for training the model, noise was extracted from experimental data and shuffled; then it was merged with the main peaks that were extracted from theoretical spectra to synthesize new spectra. For the first time, one-to-one material identification was achieved. Theoretical MOFs patterns (1012) were augmented to a whole data set of 72 864 samples. It was then randomly shuffled and split into training (58 292 samples) and validation (14 572 samples) data sets at a ratio of 4:1. For the task of discriminating, the optimized model showed the highest identification accuracy of 96.7% for the top 5 ranking on a test data set of 30 hold-out samples. Neighborhood component analysis (NCA) on the experimental XRD samples shows that the samples from the same material are clustered in groups in the NCA map. Analysis on the class activation maps of the last CNN layer further discloses the mechanism by which the CNN model successfully identifies individual MOFs from the XRD patterns. Furthermore, this CNN model trained by the data augmentation technique would not only open numerous potential applications for identifying XRD patterns for different materials, but also pave avenues to autonomously analyze data by other characterization tools such as FTIR, Raman, and NMR spectroscopies.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The Effect of Homogenization Heat Treatment on the Texture Evolution in U-10Mo Alloy

Uranium alloyed with 10 wt% Mo (U-10Mo) undergoes discontinuous precipitation (DP) when subjected to sub-eutectoid heat-treatment. It is hypothesized that the crystallographic texture of the U-10Mo can be modified to minimize the degree of DP, however the evolution of texture throughout the manufacturing process is not well understood. Crystallographic textures of two U-10Mo samples homogenized at 900°C and 1000°C were studied after uniaxial rolling and annealing. A total of 6 samples were analyzed upon rolling using a combination of hot and cold rolling conditions to strains of 83%, 90% and 97% and subsequently annealed at 700°C for one hour. Microstructures and textures were analyzed via electron backscatter diffraction (EBSD) for each homogenization, strain and post-annealed states. Results show that the U-10Mo exhibits typical rolling textures seen in body-centered cubic materials with increasing intensities of both a- and ?-fibers with increasing strain. After recrystallization, the texture appeared to be effectively randomized in all samples. Homogenization temperature showed no effect on the rolling and recrystallization behavior. Potential factors leading to the randomization of texture are discussed along with the implications of textures on the minimization of DP.

nuclear fuel, texture, rolling↗
DOE OSTI2016

SU-G-JeP1-15: Sliding Window Prior Data Assisted Compressed Sensing for MRI Lung Tumor Tracking

Purpose: Prior Data Assisted Compressed Sensing (PDACS) is a partial k-space acquisition and reconstruction method for mobile tumour (i.e. lung) tracking using on-line MRI in radiotherapy. PDACS partially relies on prior data acquired at the beginning of dynamic scans, and is therefore susceptible to artifacts in longer duration scan due to slow drifts in MR signal. A novel sliding window strategy is presented to mitigate this effect. Methods: MRI acceleration is simulated by retrospective removal of data from the fully sampled sets. Six lung cancer patients were scanned (clinical 3T MRI) using a balanced steady state free precession (bSSFP) sequence for 3 minutes at approximately 4 frames per second, for a total of 650 dynamics. PDACS acceleration is achieved by undersampling of k-space in a single pseudo-random pattern. Reconstruction iteratively minimizes the total variations while constraining the images to satisfy both the currently acquired data and the prior data in missing k-space. Our novel sliding window technique (SW-PDACS), uses a series of distinct pseudo-random under-sampling patterns of partial k-space – with the prior data drawn from a sliding window of the most recent data available. Under-sampled data, simulating 2 – 5x acceleration are reconstructed using PDACS and SW-PDACS. Three quantitative metrics: artifact power, centroid error and Dice’s coefficient are computed for comparison. Results: Quantitively metric values from all 6 patients are averaged in 3 bins, each containing approximately one minute of dynamic data. For the first minute bin, PDACS and SW-PDACS give comparable results. Progressive decline in image quality metrics in bins 2 and 3 are observed for PDACS. No decline in image quality is observed for SW-PDACS. Conclusion: The novel approach presented (SW-PDACS) is a more robust for accelerating longer duration (>1 minute) dynamic MRI scans for tracking lung tumour motion using on-line MRI in radiotherapy. B.G. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Stochastic Framework for Optimal Control of Planetary Reentry Trajectories Under Multilevel Uncertainties

We present a novel stochastic optimal control framework that accounts for various types of uncertainties, with application to reentry trajectory planning. The formulation of the optimal trajectory control problem is presented in the context of an indirect method where a functional objective associated with the terminal vehicle speed is to be minimized. Uncertain input parameters in the optimal trajectory control model, including aerodynamic parameters and initial and terminal conditions, are modeled as aleatory random variables, while the statistical parameters of these aleatory distributions are themselves random variables. The parametric and model uncertainties are simultaneously propagated through an extended polynomial chaos expansion (EPCE) formalism. Several metrics are described to evaluate response statistics and presented as insightful tools for robust decision making. Specifically, the response probability density function (PDF) reflecting influence of both epistemic and aleatory uncertainties is obtained. By sampling over the random variables representing model error, an ensemble of response PDFs is generated and the associated failure probability is estimated as a random variable with its own polynomial chaos expansion. Besides, the sensitivity index functions of response PDF with respect to the statistical parameters are evaluated. Coupling parametric and model uncertainties within the EPCE framework leads to a robust and efficient paradigm for multilevel uncertainty propagation and PDF characterization in general optimal control problems.

Engineering↗
DOE OSTI2019

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Optical studies of the uniaxial stress-induced orbital alignment of the Cr{sup 2+} centers in KZnF{sub 3} single crystal

Observation of an intense optical linear dichroism arising in cubic KZnF{sub 3}:Cr crystal at low temperatures under uniaxial stress applied along the four-fold axis is reported. Dichroism occurs in the range of the wide vibronic absorption band corresponding to {sup 5}E{sub g} → {sup 5}T{sub 2g} transition of the Cr{sup 2+} ions. Strain dependences of the dichroism value were studied at the temperatures of 2.0 K, 4.2 K, and 77 K. We associate our observations with the Jahn-Teller effect in the {sup 5}E{sub g} ground state of the Cr{sup 2+} ion. The model is proposed based on a redistribution of the centers between the minima of the E⨂e problem adiabatic potential that become inequivalent under uniaxial stress applied along the four-fold axis of the crystal. It is shown that random strains in the sample have to be taken into account to achieve the quantitative agreement of the model predictions with experimental data. It is found that random strains in the studied sample originate predominantly from point defects. Obtained parameter values are inversion splitting δ = 9.2 ± 1.6 cm{sup −1}, electron-strain coupling constant qV{sub ES} = 16 500 ± 600 cm{sup −1}, width of the random strain distribution w = (6.9 ± 0.5) ⋅ 10{sup −5}. It is shown also that the minima of the [CrF{sub 6}]{sup 4−} cluster adiabatic potential correspond to the elongated along the four-fold axes configurations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Assessment of the Idaho National Laboratory Remote-Handled Low-Level Waste Disposal Facility Vault Concrete Data

This document provides a summary of the concrete performance data collected during vault fabrication and installation. The report includes the process by which quality data was collected during vault fabrication and installation, the inspection requirements, and a summary of resulting test data with the potential to impact vault system durability. This report also includes quantitative data collected on cured concrete samples poured for random concrete batches throughout the concrete component fabrication process. Quantitative data includes total porosity, bulk density, absorption, effective porosity, and gas-phase permeability. Chloride diffusivity data collected during the concrete mix selection process are also included for completeness. Data shows that the vault quality assurance program resulted in components received insignificant defects and damaged areas during the fabrication stage and during the vault installation stage. Data collected on the cured concrete samples show the gas-phase permeability and effective porosity are slightly higher than the data used to select the concrete mix designs.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2025

Karhunen–Loève deep learning method for surrogate modeling and approximate Bayesian parameter estimation

We evaluate the performance of the Karhunen-Loève Deep Neural Network (KL-DNN) framework for surrogate modeling and approximate Bayesian parameter estimation in partial differential equation models. In the surrogate model, the Karhunen-Loève (KL) expansions are used for the dimensionality reduction of the number of unknown parameters and variables, and a deep neural network is employed to relate the reduced space of parameters to that of the state variables. The KL-DNN surrogate model is used to formulate a maximum-a-posteriori-like least-squares problem, which is randomized to draw samples of the posterior distribution of the parameters. We test the proposed framework for a hypothetical unconfined aquifer via comparison with the forward MODFLOW and inverse PEST++ iterative ensemble smoother (IES) solutions as well as the state-of-the-art Fourier neural operator (FNO) and deep operator networks (DeepONets) operator learning surrogate models. Our results show that the KL-DNN surrogate model outperforms FNO and DeepONet for forward predictions. For solving inverse problems, the randomized algorithm provides the same or more accurate Bayesian predictions of the parameters than IES as evidenced by the higher log-predictive probability of both the estimated parameter field and the forecast hydraulic head. The posterior mean obtained from the randomized algorithm is closer to the reference parameter field than that obtained with FNO as the maximum a posteriori estimate.

Approximate Bayesian inference↗