Search NASA⌕ Search

SEARCH · Search NASA

Results for “data reduction techniques”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Understanding and Estimating Error Propagation in Neural Networks for Scientific Data Analysis

Neural networks are increasingly integrated into scientific discovery, where input data reduction and model quantization play a key role in accelerating inference. However, understanding and mitigating the impact of these techniques on output error is critical for ensuring reliable results, particularly in tasks demanding high numerical precision. This paper introduces a comprehensive framework for optimizing neural network inference in scientific computing by combining data reduction and weight quantization while maintaining error-controlled outcomes. We develop theoretical analyses to bound error propagation under these reductions and propose a framework that balances computational performance with error constraints. Evaluation on real-world learning-based combustion simulations and satellite image classification demonstrates that our derived error bounds accurately predict observed errors while enabling significant computational speedup under our framework. This work highlights the potential for further leveraging advancements in modern lossy compression algorithms and hardware accelerators that support lower-precision formats.

He, Weiming [New Jersey Institute of Technology]↗
DOE OSTI2021

Electrochemical measurement and analysis of YCl 3 , ScCl 3 , GdCl 3 and MgCl 2 in molten eutectic LiCl-KCl

For this work, electrochemical measurements of YCl 3 , ScCl 3 , GdCl 3 and MgCl 2 were obtained in molten LiCl-KCl eutectic at 773 K using a three-electrode configuration. Tungsten rods were used as the working and counter electrodes. Two quasi- and one reference electrode(s) (glassy carbon, nickel wire, and Ni/NiO) were used to collect electrochemical measurements of the analyte salts. Cyclic voltammetry data were analyzed to calculate values of diffusion coefficient, exchange current density, and charge transfer resistance and were determined to be on the order of 10 –5 cm 2 s –1 , 10 –2 A cm –2 , and 10 0 Ω; respectively. In general, the values of diffusion coefficients were found to be consistent with those reported of high-temperature molten salts. Relatively large values of exchange current density corresponded with smaller values of charge transfer resistance. These values were found to be reasonable in comparison to results available in the literature. The measured cyclic voltammograms were normalized with respect to both lithium reduction and chloride ion oxidation potentials. Such a normalization technique is effective for comparing experimentally obtained cyclic voltammetry data to those that have been published. An analysis of experimentally obtained results indicates the relation of electrode reactions (e.g., differences of reduction potentials) are independent of the choice of reference electrode. Additionally, the choice of reference electrode did not affect the electrochemical window, exchange current density, or diffusion coefficient values.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Random projection using random quantum circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the “quantum supremacy era.” This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths [ ∼ O ( n ) ] serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets and computing von Neumann entropies of large low-rank density matrices. And finally, using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large data sets in reduced dimensions. Published by the American Physical Society 2024

Kumaran, Keerthi (ORCID:0009000949125721)↗
DOE OSTI2022

Physics-Informed Sparse Gaussian Process for Probabilistic Stability Analysis of Large-Scale Power System with Dynamic PVs and Loads

This work proposes a physics-informed sparse Gaussian process (SGP) for probabilistic stability assessment of large-scale power systems in the presence of uncertain dynamic PVs and loads. The differential and algebraic equations considering uncertainties from dynamic PVs and loads are reformulated to a nonlinear mapping relationship that allows the application of SGP. Thanks to the nonparametric characteristic of Gaussian process, the proposed framework does not require distributions of uncertain inputs and this distinguishes it from existing approaches. As the original Gaussian process is not scalable to large-scale systems with high dimensional uncertain inputs, this paper develops the SGP with a stochastic variational inference technique. It leads to approximately two orders of complex reduction. A data pre-processing step is also introduced to tackle the coexistence of stable and unstable cases by sample clustering and constructing separate SGPs. The probabilistic transient stability index is analyzed to assess system stability under different uncertain dynamics loads and PVs. Comparisons are performed with the sampling-based, the polynomial chaos expansion-based, and traditional Gaussian process-based methods on the modified IEEE 118-bus and Texas 2000-bus systems under various scenarios, including different levels of uncertainties and the existence of nonlinear correlations among dynamic PVs. The impacts of data quality and quantity issues are also investigated. It is shown that the proposed SGP achieves significantly improved computational efficiency while maintaining high accuracy with a limited number of data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Exploration with Scalable Gaussian Process Reinforcement Learning

Exploration is a challenging problem in reinforcement learning (RL), especially in environments with sparse rewards. Quantifying and utilizing the parametric uncertainty has been shown to be paramount for successful exploration [Osband et al., 2018]. Bayesian, or approximately Bayesian, methods present a principled means of estimating the parametric uncertainty in RL problems. Gaussian processes, nonparametric Bayesian models, are often impractical due to poor scalability and computational bottlenecks. We introduce a scalable Gaussian process RL (GPRL) method which directly induces sparsity in the covariance matrix to facilitate faster computation. This is a departure from previous GPRL methods which instead rely on data reduction and subsampling. We compare various covariance-based exploration techniques (Thompson sampling, upper confidence bound, and probabilistic maximum variance) which leverage our scalable GP framework in sparse reward environments. Finally, we show favorable comparison against the bootstrapped deep Q-Network.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Analysis techniques for background rejection at the Majorana Demonstrator

The MAJORANA Collaboration is constructing the MAJORANA DEMONSTRATOR, an ultra-low background, 40-kg modular HPGe detector array to search for neutrinoless double beta decay in 76 Ge. In view of the next generation of tonne-scale Ge-based 0νββ-decay searches that will probe the neutrino mass scale in the inverted-hierarchy region, a major goal of the MAJORANA DEMONSTRATOR is to demonstrate a path forward to achieving a background rate at or below 1 count/tonne/year in the 4 keV region of interest around the Q-value at 2039 keV. The background rejection techniques to be applied to the data include cuts based on data reduction, pulse shape analysis, event coincidences, and time correlations. The Point Contact design of the DEMONSTRATOR's germanium detectors allows for significant reduction of gamma background.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

Research on the DESI Experiment at Southern Methodist University

The SMU observational cosmology group in 2017-2019 continued its work in preparing DESI for operations slated to start in 2020. There are three major developments: a) a real-time spectroscopic data reduction and monitoring software needed for DESI Operations, b) components of spectroscopic simulation needed to support DESI science, and c) techniques and procedures to estimate spectroscopic observational systematics on BAO measurements for emission line galaxies (ELGs). We successfully developed a fast, flexible spectroscopic pipeline incorporating a comprehensive set of data quality algorithms. This included substantial development of data reduction algorithms, as well as the infrastructure to build pipelines for different data types necessary for calibration and science. Effort on data quality included supporting real-time monitoring during operations and long-term data quality needs for analysis. During this period, the SMU team contributed to development of DESI’s 1D spectroscopic simulation solutions, with a flexible pipeline that also mimicked the impact of the offline pipeline. Further work to upgrade the fast, parametric simulation, QuickCat, was also performed. We have also developed an initial methodology for the forward modeling of spectroscopic systematic uncertainties on ELG BAO measurements resulting from observing conditions. Kehoe also contributed to commissioning and science requirements documents, and served in difference service roles during the reporting period.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

A learning-based data-driven forecast approach for predicting future reservoir performance

Quantification of the predictive uncertainty of subsurface models has long been investigated. The traditional workflow is to calibrate prior models to match observed data, and then use the posterior models to simulate future system performance. Not only are these procedures computationally expensive, but they also have issues in maintaining geological model constraints during the calibration step. Data space inversion (DSI) was introduced recently to predict future system performance without the iterative history matching or model calibration step. In general, DSI approaches seek to establish a statistical relationship between the observed and forecast variables, as well as to quantify the predictive uncertainty of the forecast variables, by using an ensemble of uncalibrated prior models. Existing DSI approaches all require a number of complex transformation and mapping operations, which may deter their widespread use. Here in this study, we introduce a new and simpler DSI approach, the learning-based, data-driven forecast approach (LDFA), by combining dimension reduction and machine learning techniques to quickly provide accurate forecast results and reliably quantify corresponding uncertainty in the results. Our LDFA framework is demonstrated using two supervised learning algorithms, artificial neural network (ANN) and support vector regression (SVR), on two representative examples from reservoir engineering and geological carbon storage. Results suggest that our approach provides accurate forecast results (e.g., future oil production rate or cumulative injected CO 2 ) and reasonable predictive uncertainty intervals. Our framework is generic and may be applied to other surface and subsurface problems.

42 ENGINEERING↗
DOE OSTI2021

A demonstration of improved constraints on primordial gravitational waves with delensing

We present a constraint on the tensor-to-scalar ratio, $r$, derived from measurements of cosmic microwave background (CMB) polarization $B$-modes with "delensing,'' whereby the uncertainty on $r$ contributed by the sample variance of the gravitational lensing $B$-modes is reduced by cross-correlating against a lensing $B$-mode template. This template is constructed by combining an estimate of the polarized CMB with a tracer of the projected large-scale structure. The large-scale-structure tracer used is a map of the cosmic infrared background derived from Planck satellite data, while the polarized CMB map comes from a combination of South Pole Telescope, BICEP/Keck, and Planck data. We expand the BICEP/Keck likelihood analysis framework to accept a lensing template and apply it to the BICEP/Keck data set collected through 2014 using the same parametric foreground modelling as in the previous analysis. From simulations, we find that the uncertainty on $r$ is reduced by $\sim10\%$, from $\sigma(r)$= 0.024 to 0.022, which can be compared with a $\sim26\%$ reduction obtained when using a perfect lensing template. Applying the technique to the real data, the constraint on $r$ is improved from $r_{0.05} < 0.090$ to $r_{0.05} < 0.082$ (95% C.L.). Furthermore, this is the first demonstration of improvement in an $r$ constraint through delensing.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Multidimensional Numerical Simulations of Knocking Combustion in a Cooperative Fuel Research Engine

A numerical approach was developed based on multidimensional computational fluid dynamics (CFD) to predict knocking combustion in a cooperative fuel research (CFR) engine. G-equation model was employed to track the turbulent flame front and a multizone model was used to capture auto-ignition in the end-gas. Furthermore, a novel methodology was developed wherein a lookup table generated from a chemical kinetic mechanism could be employed to provide laminar flame speed as an input to the Gequation model, instead of using empirical correlations. To account for fuel chemistry effects accurately and lower the computational cost, a compact 121-species primary reference fuel (PRF) skeletal mechanism was developed from a detailed gasoline surrogate mechanism using the directed relation graph (DRG) assisted sensitivity analysis (DRGASA) reduction technique. Extensive validation of the skeletal mechanism was performed against experimental data available from the literature on both homogeneous ignition delay and laminar flame speed. The skeletal mechanism was used to generate lookup tables for laminar flame speed as a function of pressure, temperature, and equivalence ratio. The numerical model incorporating the skeletal mechanism was employed to perform simulations under research octane number (RON) and motor octane number (MON) conditions for two different PRFs. Parametric tests were conducted at different compression ratios (CR) and the predicted values of critical CR, delineating the boundary between “no knock” and “knock,” were found to be in good agreement with available experimental data. The virtual CFR engine model was, therefore, demonstrated to be capable of adequately capturing the sensitivity of knock propensity to fuel chemistry.

CFD↗
DOE OSTI2017

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even when gradient information can be computed efficiently. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this paper, we propose a novel Bayesian stochastic inversion methodology, which is characterized by a tight coupling between the gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated parameter space. In addition, non-Gaussian posterior distributions are estimated via an efficient LMCMC method on the projected low-dimensional feature space. We will demonstrate this computational framework by integrating and adapting our recent data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to a linear elasticity model.

42 ENGINEERING↗
DOE OSTI2018

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The Cost of Decarbonization and Energy Upgrade Retrofits for US Homes

Cost is a major barrier when upgrading homes to reduce carbon emissions required to meet DOE’s climate-related goals. This report summarizes a nationwide effort to gather home energy upgrade project cost data along with household energy performance data. The goal was to develop cost benchmarks and to guide future R&D efforts aimed at cost compression and scaling of the residential upgrade market. The cost data were compiled for both total project costs and costs of individual measures. The majority of energy savings were modeled, with some models using measured site data for calibration. The database was analyzed using clustering techniques to find common energy and CO2 reduction approaches. The individual measures were combined into archetypal solutions to determine least-cost approaches to maximizing energy and carbon savings. Several financial analyses were preformed to examine other cost metrics beyond first cost. Project data was obtained for 1,739 projects, from 15 states and 12 energy programs, with a total of 10,512 individual measures. The database includes a wide-array of projects, ranging from single-measure HVAC upgrades to net-zero energy whole home remodels. Projects were predominantly single-family detached dwellings with wood frame construction. Most of the data was obtained from energy programs because they had recorded the necessary information and were willing to share with this study. This sample of convenience can provide broad guidance and national cost benchmarks, but lacks sufficient detail to draw more disaggregated conclusions, such as geographical trends. The majority of data contributions were obtained without compensation from sources where the required data was already in some sort of structured format. We compensated sources to enter data from individual projects into a structured data format for about 500 projects, with an average cost of about $40 per project. The database was highly skewed to lower cost, lower impact projects due to the nature of the sample of convenience. Less than 10% of projects had savings greater than 50%. The cost data for individual measures in the database are being used in other DOE efforts on residential energy use/decarbonization. This data collection effort should continue in order to provide the best-informed guidance for DOE and industry R&D, as well as deployment efforts (including policy and program planning).

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2019

Using Machine Learning to Discern Eruption in Noisy Environments: A Case Study Using CO2-Driven Cold-Water Geyser in Chimayó, New Mexico

In this paper, we present an approach based on machine learning (ML) to distinguish eruption and precursory signals of Chimayó geyser (New Mexico, U.S.A.) under noisy environmental conditions. This geyser can be considered a natural analog of CO 2 intrusion into shallow water aquifers. By studying this geyser, we can understand upwelling of CO 2 -rich fluids from depth, which has relevance to leak monitoring in a CO 2 sequestration project. ML methods such as random forests (RFs) are known to be robust multiclass classifiers and perform well under unfavorable, noisy conditions. However, the extent of the RF method’s accuracy is poorly understood for this CO 2 -driven geysering application. The current study aims to quantify the performance of RF classifiers to discern the geyser state. Toward this goal, we first present the data collected from the seismometer that is installed near the Chimayó geyser. The seismic signals collected at this site contain different types of noises such as daily temperature variations, animal movement near the geyser, and human activity. First, we filter the signals from these noises by combining the Butterworth high-pass (BH) filter and an autoregressive (AR) method in a multilevel fashion. We show that by combining these filtering techniques in a hierarchical fashion leads to a reduction in noise in the seismic data without removing the precursors and eruption event signals. We then use RF on the filtered data to classify the state of geyser into three classes: remnant noise, precursor, and eruption states. RF classifier is constructed based on the comprehensive features extracted using the Tsfresh Python package. We show that the classification accuracy using RF on the filtered data is greater than 90%. We also evaluate the accuracy of other classical time-series methods such as dynamic time warping (DTW) on filtered data along with RF on partially filtered data in which we remove the daily trends. Classification accuracy shows that DTW performs poorly (44%) and RF on partially filtered data performs decently (87%). Denoising seismic signals from both daily trends and human activity enhances RF classifier performance by 7%. Finally, these aspects make the proposed ML framework attractive for event discrimination and signal enhancement under noisy conditions, with strong potential for application to monitor leaks in CO 2 sequestration.

58 GEOSCIENCES↗
DOE OSTI2019

Forecasting district-scale energy dynamics through integrating building network and long short-term memory learning algorithm

With the development of data-driven techniques, building energy prediction on a district level has attracted increasing attention in recent years for revealing energy use patterns and reduction potentials. However, data acquisition in large building groups is difficult and adjacent buildings also interact with each other. To reduce data cost and incorporate the inter-building impact with the data-driven building energy model, this study proposes a deep learning predictive approach that fuses the building network model with a long short-term memory learning model for district-scale building energy modeling. The building network was constructed based on correlations between the energy use intensity of buildings, which can significantly reduce the computational complexity of the deep learning models for energy dynamic prediction. Five typical building groups with energy use data from 2015 to 2018 on two institutional campuses were selected to perform the validation experiment with TensorFlow. Based on the prediction error assessments, the results suggest that for total building energy use intensity prediction, the proposed model can achieve a mean absolute percentage error of 6.66% and a root mean square error of 0.36 kWh/m 2 , compared to 12.05% and 0.63 kWh/m 2 of the conventional artificial neural network model and to 11.06% and 0.89 kWh/m 2 for the support vector regression model.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Efficient Dimension Reduction of Complex Three-dimensional CO2 Saturation using Deep Learning Models

In the domain of deep learning (DL), dimension reduction is crucial for enhancing training efficiency and mitigating overfitting, particularly when managing complex data such as three-dimensional (3D) saturation data. The 3D saturation data in the context of geological carbon storage (GCS) presents unique challenges due to its inherent sparsity and the abrupt transitions at plume boundaries, known as shock fronts. To address the challenges, we proposed a novel DL framework that integrates dimension reduction with advanced 3D reconstruction techniques. Our model leveraged latent variables derived from 2D average saturation data, offering a robust and efficient solution tailored to the intricate dynamics of 3D saturation fields. The proposed framework can extract the critical features of the high-dimensional data while reducing the variable numbers, which is more tractable for DL models and enhances the model robustness and accuracy. Therefore, it provides a novel approach for modeling and analyses in complex geological scenarios, which finds great potential applications in environmental monitoring and energy storage.

Wang, Hongsheng↗
DOE OSTI2020

Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution

To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cuts correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as zfp[52], idx[58], and jpeg2000 [76]. Lastly, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible and orders of magnitude faster, and requiring significantly reduced resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Novel Histogram Based Unsupervised Classification Technique to Determine Natural Classes From Biophysically Relevant Fit Parameters to Hyperspectral Data

Hyperspectral image analysis has benefited from an array of methods that take advantage of the increased spectral depth compared to multispectral sensors; however, the focus of these developments has been on supervised classification methods. Lack of a priori knowledge regarding land cover characteristics can make unsupervised classification methods preferable under certain circumstances. An unsupervised classification technique is presented in this paper that utilizes physically relevant basis functions to model the reflectance spectra. These fit parameters used to generate the basis functions allow clustering based on spectral characteristics rather than spectral channels and provide both noise and data reduction. Histogram splitting of the fit parameters is then used as a means of producing an unsupervised classification. Unlike current unsupervised classification techniques that rely primarily on Euclidian distance measures to determine similarity, the unsupervised classification technique uses the natural splitting of the fit parameters associated with the basis functions creating clusters that are similar in terms of physical parameters. The data set used in this work utilizes the publicly available data collected at Indian Pines, Indiana. This data set provides reference data allowing for comparisons of the efficacy of different unsupervised data analysis. The unsupervised histogram splitting technique presented in this paper is shown to be better than the standard unsupervised ISODATA clustering technique with an overall accuracy of 34.3/19.0% before merging and 40.9/39.2% after merging. Finally, this improvement is also seen as an improvement of kappa before/after merging of 24.8/30.5 for the histogram splitting technique compared to 15.8/28.5 for ISODATA.

58 GEOSCIENCES↗