Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parameterization method”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Initial Uncertainty Analysis of Carbon Tetrachloride Contamination and Remediation in the Ringold A and Lower Mud Units at the Central Plateau

The long-term effectiveness of groundwater cleanup at the Hanford Site Central Plateau depends on predictive models that can capture key uncertainties in contaminant fate and transport. Carbon tetrachloride (CCl 4 ), a persistent and toxic compound, presents particular challenges due to variability in degradation rates, uncertainty in initial plume distribution, and subsurface heterogeneity. These uncertainties directly influence plume persistence, migration pathways, and remedy performance, and thus must be systematically evaluated to support long-term remediation planning. To address these gaps, a large-scale Monte Carlo analysis was conducted using the Plateau to River (P2R) model framework. The modeling approach parameterized three primary uncertainty factors: (1) degradation rate, (2) initial plume distribution, and (3) hydraulic conductivity. Degradation was represented as a first-order process, with half-lives ranging from 70 to 700 years. Initial plume distributions were created using a geostatistical simulation method (sgsim), which generates many equally plausible versions of how contaminants might be distributed underground. From this, 100 different scenarios were mapped onto the P2R grid. Variability in hydraulic conductivity was represented in a similar way, with 100 scenarios each for the Ringold Lower Mud and Ringold A units (layers 6 and 7), based on fitted exponential variograms and conditioned to well data. In total, more than 1000 realizations were simulated to assess plume behavior under uncertainty. Results demonstrate that degradation kinetics exert the strongest control over plume persistence: Shorter half-lives produced rapid mass reduction, while longer half-lives yielded persistent plumes with limited attenuation. A nonlinear response was observed, with steep mass reductions at half-lives greater than 200 years and near-linear declines beyond this threshold, reflecting interactions between degradation and pumping. The initial plume distribution strongly influenced early transport patterns, with broader sources generating larger plume footprints, although pump-and-treat operations constrained plume migration to managed areas. By comparison, hydraulic conductivity variability in the Ringold units had only a secondary influence, modifying spreading behavior without altering the dominant migration pathways governed by source configuration and hydraulic controls. Overall, the analysis highlights that uncertainty in degradation rate and initial plume configuration are the primary drivers of variability in plume predictions, while conductivity heterogeneity plays a limited role. These findings underscore the need for improved site-specific data on degradation processes and source characterization to enhance the reliability of long-term performance assessments and to better inform remedial decision-making at the Central Plateau.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Reparameterizing Litter Decomposition Using a Simplified Monte Carlo Method Improves Litter Decay Simulated by a Microbial Model and Alters Bioenergy Soil Carbon Estimates

Litter decomposition determines soil organic matter (SOM) formation and plant-available nutrient cycles. Therefore, accurate model representation of litter decomposition is critical to improving soil carbon (C) projections of bioenergy feedstocks. Soil C models that simulate microbial physiology (i.e., microbial models) are new to bioenergy agriculture, and their parameterization is often based on small datasets or manual calibration to reach benchmarks. Here, we reparameterized litter decomposition in a microbial soil C model (CORPSE - Carbon, Organisms, Rhizosphere, and Protection in the Soil Environment) using the continental-scale Long-term Inter-site Decomposition Experiment Team (LIDET) dataset which documents decomposition across a range of litter qualities over a decade. Here, we conducted a simplified Monte Carlo simulation that constrained parameter values to reduce computational costs. The LIDET-derived parameters improved modeled C and nitrogen (N) remaining, decomposition rates, and litter mean residence times as compared to Baseline parameters. We applied the LIDET litter decomposition parameters to a microbial bioenergy model (Fixation and Uptake of Nitrogen – Bioenergy Carbon, Rhizosphere, Organisms, and Protection) to examine soil C estimates generated by Baseline and LIDET parameters. LIDET parameters increased estimated soil C in bioenergy feedstocks, with even greater increases under elevated plant inputs (i.e., by increasing residue, N fertilization). This was due to the integrated effects of plant litter quantity, quality, and agricultural practices (tillage, fertilization). Collectively, we developed a simple framework for using large-scale datasets to inform the parameterization of microbial models that impacts projections of soil C for bioenergy feedstocks.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Higher-order LaSDI: Reduced order modeling with multiple time derivatives

Solving complex partial differential equations (PDEs) is essential across scientific disciplines but often requires numerical models that can be prohibitively expensive in time-sensitive applications. Reduced-order models (ROMs) address this challenge by exploiting low-dimensional structure to create fast approximations. The Latent Space Dynamics Identification (LaSDI) framework has demonstrated success in learning ROMs for parameterized PDE families, but remains limited to first-order systems. Here, in this paper, we propose Higher-Order LaSDI (HLaSDI), which extends the LaSDI framework to PDEs with arbitrary order of time derivatives. This generalization significantly expands the applicability of LaSDI-based methods to systems previously outside their scope, including hyperbolic PDEs. We demonstrate HLaSDI’s accuracy and efficiency on several linear and nonlinear benchmark problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Animal movement estimation and network-based epidemic modeling: Illustration for the swine industry in Iowa (US)

Animal movement plays a critical role in disease transmission between farms. However, in the United States, the lack of available animal shipment data, sometimes coupled with a lack of detailed information about farm demographics and characteristics, presents great challenges for epidemic modeling and prediction. In this study, we proposed a new method based on the maximum entropy to generate “synthetic” animal movement networks, considering available statistics about the premises operation type, operation size, and the distance between premises. We illustrated our method for the swine movement networks in Iowa and performed network analyses to gain insights into the swine industry. We then applied the generated networks to a network-based epidemic model to identify potential system vulnerabilities in terms of disease transmission. The model was parameterized for African Swine Fever (ASF) as the US swine industry is quite concerned about this disease. Results show that premises with a central role in the network are more vulnerable to disease outbreaks and play an important role in disease spread. Simulations with outbreaks starting from random farms reveal no significant large outbreaks, indicating the system’s relative robustness against arbitrary disease introductions. However, outbreaks originating from high out-degree farms can lead to large epidemic sizes. This underscores the importance for stakeholders and policymakers to continue improving animal movement records and traceability programs in the US and the value of making that data available to epidemiologists and modelers to better understand risk and inform strategies aimed to cost-effectively prevent and control disease transmission. Our approach could be easily adapted to estimate movement networks in other animal production systems and to inform disease spread models for various infectious diseases.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Parametrizing the detector response with neural networks

In high energy physics, characterizing the response of a detector to radiation is one of the most important and fundamental experimental tasks. In many cases, this task is accomplished by parameterizing summary statistics of the full detector response probability density. The parameterized detector response can then be used for calibration as well as for directly improving physics analysis sensitivity. This paper reports on how to parameterize summary statistics of the detector response using neural networks. Specifically, neural networks are powerful tools for incorporating multidimensional data and the loss function used during training determines which summary statistic is learned. One common summary statistic that has not been combined with deep learning (as far as the authors are aware) is the mode. A neural network-based approach to mode learning is proposed and empirically demonstrated in the context of high energy jet calibrations. Altogether, the neural network-based toolkit for detector response parameterization can enhance the utility of data collected at high energy physics experiments and beyond.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Nonlinear sparse Bayesian learning for physics-based models

This paper addresses the issue of overfitting while calibrating unknown parameters of over-parameterized physics-based models with noisy and incomplete observations. Here, a semi-analytical Bayesian framework of nonlinear sparse Bayesian learning (NSBL) is proposed to identify sparsity among model parameters during Bayesian inversion. NSBL offers significant advantages over machine learning algorithm of sparse Bayesian learning (SBL) for physics-based models, such as 1) the likelihood function or the posterior parameter distribution is not required to be Gaussian, and 2) prior parameter knowledge is incorporated into sparse learning (i.e. not all parameters are treated as questionable). NSBL employs the concept of automatic relevance determination (ARD) to facilitate sparsity among questionable parameters through parameterized prior distributions. The analytical tractability of NSBL is enabled by employing Gaussian ARD priors and by building a Gaussian mixture-model approximation of the posterior parameter distribution that excludes the contribution of ARD priors. Subsequently, type-II maximum likelihood is executed using Newton's method whereby the evidence and its gradient and Hessian information are computed in a semi-analytical fashion. We show numerically and analytically that SBL is a special case of NSBL for linear regression models. Subsequently, a linear regression example involving multimodality in both parameter posterior pdf and model evidence is considered to demonstrate the performance of NSBL in cases where SBL is inapplicable. Next, NSBL is applied to identify sparsity among the damping coefficients of a mass-spring-damper model of a shear building frame. These numerical studies demonstrate the robustness and efficiency of NSBL in alleviating overfitting during Bayesian inversion of nonlinear physics-based models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Latent-space time evolution of non-intrusive reduced-order models using Gaussian process emulation

Non-intrusive reduced-order models (ROMs) have recently generated considerable interest for constructing computationally efficient counterparts of nonlinear dynamical systems emerging from various domain sciences. They provide a low-dimensional emulation framework for systems that may be intrinsically high-dimensional. This is accomplished by utilizing a construction algorithm that is purely data-driven. It is no surprise, therefore, that the algorithmic advances of machine learning have led to non-intrusive ROMs with greater accuracy and computational gains. However, in bypassing the utilization of an equation-based evolution, it is often seen that the interpretability of the ROM framework suffers. This becomes more problematic when black-box deep learning methods are used which are notorious for lacking robustness outside the physical regime of the observed data. In this article, we propose the use of a novel latent-space interpolation algorithm based on Gaussian process regression. Notably, this reduced-order evolution of the system is parameterized by control parameters to allow for interpolation in space. The use of this procedure also allows for a continuous interpretation of time which allows for temporal interpolation. The latter aspect provides information, with quantified uncertainty, about full-state evolution at a finer resolution than that utilized for training the ROMs. This research assesses the viability of this algorithm for an advection-dominated system given by the inviscid shallow water equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Dimensionality Reduction with Variational Encoders Based on Subsystem Purification

Efficient methods for encoding and compression are likely to pave the way toward the problem of efficient trainability on higher-dimensional Hilbert spaces, overcoming issues of barren plateaus. Here, we propose an alternative approach to variational autoencoders to reduce the dimensionality of states represented in higher dimensional Hilbert spaces. To this end, we build a variational algorithm-based autoencoder circuit that takes as input a dataset and optimizes the parameters of a Parameterized Quantum Circuit (PQC) ansatz to produce an output state that can be represented as a tensor product of two subsystems by minimizing $Tr(ρ^2)$. The output of this circuit is passed through a series of controlled swap gates and measurements to output a state with half the number of qubits while retaining the features of the starting state in the same spirit as any dimension-reduction technique used in classical algorithms. The output obtained is used for supervised learning to guarantee the working of the encoding procedure thus developed. We make use of the Bars and Stripes (BAS) dataset for an 8 × 8 grid to create efficient encoding states and report a classification accuracy of 95% on the same. Thus, the demonstrated example provides proof for the working of the method in reducing states represented in large Hilbert spaces while maintaining the features required for any further machine learning algorithm that follows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

The ellipticity parameterization for an NFW profile: An overlooked angular structure in strong lens modeling

Galaxy-scale gravitational lenses are often modeled with two-component mass profiles where one component represents the stellar mass and the second is a Navarro Frenk White (NFW) profile representing the dark matter. Outside of the spherical case, the NFW profile is costly to implement, and so it is approximated via two different methods; ellipticity can be introduced via the lensing potential (NFWp) or via the mass by approximating the NFW profile as a sum of analytical profiles (NFWm). While the NFWp method has been the default for lensing applications, it gives a different prescription of the azimuthal structure, which we show introduces ubiquitous gradients in ellipticity and boxiness in the mass distribution rather than having a constant elliptical shape. Because an unmodeled azimuthal structure has been shown to be able to bias lens model results, we explored the degree to which this azimuthal structure that was introduced can affect the model accuracy. We constructed input profiles using composite models using both the NFWp and NFWm methods and fit these mocks with a power-law elliptical mass distribution (PEMD) model with external shear. As a measure of the accuracy of the recovered lensing potential, we calculated the value of the Hubble parameter H 0 one would determine from the lensing fit. We found that the fits to the NFWp input return H 0 values that are systematically biased by about 3% lower than the NFWm counterparts. We explored whether such an effect is attributable to the mass sheet transformation (MST) by using an MST-independent quantity, ξ 2 . We show that, as expected, the NFWm mocks are degenerate with PEMD through an MST. For the NFWp, an additional bias was found beyond the MST due to the azimuthal structure exterior to the Einstein radius. We recommend modelers use an NFWm prescription in the future, such that the azimuthal structure can be introduced explicitly rather than implicitly.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Conformal bootstrap deformations

We explore the space of extremal functionals in the conformal bootstrap. By recasting the bootstrap problem as a set of non-linear equations parameterized by the CFT data, we find an efficient algorithm for converging to the extremal solution corresponding to the boundary of allowed regions in the parameter space of CFTs. Furthermore, by deforming these solutions, we demonstrate that certain solutions corresponding to known theories are continuously connected. Employing these methods, we will explore the space of non-unitary CFTs in the context of modular as well as correlation function bootstrap. In two dimensions, we show that the extremal solution corresponding to the Ising model is connected to that of the Yang-Lee minimal model. By deforming this solution to three dimensions, we provide evidence that the CFT data obtained in this way is compatible with the E-expansion for a non-unitary theory

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Bayesian inference of multi-messenger astrophysical data: Joint and coherent inference of gravitational waves and kilonovae

Multi-messenger observations of binary neutron star mergers can provide information on the neutron star’s equation of state (EOS) above the nuclear saturation density by directly constraining the mass-radius diagram. We present a Bayesian framework for joint and coherent analyses of multi-messenger binary neutron star signals. As a first application, we analyze the gravitational-wave GW170817 and the kilonova (kN) AT2017gfo data. These results are then combined with the most recent X-ray pulsar analyses of PSR J0030+0451 and PSR J0740+6620 to obtain new EOS constraints.We extend the bajes infrastructure with a joint likelihood for multiple datasets, support for various semi-analytical kN models, and numerical-relativity (NR)-informed relations for the mass ejecta, as well as a technique to include and marginalize over modeling uncertainties. The analysis of GW170817 used the TEOBResumS effective-one-body waveform template to model the gravitational-wave signal. The analysis of AT2017gfo used a baseline multicomponent spherically symmetric model for the kN light curves. Various constraints on the mass-radius diagram and neutron star properties were then obtained by resampling over a set of ten million parameterized EOSs, which was built under minimal assumptions (general relativity and causality).

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗
DOE OSTI2025

Five Year Comparison of Mixing Height Determinations at the Savannah River Site

Air quality dispersion modeling is performed for the Savannah River Site (SRS) to demonstrate compliance with applicable regulations. The AMS/EPA Regulatory Model (AERMOD) modeling system is an EPA recommended model for air quality applications with a data preprocessor (AERMET) to incorporate meteorological data collected on site. AERMET parameterizes or calculates meteorological variables that are not directly measured onsite. One of the parameters estimated by AERMET is the atmospheric mixing height. While the mixing height is not currently a measurement input into AERMET, SRS has the capability to measure the local mixing height. The Savannah River National Laboratory (SRNL) operates a Vaisala CL31 Lidar Ceilometer which estimates mixing height from aerosol backscatter. This study compares the parameterized mixing height from AERMET to the ceilometer estimated mixing height for the current regulatory period at SRS incorporating data from 2015-2019. Results from this study showed the average daily minimum values (morning) from AERMET were an order of magnitude lower than the commonly used Holzworth (1972) method and the ceilometer estimated mixing heights. Additionally, on average, the ceilometer exhibited a daily maximum mixing height value that occurred 1-3 hours later than the AERMET estimated maximum. This difference is likely due to the nighttime atmospheric mixing height assumptions and calculations used by AERMET. The AERMET algorithm cuts off mixing height growth at sunset while the ceilometer data show ongoing evening convection typical of the southeastern United States. These results suggest that the AERMET parametrization scheme assumptions may not be representative of a forested landscape and evening convection which could account for more mixing overnight. The results obtained in this study are significant for air dispersion modeling applications for regulatory purposes and worker safety. Mixing height can impact model estimated pollutant concentrations. A greater mixing height will provide more volume for pollutant dispersion. This report documents efforts to quantify the dependence of mixing height inputs toward a conservative estimated pollutant concentration.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2025

Learning quantum computers' errors using interpretable neural networks

Learning and reducing the errors and noise in quantum computing systems is necessary for achieving quantum computation’s promise. However, rapid advances in experimental quantum computing are making this task increasingly difficult, because state-of-the-art systems now contain hundreds of qubits and many characterization techniques are hard to apply at this scale. Furthermore, complex kinds of errors in these systems, such as crosstalk and non-Markovian effects, must be understood and decreased, but these errors are challenging to study with most existing methods. In this project, we explored using neural networks for scalable characterization of complex errors in quantum computers. We proposed and demonstrated characterizing a quantum computer’s errors with neural networks that have interpretable parameters corresponding to the rates of different kinds of errors, within a sparse Lindbladian parameterization for errors. To enable scaling to many qubit systems, these networks then predict how these errors combine within quantum circuits and impact their outcomes using an efficient approximations. We demonstrated these networks ability to learn coherent crosstalk errors and context-dependent errors in a simulated 4-qubit system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Yet Another Discriminant Analysis (YADA): A Probabilistic Model for Machine Learning Applications

This paper presents a probabilistic model for various machine learning (ML) applications. While deep learning (DL) has produced state-of-the-art results in many domains, DL models are complex and over-parameterized, which leads to high uncertainty about what the model has learned, as well as its decision process. Further, DL models are not probabilistic, making reasoning about their output challenging. In contrast, the proposed model, referred to as Yet Another Discriminate Analysis(YADA), is less complex than other methods, is based on a mathematically rigorous foundation, and can be utilized for a wide variety of ML tasks including classification, explainability, and uncertainty quantification. YADA is thus competitive in most cases with many state-of-the-art DL models. Ideally, a probabilistic model would represent the full joint probability distribution of its features, but doing so is often computationally expensive and intractable. Hence, many probabilistic models assume that the features are either normally distributed, mutually independent, or both, which can severely limit their performance. YADA is an intermediate model that (1) captures the marginal distributions of each variable and the pairwise correlations between variables and (2) explicitly maps features to the space of multivariate Gaussian variables. Numerous mathematical properties of the YADA model can be derived, thereby improving the theoretic underpinnings of ML. Validation of the model can be statistically verified on new or held-out data using native properties of YADA. However, there are some engineering and practical challenges that we enumerate to make YADA more useful.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Octofitter: Fast, Flexible, and Accurate Orbit Modeling to Detect Exoplanets

As next-generation imaging instruments and interferometers search for planets closer to their stars, they must contend with increasing orbital motion and longer integration times. These compounding effects make it difficult to detect faint planets but also present an opportunity. Increased orbital motion makes it possible to move the search for planets into the orbital domain, where direct images can be freely combined with the radial velocity and proper motion anomaly, even without a confirmed detection in any single epoch. In this paper, we present a fast and differentiable multimethod orbit-modeling and planet detection code called Octofitter. This code is designed to be highly modular and allows users to easily adjust priors, change parameterizations, and specify arbitrary function relations between the parameters of one or more planets. Octofitter further supplies tools for examining model outputs including prior and posterior predictive checks and simulation-based calibration. We demonstrate the capabilities of Octofitter on real and simulated data from different instruments and methods, including HD 91312, simulated JWST/NIRISS aperture masking interferometry observations, radial velocity curves, and grids of images from the Gemini Planet Imager. We show that Octofitter can reliably recover faint planets in long sequences of images with arbitrary orbital motion. This publicly available tool will enable the broad application of multiepoch and multimethod exoplanet detection, which could improve how future targeted ground- and space-based surveys are performed. Finally, its rapid convergence makes it a useful addition to the existing ecosystem of tools for modeling the orbits of directly imaged planets.

79 ASTRONOMY AND ASTROPHYSICS↗