Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse 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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Jet Stream Analysis and Forecast Errors Using GADS Aircraft Observations in the DAO, ECMWF, and NCEP Models

We have utilized an extensive set of independent British Airways flight data recording wind vector and temperature observations (the Global Aircraft Data Set [GADS] archive) in three ways: (a) as an independent check of operational analyses; (b) as an analysis observing system experiment (OSE) as if the GADS observations were available in real time; and (c) as the corresponding forecast simulation experiment applicable to future operational forecasts. Using a 31 day sample (0000 UTC 20 December 2000 through 0000 UTC 20 January 2000) from Winter 2000, we conclude that over the data-dense continental U. S. analyzed jet streaks are too weak by -2% to -5%. Over nearby data-sparse regions of Canada, analyzed jet streaks are too weak by -5% to -9%. The second range provides a limit on the accuracy of current jet streak analyses over the portions of the -85% of the earth's surface that are poorly covered by non-satellite observations. The -5% to -9% range is relevant for the pre-third generation satellite (AIRS, IASI, GIFTS) era.

Cardinali, Carla↗
DOE OSTI2024

Physics-Informed Active Learning With Simultaneous Weak-Form Latent Space Dynamics Identification

The parametric greedy latent space dynamics identification (gLaSDI) framework has demonstrated promising potential for accurate and efficient modeling of high-dimensional nonlinear physical systems. However, it remains challenging to handle noisy data. Here, to enhance robustness against noise, we incorporate the weak-form estimation of nonlinear dynamics (WENDy) into gLaSDI. In the proposed weak-form gLaSDI (WgLaSDI) framework, an autoencoder and WENDy are trained simultaneously to discover intrinsic nonlinear latent-space dynamics of high-dimensional data. Compared with the standard sparse identification of nonlinear dynamics (SINDy) employed in gLaSDI, WENDy enables variance reduction and robust latent space discovery, therefore leading to more accurate and efficient reduced-order modeling. Furthermore, the greedy physics-informed active learning in WgLaSDI enables adaptive sampling of optimal training data on the fly for enhanced modeling accuracy. The effectiveness of the proposed framework is demonstrated by modeling various nonlinear dynamical problems, including viscous and inviscid Burgers' equations, time-dependent radial advection, and the Vlasov equation for plasma physics. With data that contains 5%–10% Gaussian white noise, WgLaSDI outperforms gLaSDI by orders of magnitude, achieving 1%–7% relative errors. Compared with the high-fidelity models, WgLaSDI achieves 121 to 1779x speed-up.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2021

Chapter 10: Development of a Precipitation Retrieval Scheme for Cross-track Passive Microwave Sounding Instruments

The measurement of precipitation (snowfall and rainfall) across the globe is of great importance to both science and society. Despite the importance, measurements from surface-based instruments are limited in extent and are generally absent from sparsely populated or inhospitable regions, including over the world’s oceans. Satellite-based observations have the potential to provide the necessary information to generate estimates of precipitation across the whole of the Earth’s surface. However, adequate temporal and spatial sampling is required to capture vagaries of precipitation and it is necessary to exploit all possible satellite (and, where appropriate surface) information. While much research has been carried out into the retrieval of precipitation from observations gathered by conically-scanning passive microwave imagers in previous decades, relatively little has been done to fully utilise the observations from the cross-track scanning passive microwave sounding instruments. This paper will review a number of cross-track precipitation retrieval schemes, together an evaluation of their performance, and future directions.

Precipitation retrievals↗
DOE OSTI2022

Geothermal Fault Zone and Fluid Imaging through Joint Airborne ZTEM and Ground MT Data Inversion Analysis

This project has aimed to achieve detailed electrical resistivity resolution at geothermal reservoir scales by combining airborne natural electromagnetic (EM) field surveying (ZTEM) with ground magnetotelluric (MT) measurements to approximate an airborne MT geophysical method. MT alone is relatively expensive and may have permitting challenges in sensitive areas. Airborne ZTEM field data contains only the magnetic field, requires a background assumption, and has been limited to relatively high frequencies, thus suffering uniqueness problems. Based on proto-type 2D simulations, ZTEM ambiguities may be reduced through formal incorporation with possibly sparse ground MT soundings, which we pursued in full 3D for this project. The methodology was tested at the high-temperature Roosevelt Hot Springs geothermal system, Utah, which was considered advantageous given the near total exposure of crystalline reservoir rocks across the project area. ZTEM and ground MT survey data were acquired in 2017, subcontracted to outside parties with which we have worked in the past. These included 80 remote-referenced tensor MT soundings over the Mineral Mountains and adjacent Roosevelt Hot Spring producing geothermal system. These MT stations abut later coverage of a similar number of MT stations taken for the Utah FORGE project providing excellent total data aperture to re-solve structure beneath both project areas better than either set alone. The airborne ZTEM survey covered 704 line kilometers in E-W flight lines with a 250 m line spacing. Although this survey was timed during a maintenance-related shutdown of power production at the Roosevelt Hot Springs, other noise sources difficult to identify but including two high-voltage state-scale transmission lines compromised the ZTEM survey badly leading to unusable responses. Thus, with DOE management concurrence, the project proceeded to emphasize inversion and interpretation of the joint SubTER-FORGE MT data sets with regard to the Roosevelt Hot Springs reservoir recharge and to deep heat sources for both it and the Utah FORGE EGS project area. We also investigated the joint ZTEM-MT sampling concept with data sets from the Eleven Mile Canyon prospect area donated by the U.S. Navy (A. Sabin, PoC). Inversion of the SubTER-FORGE MT data using the HexMT 3D finite element algorithm reveals a large, low-resistivity anomaly extending sub-vertically through the depth range of the crust beneath the western Mineral Mountains. The steep conductive zone connects in the lower crust to a more tabular conductor characteristic of much of the Great Basin that generally is ascribed to current mafic magmatic underplating, hybridization and fluid release. The location of the resolved anomaly relative to the recent (0.5-0.8 Ma) eruptive centers of the Mineral Mountains implicates it as remnants of the magma body which fed these centers. This structure appears to be currently feeding heat and fluids upward into the Roosevelt Hot Springs hydrothermal system, as well as heat laterally to the FORGE project area. Separate and joint inversion models were carried out for the donated Eleven Mile Canyon MT-ZTEM data set to demonstrate concept. ZTEM only inversion showed two main alteration zones in the western portion of the project area known from geological mapping. Joint inversion including an E-W profile of MT soundings sharpened these features considerably. It also resolved in much greater detail the graben related normal faulting structure of the central project area which lies at depths exceeding the sensitivity of ZTEM alone. The sparse number of MT da-ta relative to the ZTEM required upweighting the former by a factor of several, but an exact procedure awaits future research. Our final impression is that sparse MT data can improve resolution of the subsurface over that of ZTEM alone. However, well sampled MT data are to be preferred and offer the simplicity of interpreting just one data type, and possess the superior resolution capability coming with the electric field everywhere, and from their high bandwidth.

15 GEOTHERMAL ENERGY↗
DOE OSTI2023

Latent code-based fusion: A Volterra neural network approach

We propose a deep structure encoder using Volterra Neural Networks (VNNs) to seek a latent representation of multi-modal data whose features are jointly captured by a union of subspaces. The so-called self-representation embedding of the latent codes leads to a simplified fusion which is driven by a similarly constructed decoding. The Volterra Filter architecture achieved reduction in parameter complexity is primarily due to controlled non-linearities being introduced by the higher-order convolutions in lieu of generalized activation functions. Experimental results on two different datasets have shown a significant improvement in the clustering performance for VNNs auto-encoder over conventional Convolutional Neural Networks (CNNs) auto-encoder. In addition, we also show that the proposed approach demonstrates a much-improved sample complexity over CNN-based auto-encoder with a robust classification performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Bayesian differential programming for robust systems identification under uncertainty

This paper presents a machine learning framework for Bayesian systems identification from noisy, sparse and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of recent developments in differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling. This allows an efficient inference of the posterior distributions over plausible models with quantified uncertainty, while the use of sparsity-promoting priors enables the discovery of interpretable and parsimonious representations for the underlying latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed methods, including nonlinear oscillators, predator–prey systems and examples from systems biology. Taken together, our findings put forth a flexible and robust workflow for data-driven model discovery under uncertainty. All codes and data accompanying this article are available at https://bit.ly/34FOJMj .

Science & Technology - Other Topics↗
DOE OSTI2022

Deterministic and Monte Carlo Nuclear Data Adjustment Methods [Slides]

For the Bayesian Monte Carlo methodology, a need to understand convergence of the posterior moments as a function of the number of parameter realizations is required. In high-dimensional systems, it can be very costly to sample entire parameter space and perform functional evaluation for every realization. Bayesian Monte Carlo allows one to relax the GLLS approximations of model linearity and prior/posterior PDF shape. The Bayesian Stochastic Collocation Method is a deterministic approach to “sample” the parameter space. It allows one to relax the GLLS approximations of model linearity and posterior PDF shape. Higher-order posterior moments (i.e., skewness, kurtosis, etc.) can be studied through polynomial expansion. Tensor product quadrature scales poorly and can use sparse grid quadrature methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learning

Large language models (LLMs) are increasingly adapted to downstream tasks via reinforcement learning (RL) methods like Group Relative Policy Optimization (GRPO), which often require thousands of rollouts to learn new tasks. We argue that the interpretable nature of language often provides a much richer learning medium for LLMs, compared to policy gradients derived from sparse, scalar rewards. To test this, we introduce GEPA (Genetic-Pareto), a prompt optimizer that thoroughly incorporates natural language reflection to learn high-level rules from trial and error. Given any AI system containing one or more LLM prompts, GEPA samples trajectories (e.g., reasoning, tool calls, and tool outputs) and reflects on them in natural language to diagnose problems, propose and test prompt updates, and combine complementary lessons from the Pareto frontier of its own attempts. As a result of GEPA's design, it can often turn even just a few rollouts into a large quality gain. Across six tasks, GEPA outperforms GRPO by 6% on average and by up to 20%, while using up to 35x fewer rollouts. GEPA also outperforms the leading prompt optimizer, MIPROv2, by over 10% (e.g., +12% accuracy on AIME-2025), and demonstrates promising results as an inference-time search strategy for code optimization. We release our code at https://github.com/gepa-ai/gepa.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness

The challenge of quantifying uncertainty propagation in real-world systems is rooted in the high-dimensionality of the stochastic input and the frequent lack of explicit knowledge of its probability distribution. Traditional approaches show limitations for such problems, especially when the size of the training data is limited. To address these diculties, we have developed a general framework of constructing surrogate models on spaces of stochastic input with arbitrary probability measure irrespective of the mutual dependencies between individual components of the random inputs and the analytical form. The present Data-driven Sparsity-enhancing Rotation for Arbitrary Randomness (DSRAR) framework includes a data-driven construction of multivariate polynomial basis for arbitrary mutually dependent probability measure and a sparsity enhancement rotation procedure. This sparsity-enhancing rotation method was initially proposed in our previous work [1] for Gaussian density distributions, which may not be feasible for non-Gaussian distributions due to the loss of orthogonality after the rotation. To remedy such diculties, we developed a new data-driven approach to construct orthonormal polynomials for polynomials for arbitrary mutually dependent (amdP) randomness, ensuring the constructed basis maintains the orthogonality/near-orthogonality with respect to the density of the rotated random vector, where directly applying the regular polynomial chaos including arbitrary polynomial chaos (aPC) [2] shows limitations due to the assumption of the mutual independence between the components of the random inputs. The developed DSRAR framework leads to accurate recovery, with only limited training data, of a sparse representation of the target functions. The eectiveness of our method is demonstrated in challenging problems such as PDEs and realistic molecular systems within high-dimensional conformational space (O(10)) where the underlying density is implicitly represented by a large collection of sample data, as well as systems with explicitly given non-Gaussian probabilistic measures.

Lei, Huan↗
DOE OSTI2012

Compressed sensing for phase contrast CT

Modern x-ray techniques opened the possibility to retrieve phase information. Phase-contrast computed tomography (PCCT) has the potential to significantly improve soft tissue contrast. Radiation dose, however, continues to be an issue when moving from bench to bedside. Dose reduction in this work is achieved by sparsely acquiring PCCT data. To compensate for appearing aliasing artifacts we introduce a compressed sensing (CS) reconstruction framework. We present the feasibility of CS on PCCT with numerical as well as measured phantom data. The results proof that CS compensates for under-sampling artifacts and maintains the superior soft tissue contrast and detail visibility in the reconstructed images.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Reconstructing high-dimensional Hilbert-valued functions via compressed sensing

We present and analyze a novel sparse polynomial technique for approximating high-dimensional Hilbert-valued functions, with application to parameterized partial differential equations (PDEs) with deterministic and stochastic inputs. Our theoretical framework treats the function approximation problem as a joint sparse recovery problem, where the set of jointly sparse vectors is possibly infinite. To achieve the simultaneous reconstruction of Hilbert-valued functions in both parametric domain and Hilbert space, we propose a novel mixed-norm based `1 regularization method that exploits both energy and sparsity. Our approach requires extensions of concepts such as the restricted isometry and null space properties, allowing us to prove recovery guarantees for sparse Hilbert-valued function reconstruction. We complement the enclosed theory with an algorithm for Hilbert-valued recovery, based on standard forward-backward algorithm, meanwhile establishing its strong convergence in the considered infinite-dimensional setting. Finally, we demonstrate the minimal sample complexity requirements of our approach, relative to other popular methods, with numerical experiments approximating the solutions of high-dimensional parameterized elliptic PDEs.

Dexter, Nick↗
DOE OSTI2016

Cadmium and mercury exposure over time in Swedish children

Purpose: Knowledge about changes in exposure to toxic metals over time remains very sparse, in particular for children, the most vulnerable group. Here, we assessed whether a reduction in environmental pollution with cadmium (Cd) and mercury (Hg) caused a change in exposure over time. In total, 1257 children (age 4–9) in two towns in Sweden were sampled once in 1986–2013. Blood concentrations of Cd (b-Cd; n=1120) and Hg (b-Hg; n=560) were determined. Results: The median b-Cd was 0.10 (geometric mean 0.10; range 0.010–0.61) μg/L and b-Hg was 0.91 (geometric mean 0.83; range 0.021–8.2) μg/L. Children living close to a smelter had higher b-Cd and b-Hg than those in urban and rural areas. There was no sex difference in b-Cd or b-Hg, and b-Cd and b-Hg showed no significant accumulation by age. b-Cd decreased only slightly (0.7% per year, p<0.001) over the study period. In contrast, b-Hg did show a clear decrease over the study period (3% per year, p<0.001). Conclusions: The exposure to Cd was very low but still might increase the risk of disease later in life. Moreover, b-Cd only showed a minor decrease, indicating that Cd pollution should be further restricted. b-Hg was relatively low and decreasing, probably because of reduced use of dental amalgam and lower Hg intake from fish. The b-Cd and b-Hg levels decreased much less than the levels of lead in the blood as previously found in the same children. - Highlights: • There are few studies of time trends for exposure to toxic metals, except for lead. • 1986–2013 we studied blood levels of cadmium and mercury in 1257 Swedish children. • The median blood concentration of cadmium was 0.10 μg/L, of mercury 0.83 μg/L. • Cadmium perhaps decreased by 0.7% per year, mercury by 3% per year. • Cadmium accumulation may result in toxic levels in elderly women.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Quantifying uncertainty for deep learning based forecasting and flow-reconstruction using neural architecture search ensembles

Classical problems in computational physics such as data-driven forecasting and signal reconstruction from sparse sensors have recently seen an explosion in deep neural network (DNN) based algorithmic approaches. However, most DNN models do not provide uncertainty estimates, which are crucial for establishing the trustworthiness of these techniques in downstream decision making tasks and scenarios. In recent years, ensemble-based methods have achieved significant success for the uncertainty quantification in DNNs on a number of benchmark problems. However, their performance on real-world applications remains under-explored. In this work, we present an automated approach to DNN discovery and demonstrate how this may also be utilized for ensemble-based uncertainty quantification. Specifically, we propose the use of a scalable neural and hyperparameter architecture search for discovering an ensemble of DNN models for complex dynamical systems. We highlight how the proposed method not only discovers high-performing neural network ensembles for our tasks, but also quantifies uncertainty seamlessly. This is achieved by using genetic algorithms and Bayesian optimization for sampling the search space of neural network architectures and hyperparameters. Subsequently, a model selection approach is used to identify candidate models for an ensemble set construction. Afterwards, a variance decomposition approach is used to estimate the uncertainty of the predictions from the ensemble. We demonstrate the feasibility of this framework for two tasks — forecasting from historical data and flow reconstruction from sparse sensors for the sea-surface temperature. In conclusion, we demonstrate superior performance from the ensemble in contrast with individual high-performing models and other benchmarks.

Deep ensembles↗
DOE OSTI2020

Active Learning A Neural Network Model For Gold Clusters & Bulk From Sparse First Principles Training Data

Small metal clusters are of fundamental scientific interest and of tremendous significance in catalysis. These nanoscale clusters display diverse geometries and structural motifs depending on the cluster size; a knowledge of this size-dependent structural motifs and their dynamical evolution has been of longstanding interest. Given the high computational cost of first-principles calculations, molecular modeling and atomistic simulations such as molecular dynamics (MD) has proven to be an important complementary tool to aid this understanding. Classical MD typically employ predefined functional forms which limits their ability to capture such complex size-dependent structural and dynamical transformation. Neural Network (NN) based potentials represent flexible alternatives and in principle, well-trained NN potentials can provide high level of flexibility, transferability and accuracy on-par with the reference model used for training. A major challenge, however, is that NN models are interpolative and requires large quantities (similar to 10 4 or greater) of training data to ensure that the model adequately samples the energy landscape both near and far-from-equilibrium. A highly desirable goal is minimize the number of training data, especially if the underlying reference model is first-principles based and hence expensive. In this work, we introduce an active learning (AL) scheme that trains a NN model on-the-fly with minimal amount of first-principles based training data. Our AL workflow is initiated with a sparse training dataset (similar to 1 to 5 data points) and is updated on-the-fly via a Nested Ensemble Monte Carlo scheme that iteratively queries the energy landscape in regions of failure and updates the training pool to improve the network performance. Using a representative system of gold clusters, we demonstrate that our AL workflow can train a NN with similar to 500 total reference calculations. Using an extensive DFT test set of similar to 1100 configurations, we show that our AL-NN is able to accurately predict both the DFT energies and the forces for clusters of a myriad of different sizes. Our NN predictions are within 30 meV/atom and 40 meV/angstrom of the reference DFT calculations. Moreover, our AL-NN model also adequately captures the various size-dependent structural and dynamical properties of gold clusters in excellent agreement with DFT calculations and available experiments. We finally show that our AL-NN model also captures bulk properties reasonably well, even though they were not included in the training data.

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

Nonconvex regularization for sparse neural networks

Convex ℓ 1 regularization using an infinite dictionary of neurons has been suggested for constructing neural networks with desired approximation guarantees, but can be affected by an arbitrary amount of over-parametrization. This can lead to a loss of sparsity and result in networks with too many active neurons for the given data, in particular if the number of data samples is large. As a remedy, in this paper, a nonconvex regularization method is investigated in the context of shallow ReLU networks: We prove that in contrast to the convex approach, any resulting (locally optimal) network is finite even in the presence of infinite data (i.e., if the data distribution is known and the limiting case of infinite samples is considered). Moreover, here we show that approximation guarantees and existing bounds on the network size for finite data are maintained.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques

Optimization of simulation-based or data-driven systems is a challenging task, which has attracted significant attention in the recent literature. A very efficient approach for optimizing systems without analytical expressions is through fitting surrogate models. Due to their increased flexibility, nonlinear interpolating functions, such as radial basis functions and Kriging, have been predominantly used as surrogates for data-driven optimization; however, these methods lead to complex nonconvex formulations. Alternatively, commonly used regression-based surrogates lead to simpler formulations, but they are less flexible and inaccurate if the form is not known a priori. In this work, we investigate the efficiency of subset selection regression techniques for developing surrogate functions that balance both accuracy and complexity. Subset selection creates sparse regression models by selecting only a subset of original features, which are linearly combined to generate a diverse set of surrogate models. Five different subset selection techniques are compared with commonly used nonlinear interpolating surrogate functions with respect to optimization solution accuracy, computation time, sampling requirements, and model sparsity. Furthermore, our results indicate that subset selection-based regression functions exhibit promising performance when the dimensionality is low, while interpolation performs better for higher dimensional problems.

42 ENGINEERING↗