Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Conditional Distribution”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Distributionally Robust Decision Making Leveraging Conditional Distributions

Distributionally robust optimization (DRO) is a powerful tool for decision making under uncertainty. It is particularly appealing because of its ability to leverage existing data. However, many practical problems call for decision-making with some auxiliary information, and DRO in the context of conditional distributions is not straightforward. We propose a conditional kernel distributionally robust optimization (CKDRO) method that enables robust decision making under conditional distributions through kernel DRO and the conditional mean operator in the reproducing kernel Hilbert space (RKHS). In particular, we consider problems where there is a correlation between the unknown variable y and an auxiliary observable variable x. Given past data of the two variables and a queried auxiliary variable, CKDRO represents the conditional distribution P(y|x) as the conditional mean operator in the RKHS space and quantifies the ambiguity set in the RKHS as well, which depends on the size of the dataset as well as the query point. To justify the use of RKHS, we demonstrate that the ambiguity set defined in RKHS can be viewed as a ball under a metric that is similar to the Wasserstein metric. The DRO is then dualized and solved via a finite dimensional convex program. The proposed CKDRO approach is applied to a generation scheduling problem and shows that the result of CKDRO is superior to common benchmarks in terms of quality and robustness.

Chen, Yuxiao↗
DOE OSTI2026

Conditional distribution estimation of building characteristics with diffusion models for urban energy modeling

Understanding current energy consumption behavior in communities is critical for informing future energy use decisions and enabling efficient energy management. Urban energy models, which are used to simulate these energy use patterns, require large datasets with detailed building characteristics for accurate outcomes. However, such detailed characteristics at the individual building level are often unknown and costly to acquire, or unavailable. Through this work, we propose using a generative modeling approach to generate realistic building attributes to fill in the data gaps and finally provide complete characteristics as inputs to energy models. Our model learns complex, building-level patterns from training on a large-scale residential building stock model containing 2.2 million buildings. We employ a tabular diffusion-based framework that is designed to handle heterogeneous (discrete and continuous) features in tabular building data, such as occupancy, floor area, heating, cooling, and other equipment details. We develop a capability for conditional diffusion, enabling the imputation of missing building characteristics conditioned on known attributes. We conduct a comprehensive validation of our conditional diffusion model, firstly by comparing the generated conditional distributions against the underlying data distribution, and secondly, by performing a case study for a Baltimore residential region, showing the practical utility of our approach. Our work is one of the first to demonstrate the potential of generative modeling to accelerate building energy modeling workflows.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

SIDDA: SInkhorn Dynamic Domain Adaptation for image classification with equivariant neural networks

Modern neural networks (NNs) often do not generalize well in the presence of a ‘covariate shift’; that is, in situations where the training and test data distributions differ, but the conditional distribution of classification labels given the data remains unchanged. In such cases, NN generalization can be reduced to a problem of learning more robust, domain-invariant features. Domain adaptation (DA) methods include a broad range of techniques aimed at achieving this; however, these methods have struggled with the need for extensive hyperparameter tuning, which then incurs significant computational costs. In this work, we introduce SInkhorn Dynamic Domain Adaptation (SIDDA), an out-of-the-box DA training algorithm built upon the Sinkhorn divergence, that can achieve effective domain alignment with minimal hyperparameter tuning and computational overhead. We demonstrate the efficacy of our method on multiple simulated and real datasets of varying complexity, including simple shapes, handwritten digits, real astronomical observations, and remote sensing data. These datasets exhibit covariate shifts due to noise, blurring, differences between telescopes, and variations in imaging wavelengths. SIDDA is compatible with a variety of NN architectures, and it works particularly well in improving classification accuracy and model calibration when paired with symmetry-aware equivariant NNs (ENNs). We find that SIDDA consistently enhances the generalization capabilities of NNs, achieving up to a ${\approx}40\%$ improvement in classification accuracy on unlabeled target data, while also providing a more modest performance gain of $\lesssim 1\%$ on labeled source data. We also study the efficacy of DA on ENNs with respect to the varying group orders of the dihedral group DN, and find that the model performance improves as the degree of equivariance increases. Finally, if SIDDA achieves proper domain alignment, it also enhances model calibration on both source and target data, with the most significant gains in the unlabeled target domain—achieving over an order of magnitude improvement in the expected calibration error and Brier score. SIDDA’s versatility across various NN models and datasets, combined with its automated approach to domain alignment, has the potential to significantly advance multi-dataset studies by enabling the development of highly generalizable models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

SIDDA: SInkhorn Dynamic Domain Adaptation

Modern neural networks (NNs) often do not generalize well in the presence of a "covariate shift"; that is, in situations where the training and test data distributions differ, but the conditional distribution of classification labels remains unchanged. In such cases, NN generalization can be reduced to a problem of learning more domain-invariant features. Domain adaptation (DA) methods include a range of techniques aimed at achieving this; however, these methods have struggled with the need for extensive hyperparameter tuning, which then incurs significant computational costs. In this work, we introduce SIDDA, an out-of-the-box DA training algorithm built upon the Sinkhorn divergence, that can achieve effective domain alignment with minimal hyperparameter tuning and computational overhead. We demonstrate the efficacy of our method on multiple simulated and real datasets of varying complexity, including simple shapes, handwritten digits, and real astronomical observations. SIDDA is compatible with a variety of NN architectures, and it works particularly well in improving classification accuracy and model calibration when paired with equivariant neural networks (ENNs). We find that SIDDA enhances the generalization capabilities of NNs, achieving up to a ≈40% improvement in classification accuracy on unlabeled target data. We also study the efficacy of DA on ENNs with respect to the varying group orders of the dihedral group DN, and find that the model performance improves as the degree of equivariance increases. Finally, we find that SIDDA enhances model calibration on both source and target data--achieving over an order of magnitude improvement in the ECE and Brier score. SIDDA's versatility, combined with its automated approach to domain alignment, has the potential to advance multi-dataset studies by enabling the development of highly generalizable models.

Pandya, Sneh [Northeastern U.]↗
DOE OSTI2024

Bounds on galaxy stochasticity from halo occupation distribution modeling

The joint probability distribution of matter overdensity and galaxy counts in cells is a powerful probe of cosmology, and the extent to which variance in galaxy counts at fixed matter density deviates from Poisson shot noise is not fully understood. The lack of informed bounds on this stochasticity is currently the limiting factor in constraining cosmology with the galaxy–matter probability distribution function (PDF). We investigate stochasticity in the conditional distribution of galaxy counts along lines of sight with fixed matter density, and we present a halo occupation distribution (HOD)-based approach for obtaining plausible ranges for stochasticity parameters. To probe the high-dimensional space of possible galaxy–matter connections, we derive a set of HODs that conserve the galaxies’ linear bias and number density to produce RED M A G I C-like galaxy catalogs within the A BACUS S UMMIT suite of N -body simulations. We study the impact of individual HOD parameters and cosmology on stochasticity and perform a Monte Carlo search in HOD parameter space subject to the constraints on bias and density. In mock catalogs generated by the selected HODs, shot noise in galaxy counts spans both sub-Poisson and super-Poisson values, ranging from 80% to 133% of Poisson variance for cells with mean matter density. Nearly all of the derived HODs show a positive relationship between local matter density and stochasticity. For galaxy catalogs with higher stochasticity, modeling galaxy bias to second order is required for an accurate description of the conditional PDF of galaxy counts at fixed matter density. The presence of galaxy assembly bias also substantially extends the range of stochasticity in the super-Poisson direction. This HOD-based approach leverages degrees of freedom in the galaxy–halo connection to obtain informed bounds on nuisance model parameters and can be adapted to study other parametrizations of shot noise in galaxy counts, in particular to motivate prior ranges on stochasticity for cosmological analyses.

Britt, Dylan (ORCID:000000019905601X)↗
DOE OSTI2026

Cluster infall for mass calibration in the stage-IV era

The outskirts of galaxy clusters present a promising avenue for constraining cluster masses in a way that is robust to the impact of baryonic physics. We assess the accuracy to which the cluster infall regions can be used for cluster mass calibration. Building on previous work, we parametrize the velocity distribution 𝑃⁡(𝑣r,𝑣tan|𝑟,𝑀) of dark matter halos on scales 𝑟 ≥ 5⁢ℎ −1 Mpc as the product of the marginalized distribution 𝑃⁡(𝑣 r |𝑟,𝑀) and the conditional distribution 𝑃⁡(𝑣 tan |𝑣 r ,𝑟,𝑀), calibrating the radial and mass dependence of these distributions in numerical simulations. We then project our model along the line of sight to obtain accurate predictions for the distributions of line-of-sight velocities at a given projected radius and cluster mass 𝑃⁡(𝑣 LOS |𝑅,𝑀), which we can observe with spectroscopic survey data. Furthermore, with our model, we forecast that spectra from the Dark Energy Spectroscopic Instrument can constrain cluster masses with subpercent-level precision, comparable to that of stage-IV weak lensing surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Elliptically-Contoured Tensor-variate Distributions with Application to Image Learning

Statistical analysis of tensor-valued data has largely used the tensor-variate normal (TVN) distribution that may be inadequate for data arising from distributions with heavier or lighter tails. We study a general family of elliptically contoured (EC) TV distributions and derive its characterizations, moments, marginal, and conditional distributions. We describe procedures for maximum likelihood estimation from data that are (1) uncorrelated draws from an EC distribution, (2) from a scale mixture of the TVN distribution, and (3) from an underlying but unknown EC distribution, for which we extend Tyler’s robust estimator. A detailed simulation study highlights the benefits of choosing an EC distribution over the TVN for heavier-tailed data. We develop TV classification rules using discriminant analysis and EC errors and show that they better predict cats and dogs from images in the Animal Faces-HQ dataset than the TVN-based rules. A novel tensor-on-tensor regression and TV analysis of variance (TANOVA) framework under EC errors is also demonstrated to better characterize gender, age, and ethnic origin than the usual TVN-based TANOVA in the celebrated labeled faces of the wild dataset.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Pseudoreversible Normalizing Flow for Stochastic Dynamical Systems with Various Initial Distributions

Here, we present a pseudoreversible normalizing flow method for efficiently generating samples of the state of a stochastic differential equation (SDE) with various initial distributions. The primary objective is to construct an accurate and efficient sampler that can be used as a surrogate model for computationally expensive numerical integration of SDEs, such as those employed in particle simulation. After training, the normalizing flow model can directly generate samples of the SDE’s final state without simulating trajectories. The existing normalizing flow model for SDEs depends on the initial distribution, meaning the model needs to be retrained when the initial distribution changes. The main novelty of our normalizing flow model is that it can learn the conditional distribution of the state, i.e., the distribution of the final state conditional on any initial state, such that the model only needs to be trained once and the trained model can be used to handle various initial distributions. This feature can provide a significant computational saving in studies of how the final state varies with the initial distribution. Additionally, we propose to use a pseudoreversible network architecture to define the normalizing flow model, which has sufficient expressive power and training efficiency for a variety of SDEs in science and engineering, e.g., in particle physics. We provide a rigorous convergence analysis of the pseudoreversible normalizing flow model to the target probability density function in the Kullback–Leibler divergence metric. Numerical experiments are provided to demonstrate the effectiveness of the proposed normalizing flow model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A generative modeling approach to reconstructing 21 cm tomographic data

Abstract Analyses of the cosmic 21 cm signal are hampered by astrophysical foregrounds that are far stronger than the signal itself. These foregrounds, typically confined to a wedge-shaped region in Fourier space, often necessitate the removal of a vast majority of modes, thereby degrading the quality of the data anisotropically. To address this challenge, we introduce a novel deep generative model based on stochastic interpolants to reconstruct the 21 cm data lost to wedge filtering. Our method leverages the non-Gaussian nature of the 21 cm signal to effectively map wedge-filtered 3D lightcones to samples from the conditional distribution of wedge-recovered lightcones. We demonstrate how our method is able to restore spatial information effectively, considering both varying cosmological initial conditions and astrophysics. Furthermore, we discuss a number of future avenues where this approach could be applied in analyses of the 21 cm signal, potentially offering new opportunities to improve our understanding of the Universe during the epochs of cosmic dawn and reionization. Code, pre-trained models, and scripts for making plots in this paper can be found here .

Sabti, Nashwan (ORCID:000000027924546X)↗
DOE OSTI2023

Astigmatic electron beam propagation

An astigmatic electron beam with an ellipticity ratio of approximately 2:1 was examined using the Enhanced Modified Faraday Cup (EMFC) diagnostic to measure its properties and show how the power density distribution varies near the beam waist. Results show that the beam has two power density peaks, one on either side of the beam crossover point, resulting from different focal distances of the major and minor axes of the elliptical beam shape. Quantification of the beam properties was used to establish a depth-of-field where the beam diameter and peak power densities are relatively constant. For the 1 kW beam studied here, the depth-of-field measured approximately ±5 mm from the beam crossover point, illustrating how electron beam diagnostics can be used to identify process control limits for repeatable and reliable welds under non-ideal electron beam power density distribution conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Continuing Development of the Nuclear Data Processing Code AMPX [Poster]

The ENDF/B-VIII.1 evaluation library has seen a great growth in the thermal neutron scattering sub-library. The SCALE code system has traditionally approached CE transport by assuming that the CE library on disk represented the fully expanded cumulative probability distributions, conditional on exiting angle and marginal on exiting energy. While this is a complete description of the data, it comes at the potential cost of large amounts of on-disk storage. This approach was strained by several TSL files in ENDF/B-VIII.1, such as graphite, which contained data for a large number of Bragg edges. In the fully expanded probability distributions, this was found to be a disproportionately large fraction of the SCALE CE library.

GNDS↗
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 OSTI2024

Meteorological Drivers of North American Monsoon Extreme Precipitation Events

Abstract In this paper the meteorological drivers of North American Monsoon (NAM) extreme precipitation events (EPEs) are identified and analyzed. First, the NAM area and its subregions are distinguished using self‐organizing maps applied to the Climate Prediction Center global precipitation data set. This reveals distinct subregions, shaped by the inhomogeneous geographic features of the NAM area, with distinct extreme precipitation character and drivers. Next, defining EPEs as days when subregion‐mean precipitation exceeds the 95th percentile of rainy days, five synoptic features and one mesoscale feature are investigated as potential drivers of EPEs. Essentially all EPEs can be associated with at least one selected driver, with only one event remaining unclassified. This analysis shows the dominant role of Gulf of California moisture surges, mesoscale convective systems and frontal systems in generating NAM extreme precipitation. Finally, a frequency and probability analysis is conducted to contrast precipitation distributions conditioned on the associated meteorological drivers. The findings demonstrate that the co‐occurrence of multiple features does not necessarily enhance the EPE probability.

Meteorology & Atmospheric Sciences↗
DOE OSTI2023

Bayesian-Motivated Probabilistic Model of Hurricane-Induced Multimechanism Flood Hazards

Multimechanism floods (MMFs) are caused by the simultaneous occurrence of more than one flood mechanism such as storm surge, precipitation, tides, and waves. MMFs can lead to more severe or differing impacts than single-mechanism floods. As a result, comprehensive risk assessments require the ability to assess the multivariate probabilistic behaviors of hazards from MMFs. Here this study introduces a novel Bayesian-motivated approach for the probabilistic assessment of hurricane-induced hazards from the combination of the surge, precipitation, tides, and river antecedent flow. A Bayesian network (BN) is developed to capture the physical (conditional) relationship between variables and facilitate the generation of a hazard curve for river discharge that captures the contributions from multiple flood drivers. A case study located along the Delaware River is used to illustrate the proposed approach. Five computationally efficient representative predictive models are developed to estimate the conditional distributions required for the BN as a means of demonstrating the overall framework. The predictive models used in this study act as placeholders and can be replaced with more sophisticated and high-fidelity models depending on the desired accuracy level. While the predictive models are intended to be representative and illustrative, the model performance is evaluated using three historical storms that affected the area. Overall, the proposed framework is shown to be transparent, effective, and adaptable.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Fate of supernova progenitors in massive binary systems

ABSTRACT How massive stars end their lives depends on the core mass, core angular momentum, and hydrogen envelopes at death. However, these key physical facets of stellar evolution can be severely affected by binary interactions. In turn, the effectiveness of binary interactions itself varies greatly depending on the initial conditions of the binaries, making the situation much more complex. We investigate systematically how binary interactions influence core–collapse progenitors and their fates. Binary evolution simulations are performed to survey the parameter space of supernova progenitors in solar metallicity binary systems and to delineate major evolutionary paths. We first study fixed binary mass ratios ($q=M_2/M_1$ = 0.5, 0.7, and 0.9) to elucidate the impacts of initial mass and initial separation on the outcomes, treating separately Type Ibc supernova, Type II supernova, accretion-induced collapse (AIC), rapidly rotating supernova (Ibc-R), black hole formation, and long gamma ray burst (long GRB). We then conduct 12 binary population synthesis model calculations, varying the initial condition distributions and binary evolution parameters, to estimate various supernova fractions. We obtain a Milky Way supernova rate $R_{\rm SN} = (1.78$–$2.47) \times 10^{-2} \, {\rm yr}^{-1}$ which is consistent with observations. We find the rates of AIC, Ibc-R, and long GRB to be $\sim 1/100$ the rate of regular supernovae. Our estimated long GRB rates are higher than the observed long GRB rate and close to the low luminosity GRB rate, although care must be taken considering our models are computed with solar metallicity. Furthering binary modelling and improving the inputs one by one will enable more detailed studies of these and other transients associated with massive stars.

Astronomy & Astrophysics↗