Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized 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 307 records · Page 17

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

Cas3-Mediated Genome Reduction: Demonstration in Cupriavidus Necator H16 Improves Growth on Heterotrophic and Autotrophic Carbon Sources

Genome reduction is widely used to improve microbial bioprocessing hosts by reducing the burden of inessential physiology. Rationally identifying genomic regions that are dispensable or even detrimental to bioprocessing is challenged by our inability to map genome sequence to function across complex regulation and physiology. Thus, there is a need for tools that rapidly generate reduced genome strains with improved performance in process-relevant conditions. Here, we report a Cascade-Cas3-enabled method called TRIM3 that generates large deletions by targeting a randomly integrated transposon, enabling facile generation of a genome-reduced mutant library. Mutants with improved performance were isolated following growth-coupled selection and analyzed by long-read DNA sequencing to identify deletions in their genomes. We deploy this system iteratively in the industrial host Cupriavidus necator H16 on fructose and on formate. After two rounds of TRIM3, we isolate a strain containing a total reduction of 1.4 Mb (18.4% of the genome) that grows 25% faster in a bioreactor on fructose and a strain with a total reduction of 0.5 Mb (7.3% of the genome) that grows 14% faster on formate. This work demonstrates a method for random, iterative, growth-selectable genome reduction that represents a new avenue for large-scale genome modifications and the development of improved bioprocessing hosts.

09 BIOMASS FUELS↗

Large-scale inverse model analyses employing fast randomized data reduction: INVERSE MODELING WITH DATA REDUCTION

When the number of observations is large, it is computationally challenging to apply classical inverse modeling techniques. We have developed a new computationally efficient technique for solving inverse problems with a large number of observations (e.g., on the order of 10 7 or greater). Our method, which we call the randomized geostatistical approach (RGA), is built upon the principal component geostatistical approach (PCGA). We employ a data reduction technique combined with the PCGA to improve the computational efficiency and reduce the memory usage. Specifically, we employ a randomized numerical linear algebra technique based on a so-called “sketching” matrix to effectively reduce the dimension of the observations without losing the information content needed for the inverse analysis. In this way, the computational and memory costs for RGA scale with the information content rather than the size of the calibration data. Our algorithm is coded in Julia and implemented in the MADS open-source high-performance computational framework (http://mads.lanl.gov). We apply our new inverse modeling method to invert for a synthetic transmissivity field. Compared to a standard geostatistical approach (GA), our method is more efficient when the number of observations is large. Moreover, our method is capable of solving larger inverse problems than the standard GA and PCGA approaches. Thus, our new model inversion method is a powerful tool for solving large-scale inverse problems. The method can be applied in any field and is not limited to hydrogeological applications such as the characterization of aquifer heterogeneity.

54 ENVIRONMENTAL SCIENCES↗

CORRLA-RS

The CORRLA-RS package provides a suite of statistical methods for sampling multidimensional distributions and to conduct sensitivity and correlation analysis of large scale data in the Rust programming language. The software provides a unique solution to multidimensional constrained sampling problems utilizing a combination of parallelized Markov Chain Monte Carlo methods and traditional rejection sampling. The sensitivity and correlation analysis methods are backed by a high performance randomized singular value decomposition implementation which enables datasets larger than the random access memory (RAM) size to be analyzed. Additionally, CORRLA-RS implements the active subspace identification method using a KD-Tree and the randomized singular value decomposition acting in concert.

Gurecky, William [Oak Ridge National Laboratory (O↗

Mixed-State Entanglement from Local Randomized Measurements

In this work, we propose a method for detecting bipartite entanglement in a many-body mixed state based on estimating moments of the partially transposed density matrix. The estimates are obtained by performing local random measurements on the state, followed by postprocessing using the classical shadows framework. Our method can be applied to any quantum system with single-qubit control. We provide a detailed analysis of the required number of experimental runs, and demonstrate the protocol using existing experimental data [Brydges et al., Science 364, 260 (2019)].

1-dimensional spin chains↗

SpotSDC: Revealing the Silent Data Corruption Propagation in High-Performance Computing Systems

We report the trend of rapid technology scaling is expected to make the hardware of high-performance computing (HPC) systems more susceptible to computational errors due to random bit flips. Some bit flips may cause a program to crash or have a minimal effect on the output, but others may lead to silent data corruption (SDC), i.e., undetected yet significant output errors. Classical fault injection analysis methods employ uniform sampling of random bit flips during program execution to derive a statistical resiliency profile. However, summarizing such fault injection result with sufficient detail is difficult, and understanding the behavior of the fault-corrupted program is still a challenge. In this article, we introduce SpotSDC, a visualization system to facilitate the analysis of a program's resilience to SDC. SpotSDC provides multiple perspectives at various levels of detail of the impact on the output relative to where in the source code the flipped bit occurs, which bit is flipped, and when during the execution it happens. SpotSDC also enables users to study the code protection and provide new insights to understand the behavior of a fault-injected program. Based on lessons learned, we demonstrate how what we found can improve the fault injection campaign method.

97 MATHEMATICS AND COMPUTING↗

Do Epistemic Uncertainties Allow for Replacing Microstructural Experiments with Reconstruction Algorithms?

A novel problem in computational materials modeling is addressed: “Are the computational microstructure reconstruction techniques reliable enough to replace experiments?” Here, “reliable” computations are associated with producing “expected” reconstructions that are adequately close to the experimental data. The output of computational techniques can deviate from the experimental measurements because of the epistemic uncertainties in the algorithms. In this work, an analytical formulation for quantification of epistemic uncertainties in a microstructure reconstruction algorithm based on Markov random field is presented. The method is used to predict the large-scale spatial distribution of a microstructure given an experimental input measured over a small spatial domain. However, small variations are observed on the microstructural features of the synthesized samples due to the Markov random field algorithm. The proposed analytical technique aims to quantify these uncertainties and estimate their propagation to the macroscale material properties to provide a significant understanding on how reliable it is to replace the experiments with the Markov random field model to predict microstructural maps over large spatial domains.

97 MATHEMATICS AND COMPUTING↗

Accelerating Ab Initio Simulation via Nested Monte Carlo and Machine Learned Reference Potentials

As a corollary of the rapid advances in computing, ab initio simulation is playing an increasingly important role in modeling materials at the atomic scale. Two strategies are possible, ab initio Monte Carlo (AIMC) and molecular dynamics (AIMD) simulation. The former benefits from exact sampling from the correct thermodynamic distribution, while the latter is typically more efficient with its collective all-atom coordinate updates. In this study, using a relatively simple test model comprised of helium and argon, we show that AIMC can be brought up to, and even above, the performance levels of AIMD via a hybrid nested sampling/machine learning (ML) strategy. Here, ML provides an accurate classical reference potential (up to three-body explicit interactions) that can pilot long collective Monte Carlo moves that are accepted or rejected in toto à la nested Monte Carlo (NMC); this is in contrast to the single move nature of a naive implementation. Our proposed method only requires a small up front expense from evaluating the ab initio energies and forces of (100) random configurations for training. Importantly, our method does not totally rely on the trained, assuredly imperfect, interaction. We show that high performance and exact sampling at the desired level of theory can be realized even when the trained interaction has appreciable differences from the ab initio potential. Remarkably, at the highest levels of performance realized via our approach, a pair of statistically uncorrelated atomic configurations can be generated with (1) ab initio calculations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Preliminary Study on TRISO Fuel Cross Section Generation

Cross section self-shielding methodologies for TRISO fuel were assessed to provide accurate multigroup cross sections for a high-fidelity reactor physics code so that the code is able to accurately model and simulate advanced reactors with TRISO fuel. Initially, the two existing methodologies (the SCALE method and the Sanchez-Pomraning method) were studied and implemented to MC2-3 for detailed performance tests. Additionally, a new spatial self-shielding method, named the iterative local spatial self-shielding (ILSS) method, for particulate fuels was developed based on the disadvantage factor and implemented to MC2-3 as well. The new method approximately accounts for the effect of randomly distributed particles on the particle shadowing effect using a homogenized compact region surrounding a particle of interest at the center. The self-shielded cross sections of the particle at the center are determined iteratively since the cross sections of the homogenized compact region are calculated using them. For the energy range above 100 keV where the fuel-to-moderator ratio is more important than the random distribution of particles, a single particle unit-cell model is used by preserving the average amount of moderator per fuel particle in the system. The three self-shielding methods implemented in MC2-3 were tested using numerical benchmark problems made based on fuel compact problems of a prismatic-type very high temperature reactor. Test results indicated that the ILSS method produced slightly better results than the SCALE and Sanchez-Pomraning methods, compared to the Serpent-2 Monte Carlo results obtained with 25 independent random particle configurations. The SCALE and Sanchez-Pomraning methods tend to underestimate the heterogeneity effect by 150 and 100 pcm, respectively, while the new ILSS method overestimates the heterogeneity effect by 70 pcm. In future, the new self-shielding method will be extended to perform pebble calculations and compare results with those from the SCALE and Sanchez-Pomraning methods. Furthermore, the new method will be optimized for practical applications to on-the-fly resonance treatment for lattice or whole-core calculations for advanced reactors.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Formation of Vertically Oriented Channels during Calcination of Surfactant-Templated Titania-Doped Mesoporous Silica Thin Films

Here, the mesoporous structure development during calcination of titania-doped mesoporous silica thin films is characterized by in situ grazing-incidence small angle x-ray scattering (GISAXS). Varying amounts of titania (≤ 6 mol%) are incorporated in cetyltrimethylammonium bromide (CTAB) templated film by two methods in this study: dispersion of titania in the silica matrix, and fixing titania at the pore surface by complexation of the titania precursor with a sugar-based co-surfactant, dodecyl maltoside (C 12 G 2 ). Before calcination, films templated with only CTAB display a mesoporous structure with a mixture of in-plane 2D hexagonal and randomly oriented porous structure, while C 12 G 2 -complexed film possessed randomly oriented mesostructure only. Both methods yield a final structure of hexagonal close-packed pores orthogonally oriented to the substrate after calcination at 500 °C. This is attributed to weak Si-O-Ti bonds which allow sintering to occur at 500 °C, combined with unidirectional thermal contraction of the film in the vertical direction. Anisotropic stress and annealing of the films allows the randomly oriented pores to merge vertically and form channels with pore diameter of 2.3 ± 0.3 nm. Titania doping greater than 1% is required for this transformation in films with no C 12 G 2 surfactant used while the transformation was observed for films with C 12 G 2 complexation even at low (0.005%) titania doping, perhaps accentuated by orientational disorder introduced by the sugar surfactant.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Improved Stress Tolerance of Saccharomyces cerevisiae by CRISPR-Cas-Mediated Genome Evolution

In bioprocesses, a microorganism with high tolerance to various stresses would be advantageous for efficient bio-based chemical production. Yeast Saccharomyces cerevisiae has long been used in the food industry because of its safety and convenience, and genetically engineered S. cerevisiae strains have been constructed and used for the production of various bio-based chemicals. In this study, we developed a novel genome shuffling method for S. cerevisiae using CRISPR-Cas. By using this, the thermotolerant mutant strain T8-292, which can grow well at 39 °C, was successfully created. The strain also showed higher cell viability in low pH and high ethanol concentration. In addition, the differences in genome structure between mutant and parent strains were suggested by random amplified polymorphic DNA PCR method. Our genome shuffling method could be a promising strategy for improvement of various stress tolerance in S. cerevisiae.

60 APPLIED LIFE SCIENCES↗

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↗

Fast Extraction and Characterization of Fundamental Frequency Events from a Large PMU Dataset using Big Data Analytics

A novel method for fast extraction of fundamental frequency events (FFE) based on measurements of frequency and rate of change of frequency by Phasor Measurement Units (PMU) is introduced. The method is designed to work with exceptionally large historical PMU datasets. Statistical analysis was used to extract the features and train Random Forest and Catboost classifiers. The method is capable of fast extraction of FFE from a historical dataset containing measurements from hundreds of PMUs captured over multiple years. The reported accuracy of the best algorithm for classification expressed as Area Under the receiver operating Characteristic curve reaches 0.98, which was obtained in out-of-sample evaluations on 109 system-wide events over 2 years observed at 43 PMUs. Then Minimum Volume Enclosing Ellipsoid Algorithm was used to further analyze the events. 93.72% events were correctly characterized, where average duration of the event as seen by the PMU was 9.93 sec.

Baembitov, Rashid↗

Deep Learning Classification of Cheatgrass Invasion in the Western United States Using Biophysical and Remote Sensing Data

Cheatgrass (Bromus tectorum) invasion is driving an emerging cycle of increased fire frequency and irreversible loss of wildlife habitat in the western US. Yet, detailed spatial information about its occurrence is still lacking for much of its presumably invaded range. Deep learning (DL) has demonstrated success for remote sensing applications but is less tested on more challenging tasks like identifying biological invasions using sub-pixel phenomena. We compare two DL architectures and the more conventional Random Forest and Logistic Regression methods to improve upon a previous effort to map cheatgrass occurrence at >2% canopy cover. High-dimensional sets of biophysical, MODIS, and Landsat-7 ETM+ predictor variables are also compared to evaluate different multi-modal data strategies. All model configurations improved results relative to the case study and accuracy generally improved by combining data from both sensors with biophysical data. Cheatgrass occurrence is mapped at 30 m ground sample distance (GSD) with an estimated 78.1% accuracy, compared to 250-m GSD and 71% map accuracy in the case study. Furthermore, DL is shown to be competitive with well-established machine learning methods in a limited data regime, suggesting it can be an effective tool for mapping biological invasions and more broadly for multi-modal remote sensing applications.

54 ENVIRONMENTAL SCIENCES↗

Spinbox: tools for many-body quantum systems in a Monte Carlo context

Spinbox is a piece of software that facilitates quantum mechanical calculations relevant to Monte Carlo simulation of atomic nuclei. At the front lines of research on the nuclear many-body problem are a large number of supercomputer-scale simulation codes. These codes produce valuable results but can be hard to understand, especially for those without intimate knowledge of the relevant theoretical methods. Thus, tools that fill pedagogical roles are extremely valuable. Spinbox makes it easy for one to replicate and analyze the computational processes relevant to a Quantum Monte Carlo (QMC) simulation that may be difficult to understand/debug/analyze due to the scale of the corresponding simulation software. Spinbox is written in Python using other state-of-the-art Python modules for numerical calculations. While a number of Python libraries exist that are suited to general quantum many-body calculations, the motivation of Spinbox is quite particular. In Diffusion Monte Carlo methods (DMC, GFMC, AFDMC), the central calculation is the imaginary-time propagation of individual samples of the many-body wavefunction. Although quantum wavefunctions generally must be described by a probability distribution over a basis, DMC imbues particles (within one sample) with classical spatial coordinates. This method is unusual, so other Python packages are typically not set up to do this easily. Furthermore, the software has built-in options for nuclear systems assuming isospin symmetry, which can be set up with other libraries but is a nontrivial process to do so. Features: - numerical representation of samples of the many-body wavefunctions, including tensor-product states (used in AFDMC) - numerical representation of many-body operators, including tensor-product operators: general, spin, imaginary-time propagation, etc. - the correct associated arithmetic and algebra, implemented as class methods - classes for representing realistic nuclear two- and three-body Hamiltonians (e.g. Argonne V18, Illinois NNN) - large-scale parallel integration over random variables, crucial for the AFDMC method My goal is to make this package open source so that anyone may use it and contribute to it, particularly other researchers doing AFDMC calculations

Fox, Jordan↗

Interpreting High-resolution Spectroscopy of Exoplanets using Cross-correlations and Supervised Machine Learning

We present a new method for performing atmospheric retrieval on ground-based, high-resolution data of exoplanets. Our method combines cross-correlation functions with a random forest, a supervised machine-learning technique, to overcome challenges associated with high-resolution data. A series of cross-correlation functions are concatenated to give a “CCF-sequence” for each model atmosphere, which reduces the dimensionality by a factor of ∼100. The random forest, trained on our grid of ∼65,000 models, provides a likelihood-free method of retrieval. The precomputed grid spans 31 values of both temperature and metallicity, and incorporates a realistic noise model. We apply our method to HARPS-N observations of the ultra-hot Jupiter KELT-9b and obtain a metallicity consistent with solar (logM = − 0.2 ± 0.2). Our retrieved transit chord temperature (T=6000{sub −200}{sup +0}K) is unreliable as strong ion lines lie outside of the extent of the training set, which we interpret as being indicative of missing physics in our atmospheric model. We compare our method to traditional nested sampling, as well as other machine-learning techniques, such as Bayesian neural networks. We demonstrate that the likelihood-free aspect of the random forest makes it more robust than nested sampling to different error distributions, and that the Bayesian neural network we tested is unable to reproduce complex posteriors. We also address the claim in Cobb et al. 2019 that our random forest retrieval technique can be overconfident but incorrect. We show that this is an artifact of the training set, rather than of the machine-learning method, and that the posteriors agree with those obtained using nested sampling.

79 ASTRONOMY AND ASTROPHYSICS↗

Evaluating disease surveillance strategies for early outbreak detection in contact networks with varying community structure

Disease surveillance systems allow public health agencies to respond to emerging diseases before they become widespread. Developing such systems requires identifying optimal ways to monitor in the context of an epidemic outbreak; this problem is known as sensor selection. Contact networks represent the dynamics of interaction in a population and are used to model how a disease spreads in a population and to explore strategies of sensor selection. We evaluated five sensor selection strategies on their ability to provide an early warning of a COVID-like outbreak in synthetic contact networks encapsulated in four network scenarios. Three of these scenarios assessed different aspects of community structure. The fourth scenario employed a contact network representing the population and interactions of 6.8 million people in New York City, constructed from an agent-based simulation using census and transportation data. This scenario exemplifies how sensor selection strategies may perform in a real-world, urban context. Our findings suggest that the choice of the optimal strategy depends heavily on the community structure of the network. Strategies that select highly connected nodes or maximize network coverage are the optimal surveillance strategy for outbreak detection in many network community structures. However, a naive implementation of these strategies may fail to provide an early warning at all—including in the New York City scenario. Moreover, these methods are impractical for real-world use as they require knowledge of the underlying contact network. Instead, a selection strategy that starts with a set of random nodes and then performs a random walk through a chain of neighbors reliably provides early warnings without requiring prior knowledge of the network. We find this method, called “random chain”, to be the most pragmatic for implementation in a real-world disease surveillance context.

60 APPLIED LIFE SCIENCES↗

Novel 2D velocity estimation method for large transient events in plasmas

Dynamics of fast transient events are challenging to be analyzed with high time resolution. Such events can occur in fusion plasmas such as the filaments during edge-localized modes (ELMs). Here, we present a robust method—the spatial displacement estimation—for estimating the displacements of structures with fast dynamics from high spatial and time resolution imaging diagnostics [e.g., gas-puff imaging (GPI)] with sampling time temporal resolution. First, a background suppression method is shown, which suppresses the slowly time-evolving and spatially non-uniform background in the signal. In the second step, a two-dimensional polynomial trend subtraction method is presented to tackle the remaining polynomial order trend in the signal. After performing these pre-processing steps, the spatial displacement of the propagating structure is estimated from the two-dimensional spatial cross-correlation coefficient function calculated between consecutive frames. The method is tested for its robustness and accuracy by simulated Gaussian events and spatially displaced random noise. An example application of the method is presented on propagating ELM filaments measured by the GPI system on the National Spherical Torus Experiment spherical tokamak.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗