SEARCH · Search NASA
Results for “structured Gaussian process”
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.
Optimization of the number and locations of the calibration stations needed to monitor soil moisture using distributed temperature sensing systems: A proof-of-concept study
The single-probe heat-pulse (SPHP) technique combined with the Fiber-optic Distributed Temperature Sensing (DTS) technology can offer novel high-resolution measurements of soil moisture (θ) over spatial scales ranging from several centimeters to several kilometers. However, the key limitation of this method is in obtaining the calibration relationship between θ and soil thermal conductivity (λ) across a specific field. In a previous study, a new methodology using a Gaussian processes model was presented to account for the spatial variability in the λ-θ relationship. The model aggregated θ measurements from soil moisture sensors scattered over the SPHP transect with the corresponding DTS λ measurements at their locations. In this study, a novel methodology is tested to optimize the number and locations of soil moisture sensors required to account for the spatial variability of the λ - θ relationship to achieve higher accuracy from the SPHP technique. The proposed methodology utilizes hierarchical clustering to analyze the information contained in the spatial structure of the SPHP measurements as the soil dries from a nearly-saturated condition. The proposed methodology was tested using data from a field in Oklahoma. Monte-Carlo simulation was performed to validate the performance of the proposed methodology. The predictions obtained from the proposed methodology resulted in θ measurements accuracy comparable to those obtained from the 10% best Monte-Carlo iterations of randomly assigned soil moisture locations. Further, this study demonstrates that the proposed methodology is more efficient than the traditional practice of randomly spreading calibration soil moisture sensors along the SPHP transect.
Physics-Based Machine Learning Methods for U-235 Forensics Signatures
Signatures of low-intensity U-235 sources have been recently studied by utilizing a variety of machine learning (ML) classifiers using features derived from gamma spectral measurements collectedunder structured campaigns. Several ML classifiers, such as ensemble of tress and classification trees, revealed misleadingly-optimistic training error due to over-fitting, and furthermore,their performance is not directly relatable to the physical properties due to their data-driven, opaque designs. We present a regression-based ML method that first estimates the inverse distanceto the source and then utilizes a threshold to infer its presence, by representing the background as a source located at an infinite distance. For the inverse distance estimation, we study the ensembleof trees and Gaussian process regression methods, and a hyper parameter auto-tuning and selection method that employs five regression estimators. These methods avoid the over-fittingobserved in several ML classifiers, while providing the classification error nearly comparable to them based on independent test data. Their error is directly related to estimates of the inversephysical distance to source, and the precision of error determines the seperability property that determines the false alarm and missed detection rates. The property of monotonic decrease of thesource strength with increasing detector distance combined with Poisson distribution of measurements is utilized to analytically validate these methods by deriving the generalization equations ofunderlying regression methods.
Robust direct laser acceleration of electrons with flying-focus laser pulses
Direct laser acceleration (DLA) offers a compact source of high-charge, energetic electrons for generating secondary radiation or neutrons. While DLA in high-density plasma optimizes the energy transfer from a laser pulse to electrons, it exacerbates nonlinear propagation effects, such as filamentation, that can disrupt the acceleration process. Here, we show that superluminal flying-focus pulses (FFPs) mitigate nonlinear propagation, thereby enhancing the number of high-energy electrons and resulting x-ray yield. Three-dimensional particle-in-cell simulations show that, compared to a Gaussian pulse of equal energy (1 J) and intensity (2 × 10 20 W/cm 2 ), an FFP produces 80 × more electrons above 100 MeV, increases the electron cutoff energy by 20%, triples the high-energy x-ray yield, and improves x-ray collimation. These results illustrate the ability of spatiotemporally structured laser pulses to provide additional control in the highly nonlinear, relativistic regime of laser-plasma interactions.
Physics-Based Machine Learning Methods for U-235 Forensics Signatures
Signatures of low-intensity U-235 sources have been recently studied by utilizing a variety of machine learning (ML) classifiers using features derived from gamma spectral measurements collected under structured campaigns. Several ML classifiers, such as ensemble of tress and classification trees, revealed misleadingly-optimistic training error due to over-fitting, and furthermore, their performance is not directly relatable to the physical properties due to their data-driven, opaque designs. We present a regression-based ML method that first estimates the inverse distance to the source and then utilizes a threshold to infer its presence, by representing the background as a source located at an infinite distance. For the inverse distance estimation, we study the ensemble of trees and Gaussian process regression methods, and a hyper parameter auto-tuning and selection method that employs five regression estimators. These methods avoid the over-fitting observed in several ML classifiers, while providing the classification error nearly comparable to them based on independent test data. Their error is directly related to estimates of the inverse physical distance to source, and the precision of error determines the seperability property that determines the false alarm and missed detection rates. The property of monotonic decrease of the source strength with increasing detector distance combined with Poisson distribution of measurements is utilized to analytically validate these methods by deriving the generalization equations of underlying regression methods.
Neutron Drip Line in the Ca Region from Bayesian Model Averaging
The region of heavy calcium isotopes forms the frontier of experimental and theoretical nuclear structure research where the basic concepts of nuclear physics are put to stringent test. The recent discovery of the extremely neutron-rich nuclei around 60 Ca and the experimental determination of masses for 55-57 Ca provide unique information about the binding energy surface in this region. To assess the impact of these experimental discoveries on the nuclear landscape’s extent, we use global mass models and statistical machine learning to make predictions, with quantified levels of certainty, for bound nuclides between Si and Ti. Using a Bayesian model averaging analysis based on Gaussian-process-based extrapolations we introduce the posterior probability for each nucleus to be bound to neutron emission. We discover that extrapolations for drip-line locations, at which the nuclear binding ends, are consistent across the global mass models used, in spite of significant variations between their raw predictions. In particular, considering the current experimental information and current global mass models, we suggest that 68 Ca has an average posterior probability p ex ≈ 76 % to be bound to two-neutron emission while the nucleus 61 Ca is likely to decay by emitting a neutron (p ex ≈ 46 % ).
Evolution of the proton velocity distribution due to stochastic heating in the near-sun solar wind
We investigate how the proton distribution function evolves when the protons undergo stochastic heating by strong, low-frequency, Alfvén-wave turbulence under the assumption that β is small. We apply our analysis to protons undergoing stochastic heating in the supersonic fast solar wind and obtain proton distributions at heliocentric distances ranging from 4 to 30 solar radii. We find that the proton distribution develops non-Gaussian structure with a flat core and steep tail. For r>5 R{sub S}, the proton distribution is well approximated by a modified Moyal distribution. Comparisons with future measurements from Solar Probe Plus could be used to test whether stochastic heating is occurring in the solar-wind acceleration region.
Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function
Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.
Multitask methods for predicting molecular properties from heterogeneous data
Data generation remains a bottleneck in training surrogate models to predict molecular properties. We demonstrate that multitask Gaussian process regression overcomes this limitation by leveraging both expensive and cheap data sources. In particular, we consider training sets constructed from coupled-cluster (CC) and density functional theory (DFT) data. We report that multitask surrogates can predict at CC-level accuracy with a reduction in data generation cost by over an order of magnitude. Of note, our approach allows the training set to include DFT data generated by a heterogeneous mix of exchange–correlation functionals without imposing any artificial hierarchy on functional accuracy. More generally, the multitask framework can accommodate a wider range of training set structures—including the full disparity between the different levels of fidelity—than existing kernel approaches based on Δ-learning although we show that the accuracy of the two approaches can be similar. Consequently, multitask regression can be a tool for reducing data generation costs even further by opportunistically exploiting existing data sources.
Prediction of atomization energy using graph kernel and active learning
Data-driven prediction of molecular properties presents unique challenges to the design of machine learning methods concerning data structure/dimensionality, symmetry adaption, and confidence management. In this paper, we present a kernel-based pipeline that can learn and predict the atomization energy of molecules with high accuracy. The framework employs Gaussian process regression to perform predictions based on the similarity between molecules, which is computed using the marginalized graph kernel. To apply the marginalized graph kernel, a spatial adjacency rule is first employed to convert molecules into graphs whose vertices and edges are labeled by elements and interatomic distances, respectively. We then derive formulas for the efficient evaluation of the kernel. Specific functional components for the marginalized graph kernel are proposed, while the effects of the associated hyperparameters on accuracy and predictive confidence are examined. We show that the graph kernel is particularly suitable for predicting extensive properties because its convolutional structure coincides with that of the covariance formula between sums of random variables. Using an active learning procedure, we demonstrate that the proposed method can achieve a mean absolute error of 0.62 ± 0.01 kcal/mol using as few as 2000 training samples on the QM7 dataset.
Order-by-order uncertainties of nucleon-nucleon Wolfenstein amplitudes in chiral effective field theory
Quantum mechanical invariance principles dictate the most general operator structure that can be present in the nucleon-nucleon (NN) interaction. Five independent operators appear in the on-shell NN amplitude together with five corresponding coefficient functions. The usual choice for these coefficient functions is known as the NN Wolfenstein amplitudes. We analyze the order-by-order convergence of each of the five NN Wolfenstein amplitudes predicted by a semilocal coordinate space potential implementation of chiral effective field theory (𝜒EFT). We do this at laboratory kinetic energies between 25 and 200 MeV for both neutron-proton and proton-proton scattering. Our analysis uses the Gaussian-process methods developed by the BUQEYE Collaboration to describe the contributions of each 𝜒EFT order, and so yields truncation uncertainties for each Wolfenstein amplitude that are correlated across scattering angles. We combine information on the size of different orders in the EFT to infer the 𝜒EFT breakdown scale for each amplitude, finding, on average, Λ 𝑏 between 750 and 800 MeV. Furthermore, with this choice of Λ 𝑏 , the EFT truncation uncertainties cover both higher-order results and empirical Wolfenstein amplitudes well for all orders other than the leading order.
Optimizing Discharge Capacity of Li-O 2 Batteries by Design of Air-Electrode Porous Structure: Multifidelity Modeling and Optimization
We develop a new mathematical framework to study the optimal design of air electrode microstructures for lithium-oxygen (Li-O2) batteries. It can eectively reduce the number of expensive experiments for testing dierent air-electrodes, thereby minimizing the cost in the design of Li-O2 batteries. The design parameters to characterize an air-electrode microstructure include the porosity, surface-to-volume ratio, and parameters associated with the pore-size distribution. A surrogate model (also known as response surface) for discharge capacity is rst constructed as a function of these design parameters. The surrogate model is accurate and easy to evaluate such that an optimization can be performed based on it. In particular, a Gaussian process regression method, co-kriging, is employed due to its accuracy and eciency in predicting high-dimensional responses from a combination of multidelity data. Specically, a small amount of data from high-delity simulations are combined with a large number of data obtained from computationally ecient low-delity simulations. The high-delity simulation is based on a multiscale modeling approach that couples the microscale (pore-scale) and macroscale (device-scale) models. Whereas, the low-delity simulation is based on an empirical macroscale model. The constructed response surface provides quantitative understanding and prediction about how air electrode microstructures aect the discharge performance of Li-O2 batteries. The succeeding sensitivity analysis via Sobol indices and optimization via genetic algorithm ultimately oer a reliable guidance on the optimal design of air electrode microstructures. The proposed mathematical framework can be generalized to investigate other new energy storage techniques and materials.
Exact Gaussian processes for massive datasets via non-stationary sparsity-discovering kernels
Abstract A Gaussian Process (GP) is a prominent mathematical framework for stochastic function approximation in science and engineering applications. Its success is largely attributed to the GP’s analytical tractability, robustness, and natural inclusion of uncertainty quantification. Unfortunately, the use of exact GPs is prohibitively expensive for large datasets due to their unfavorable numerical complexity of $$O(N^3)$$ O ( N 3 ) in computation and $$O(N^2)$$ O ( N 2 ) in storage. All existing methods addressing this issue utilize some form of approximation—usually considering subsets of the full dataset or finding representative pseudo-points that render the covariance matrix well-structured and sparse. These approximate methods can lead to inaccuracies in function approximations and often limit the user’s flexibility in designing expressive kernels. Instead of inducing sparsity via data-point geometry and structure, we propose to take advantage of naturally-occurring sparsity by allowing the kernel to discover—instead of induce—sparse structure. The premise of this paper is that the data sets and physical processes modeled by GPs often exhibit natural or implicit sparsities, but commonly-used kernels do not allow us to exploit such sparsity. The core concept of exact, and at the same time sparse GPs relies on kernel definitions that provide enough flexibility to learn and encode not only non-zero but also zero covariances. This principle of ultra-flexible, compactly-supported, and non-stationary kernels, combined with HPC and constrained optimization, lets us scale exact GPs well beyond 5 million data points.
Sharp detection of low-dimensional structure in probability measures via dimensional logarithmic Sobolev inequalities
Identifying low-dimensional structure in high-dimensional probability measures is an essential pre-processing step for efficient sampling. To identify this structure, we approximate the target measure as a perturbation of an arbitrary reference measure along a few directions in $\mathbb{R}^{d}$. These directions are determined by minimizing an upper bound on the Kullback–Leibler (KL) divergence between the target and its approximation. Our contribution improves upon previous works by leveraging dimensional logarithmic Sobolev inequalities to refine the bound on the KL divergence. These inequalities lead to a uniformly tighter bound on the KL divergence, thereby enhancing the identification of the most significant perturbation directions. In particular, when the target and reference are both Gaussian, minimizing the resulting bound is equivalent to minimizing the KL divergence. We further demonstrate the applicability of this analysis to the squared Hellinger distance, where analogous reasoning shows that the dimensional Poincaré inequality offers improved bounds.
Machine learning models for PDE constrained optimization
Partial differential equation (PDE)-constrained optimization problems arise in a variety of scientific and engineering applications, such as topology optimization, electrodynamics, fluid dynamics, and structural dynamics. However, these problems are often challenging and computationally expensive to solve, due to the need to solve the PDEs within the optimization loop. One approach to reducing the computational cost of these methods while providing convergence guarantees is through inexact trust region methods; this method uses lower fidelity solutions of the PDE at early stages of the optimization and adjusts the required accuracy of inexact PDE solvers as the optimization progresses. In this work, we explore the use of machine learning based surrogate models with these inexact trust region methods. We first demonstrate the potential of this approach by using Gaussian processes as the surrogate model and test this on a simple PDE-constrained optimization problem. We then document explorations into improving the computational costs of evolutional deep neural network / neural Galerkin methods, with the eventual goal of using these methods with the inexact trust region algorithms. We are able to speed up these approaches, albeit at the cost of lower accuracy.
Multiscale Modeling of Carbon Fiber Reinforced Polymer (CFRP) for Integrated Computational Materials Engineering Process
In this work, a multiscale modeling framework for CFRP is introduced to study hierarchical structure of CFRP. Four distinct scales are defined: nanoscale, microscale, mesoscale, and macroscale. Information at lower scales can be passed to higher scale, which is beneficial for studying effect of constituents on macroscale part’s mechanical property. This bottom-up modeling approach enables better understanding of CFRP from finest details. Current study focuses on microscale and mesoscale. Representative volume element is used at microscale and mesoscale to model material’s properties. At microscale, unidirection CFRP (UD) RVE is used to study properties of UD. The UD RVE can be modeled with different volumetric fraction to encounter non-uniform fiber distribution in CFRP part. Such consideration is important in modeling uncertainties at microscale level. Currently, we identified volumetric fraction as the only uncertainty parameters in UD RVE. To measure effective material properties of UD RVE, periodic boundary conditions (PBC) are applied to UD RVE to ensure convergence of obtained properties. Properties of UD is directly used at mesoscale woven RVE modeling, where each yarn is assumed to have same properties as UD. Within woven RVE, there can be many potential uncertainties parameters to consider for a physical modeling of CFRP. Currently, we will consider fiber misalignment within yarn and angle between wrap and weft yarns. PBC is applied to woven RVE to calculate its effective material properties. The effect of uncertainties are investigated quantitatively by Gaussian process. Preliminary results of UD and Woven study are analyzed for efficacy of the RVE modeling. This work is considered as the foundation for future multiscale modeling framework development for ICME project.
Necklace-structured high-harmonic generation for low-divergence, soft x-ray harmonic combs with tunable line spacing
The extreme nonlinear optical process of high-harmonic generation (HHG) makes it possible to map the properties of a laser beam onto a radiating electron wave function and, in turn, onto the emitted x-ray light. Bright HHG beams typically emerge from a longitudinal phased distribution of atomic-scale quantum antennae. Here, we form a transverse necklace-shaped phased array of linearly polarized HHG emitters, where orbital angular momentum conservation allows us to tune the line spacing and divergence properties of extreme ultraviolet and soft x-ray high-harmonic combs. The on-axis HHG emission has extremely low divergence, well below that obtained when using Gaussian driving beams, which further decreases with harmonic order. This work provides a new degree of freedom for the design of harmonic combs—particularly in the soft x-ray regime, where very limited options are available. Such harmonic beams can enable more sensitive probes of the fastest correlated charge and spin dynamics in molecules, nanoparticles, and materials.
Galaxy blending effects in deep imaging cosmic shear probes of cosmology
ABSTRACT Upcoming deep imaging surveys such as the Vera C. Rubin Observatory Legacy Survey of Space and Time will be confronted with challenges that come with increased depth. One of the leading systematic errors in deep surveys is the blending of objects due to higher surface density in the more crowded images; a considerable fraction of the galaxies which we hope to use for cosmology analyses will overlap each other on the observed sky. In order to investigate these challenges, we emulate blending in a mock catalogue consisting of galaxies at a depth equivalent to 1.3 yr of the full 10-yr Rubin Observatory that includes effects due to weak lensing, ground-based seeing, and the uncertainties due to extraction of catalogues from imaging data. The emulated catalogue indicates that approximately 12 per cent of the observed galaxies are ‘unrecognized’ blends that contain two or more objects but are detected as one. Using the positions and shears of half a billion distant galaxies, we compute shear–shear correlation functions after selecting tomographic samples in terms of both spectroscopic and photometric redshift bins. We examine the sensitivity of the cosmological parameter estimation to unrecognized blending employing both jackknife and analytical Gaussian covariance estimators. An ∼0.025 decrease in the derived structure growth parameter S8 = σ8(Ωm/0.3)0.5 is seen due to unrecognized blending in both tomographies with a slight additional bias for the photo-z-based tomography. This bias is greater than the 2σ statistical error in measuring S8.