Search NASA⌕ Search

SEARCH · Search NASA

Results for “Statistical Emulation”

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 91 records · Page 5

The cosmology dependence of galaxy clustering and lensing from a hybrid N -body–perturbation theory model

ABSTRACT We implement a model for the two-point statistics of biased tracers that combines dark matter dynamics from N-body simulations with an analytic Lagrangian bias expansion. Using Aemulus, a suite of N-body simulations built for emulation of cosmological observables, we emulate the cosmology dependence of these non-linear spectra from redshifts z = 0 to z = 2. We quantify the accuracy of our emulation procedure, which is sub-per cent at $k=1\, h \,{\rm Mpc}^{-1}$ for the redshifts probed by upcoming surveys and improves at higher redshifts. We demonstrate its ability to describe the statistics of complex tracer samples, including those with assembly bias and baryonic effects, reliably fitting the clustering and lensing statistics of such samples at redshift z ≃ 0.4 to scales of $k_{\rm max} \approx 0.6\, h\,\mathrm{Mpc}^{-1}$. We show that the emulator can be used for unbiased cosmological parameter inference in simulated joint clustering and galaxy–galaxy lensing analyses with data drawn from an independent N-body simulation. These results indicate that our emulator is a promising tool that can be readily applied to the analysis of current and upcoming data sets from galaxy surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Applications of emulation and Bayesian methods in heavy-ion physics

Abstract Heavy-ion collisions provide a window into the properties of many-body systems of deconfined quarks and gluons. Understanding the collective properties of quarks and gluons is possible by comparing models of heavy-ion collisions to measurements of the distribution of particles produced at the end of the collisions. These model-to-data comparisons are extremely challenging, however, because of the complexity of the models, the large amount of experimental data, and their uncertainties. Bayesian inference provides a rigorous statistical framework to constrain the properties of nuclear matter by systematically comparing models and measurements. This review covers model emulation and Bayesian methods as applied to model-to-data comparisons in heavy-ion collisions. Replacing the model outputs (observables) with Gaussian process emulators is key to the Bayesian approach currently used in the field, and both current uses of emulators and related recent developments are reviewed. The general principles of Bayesian inference are then discussed along with other Bayesian methods, followed by a systematic comparison of seven recent Bayesian analyses that studied quark-gluon plasma properties, such as the shear and bulk viscosities. The latter comparison is used to illustrate sources of differences in analyses, and what it can teach us for future studies.

Paquet, Jean-François (ORCID:0000000187368171)↗

Model reduction methods for nuclear emulators

The field of model order reduction (MOR) is growing in importance due to its ability to extract the key insights from complex simulations while discarding computationally burdensome and superfluous information. We provide an overview of MOR methods for the creation of fast & accurate emulators of memory- and compute-intensive nuclear systems, focusing on eigen-emulators and variational emulators. As an example, we describe how 'eigenvector continuation' is a special case of a much more general and well-studied MOR formalism for parameterized systems. We continue with an introduction to the Ritz and Galerkin projection methods that underpin many such emulators, while pointing to the relevant MOR theory and its successful applications along the way. Here, we believe that this guide will open the door to broader applications in nuclear physics and facilitate communication with practitioners in other fields.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SUNBIRD : a simulation-based model for full-shape density-split clustering

Combining galaxy clustering information from regions of different environmental densities can help break cosmological parameter degeneracies and access non-Gaussian information from the density field that is not readily captured by the standard two-point correlation function (2PCF) analyses. However, modelling these density-dependent statistics down to the non-linear regime has so far remained challenging. We present a simulation-based model that is able to capture the cosmological dependence of the full shape of the density-split clustering (DSC) statistics down to intra-halo scales. Our models are based on neural-network emulators that are trained on high-fidelity mock galaxy catalogues within an extended-ΛCDM framework, incorporating the effects of redshift-space, Alcock–Paczynski distortions, and models of the halo–galaxy connection. Our models reach sub-percent level accuracy down to $1 \, h^{-1}\text{Mpc}$ and are robust against different choices of galaxy–halo connection modelling. When combined with the galaxy 2PCF, DSC can tighten the constraints on ω cdm , σ 8 , and n s by factors of 2.9, 1.9, and 2.1, respectively, compared to a 2PCF-only analysis. DSC additionally puts strong constraints on environment-based assembly bias parameters.

79 ASTRONOMY AND ASTROPHYSICS↗

Delay Tolerant Network Routing as a Machine Learning Classification Problem

This paper discusses a machine learning-based approach to routing for delay tolerant networks (DTNs) [1]. DTNs are networks which experience frequent disconnections between nodes, uncertainty of an end-to-end path, long one-way trip times, and may have high error rates and asymmetric links. Such networks exist in deep space satellite networks, very rural environments, disaster areas and underwater environments. In this work, we use machine learning classifiers to predict a set of neighboring nodes which are the most likely to deliver a message to a desired location based on message history delivery information.We use the Common Open Research Emulator (CORE) [2] to emulate the DTN environment based on real-world location traces and collect network traffic statistics from the Bundle Protocol implementation IBR-DTN [3]. The software architecture for classification-based routing, analysis and preparation of the network history data and prediction results are discussed.

Delay Tolerant Networks↗

Evaluation of Classifier Complexity for Delay Tolerant Network Routing

The growing popularity of small cost effective satellites (SmallSats, CubeSats, etc.) creates the potential for a variety of new science applications involving multiple nodes functioning together or independently to achieve a task, such as swarms and constellations. As this technology develops and is deployed for missions in Low Earth Orbit and beyond, the use of delay tolerant networking (DTN) techniques may improve communication capabilities within the network. In this paper, a network hierarchy is developed from heterogeneous networks of SmallSats, surface vehicles, relay satellites and ground stations which form an integrated network. There is a tradeoff between complexity, flexibility, and scalability of user defined schedules versus autonomous routing as the number of nodes in the network increases. To address these issues, this work proposes a machine learning classifier based on DTN routing metrics. A framework is developed which will allow for the use of several categories of machine learning algorithms (decision tree, random forest and deep learning) to be applied to a dataset of historical network statistics, which allows for the evaluation of algorithm complexity versus performance to be explored. We develop the emulation of a hierarchical network, consisting of tens of nodes which form a cognitive network architecture. CORE (Common Open Research Emulator) is used to emulate the network using bundle protocol and DTN IP neighbor discovery.

Dudukovich, Rachel↗

A Framework for the Analysis of Deep Neural Networks in Autonomous Aerospace Applications using Bayesian Statistics

Deep Neural Networks (DNNs) are considered to be key components in many autonomous systems. Applications range from vision-based obstacle avoidance to intelligent/learning control and planning. Safety-critical applications as found in the aerospace domain require that the behavior of the DNN is validated and tested rigorously for safety of the autonomous system (AUS). In this paper, we present a framework to support testing of DNNs and the analysis of the network structure. Our framework employs techniques from statistical modeling and active learning to effectively generate test cases for DNN safety testing and performance analysis. We will present results of a case study on a physics-based Deep recurrent residual neural network (DR-RNN), which has been trained to emulate the aerodynamics behavior of a fixed-wing aircraft.

Deep Neural networks↗

Cosmological constraints from density-split clustering in the BOSS CMASS galaxy sample

We present a clustering analysis of the BOSS DR12 CMASS galaxy sample, combining measurements of the galaxy two-point correlation function and density-split clustering down to a scale of $1 \, h^{-1}\, \text{Mpc}$. Our theoretical framework is based on emulators trained on high-fidelity mock galaxy catalogues that forward model the cosmological dependence of the clustering statistics within an extended-ΛCDM framework, including redshift-space and Alcock–Paczynski distortions. Our base-ΛCDM analysis finds ω cdm = 0.1201 ± 0.0022, σ 8 = 0.792 ± 0.034, and n s = 0.970 ± 0.018, corresponding to fσ 8 = 0.462 ± 0.020 at z ≈ 0.525, which is in agreement with Planck 2018 predictions and various clustering studies in the literature. We test single-parameter extensions to base-ΛCDM, varying the running of the spectral index, the dark energy equation of state, and the density of mass-less relic neutrinos, finding no compelling evidence for deviations from the base model. We model the galaxy–halo connection using a halo occupation distribution framework, finding signatures of environment-based assembly bias in the data. We validate our pipeline against mock catalogues that match the clustering and selection properties of CMASS, showing that we can recover unbiased cosmological constraints even with a volume 84 times larger than the one used in this study.

79 ASTRONOMY AND ASTROPHYSICS↗

Hyper Suprime-Cam Year 3 results: Cosmology from galaxy clustering and weak lensing with HSC and SDSS using the minimal bias model

Here, we present cosmological parameter constraints from a blind joint analysis of three two-point correlation functions measured from the Year 3 Hyper Suprime-Cam (HSC-Y3) imaging data, covering about 416 deg 2 , and the SDSS DR11 spectroscopic galaxies spanning the redshift range [0.15, 0.70]. We subdivide the SDSS galaxies into three luminosity-cut, and therefore nearly volume-limited samples separated in redshift, each of which acts as a large-scale structure tracer characterized by the measurement of the projected correlation function, w p ⁡(R). We also use the measurements of the galaxy-galaxy weak-lensing signal Δ⁢Σ⁡(R) for each of these SDSS samples which act as lenses for a secure sample of source galaxies selected from the HSC-Y3 shape catalog based on their photometric redshifts. We combine these measurements with the cosmic shear correlation functions, ξ ± ⁡($\vartheta$) measured for our HSC source sample. We model these observables with the minimal bias model of the galaxy clustering observables in the context of a flat Λ⁢CDM cosmology. We use conservative scale cuts, R >12 and 8⁢ℎ -1 Mpc for Δ⁢Σ and w p , respectively, where the minimal bias model is valid, in addition to conservative prior on the residual bias in the mean redshift of the HSC photometric source galaxies. We present various validation tests of our model as well as analysis methods. Our baseline analysis yields S 8 = $0.77⁢5^{+0.043}_{-0.038}$ (68% C.I.) for the Λ⁢CDM model, after marginalizing over uncertainties in other parameters. Our value of S 8 is consistent with that from the Planck 2018 data, but the credible interval of our result is still relatively large. We show that various internal consistency tests based on different splits of the data are passed. Our results are statistically consistent with those of a companion paper, which extends this analysis to smaller scales with an emulator-based halo model, using Δ⁢Σ⁡(R) and w p ⁡(R) down to R >3 and 2⁢ℎ -1 Mpc, respectively.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulation budgeting for hybrid effective field theories

In this work, we forecast the number of, and requirements on, N-body simulations needed to train hybrid effective field theory (HEFT) emulators for a range of use cases, using a hybrid of HMcode and perturbation theory as a surrogate model. Our accuracy goals, determined with careful consideration of statistical and systematic uncertainties, are 1% accurate in the high-likelihood range of cosmological parameters, and 2% accurate over a broader parameter space volume for k < 1 h Mpc -1 and z < 3. Focusing in part on the 8-parameter w 0 w a CDM+ m ν cosmological model, we find that < 225 simulations are required to meet our error goals over our wide parameter space, including models with rapidly evolving dark energy, given our simulation and emulator recommendations. For a more restricted parameter space volume, as few as 80 simulations are sufficient. We additionally present simulation forecasts for example use cases, and make the code used in our analyses publicly available. These results offer practical guidance for efficient emulator design and simulation budgeting in future cosmological analyses.

cosmological parameters from LSS↗

Remote Sensing, Uncertainty Quantification, and a Theory of Data Systems; Workshop Report

The purpose of the workshop was to invite statisticians, applied mathematicians, computer scientists, data system architects, experts in remote sensing technology, and Climate and Earth System scientists to review, discuss, and plan research on issues related to large-scale, efficient analysis of distributed data using spatial statistical methods. Our motivation in organizing this event was to catalyze interchange among experts on the fast-emerging problem of analysis of distributed data. As part of SAMSI's 2017-2018 Program on Mathematical and Statistical Methods for Climate and the Earth System, a Working Group on Remote Sensing was established to address statistical and mathematical research problems in the analysis of remote sensing data. The Working Group has five subgroups: 1) Spatial Retrieval Methodology (the so-called \Spatial-X" subgroup); 2) Spatial Analysis for Hyperspectral Data (the so-called \Spatial-Y" subgroup); 3) Emulators for Complex Forward Models; 4) Optimization for Remote Sensing Retrievals; and 5) Theory of Data Systems (ToDS). The ToDS subgroup spent the first half of this academic year formulating a framework in which to consider the joint problem of a) optimizing statistical methods for environments where data are distributed and too large to move to a central location, and b) the design of data system infrastructures within which to implement those statistical methods. To x ideas, the Workshop focused on spatial statistical methods. To date there are many new spatial statistical methods designed with massive data sets in mind, in the literature. However, very few have been implemented for remote sensing data, and none have been implemented in operational settings like those used by NASA and NOAA. A major impediment to their use in these cases is that the data are not only massive, but are stored in different physical locations. These data must be brought together in some way in order to estimate spatial covariance functions, but moving data to a central location for analysis is tedious at best and impossible at worst. Some remote data reduction is almost certainly necessary, but how much? What are the consequences for inference? The fundamental issue underlying these questions is how to navigate the trade-space between costs and uncertainty in the estimates or inferences that are ultimately produced.

Braverman, Amy↗

Stacked reverberation mapping of high-redshift quasars in DESI. I. Feasibility analysis

The broad-line region of quasars has long been probed by reverberation mapping techniques that measure time lags between continuum and broad emission-line variations. Stacked reverberation mapping has been proposed as a less observationally expensive alternative to traditional methods. This ensemble approach also reduces biases from small-number statistics. The Dark Energy Spectroscopic Instrument (DESI) is conducting the most extensive spectroscopic survey of quasars to date. We create mock light curves emulating expected DESI quasar observations at redshifts $1.48\lt z\lt 5.2$ and luminosities $44.68 \le \log \lambda L_{1350 \mathring{\rm A}{}} / \mathrm{erg\, s^{-1}} \le 45.99$ to test stacked reverberation mapping feasibility using sparse spectroscopic data paired with well-sampled photometric data. The pipeline, using the lag estimation code JAVELIN (Just Another Vehicle for Estimating Lags In Nuclei), successfully recovers the simulated C IV lags within 1σ of the true values using spectroscopic light curves composed of only a few spectral epochs (2–10) with irregular cadences. We investigate how observational factors, including C IV flux error magnitude, number of stacked quasars, and spectral epoch count, affect performance. This work motivates a pathway for future stacked reverberation mapping projects with large-scale spectroscopic surveys of quasars having $\ge 2$ spectroscopic observations. Our results suggest an economical alternative for constraining and extending the radius–luminosity relation to higher redshifts and luminosities. Subsequently, this relation can be employed more reliably in single-epoch black hole mass measurements and quasar cosmology in these distant regimes.

quasars: general, quasars: supermassive black hole↗

Nuclear-matter saturation and symmetry energy within Δ -full chiral effective field theory

Nuclear saturation and the symmetry energy are key properties of low-energy nuclear physics that depend on fine details of the nuclear interaction. The equation of state around saturation is also an important anchor for extrapolations to higher densities and studies of neutron stars. Here we develop a unified statistical framework that uses realistic nuclear forces to link the theoretical modeling of finite nuclei and infinite nuclear matter. We construct fast and accurate emulators for nuclear-matter observables and employ an iterative history-matching approach to explore and reduce the enormous parameter domain of Δ -full chiral interactions. We perform rigorous uncertainty quantification and find that model calibration including O 16 observables gives saturation predictions that are more precise than those that only use few-body data. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Normalizing flows for likelihood-free inference with fusion simulations

Fluid-based scrape-off layer transport codes, such as UEDGE, are heavily utilized in tokamak analysis and design, but typically require user-specified anomalous transport coefficients to match experiments. Determining the uniqueness of these parameters and the uncertainties in them to match experiments can provide valuable insights to fusion scientists. Here, we leverage recent work in the area of likelihood-free inference (‘simulation-based inference’) to train a neural network, which enables accurate statistical inference of the anomalous transport coefficients given experimental plasma profile input. UEDGE is treated as a black-box simulator and runs multiple times with anomalous transport coefficients sampled from priors, and the neural network is trained on these simulations to emulate the posterior. The neural network is trained as a normalizing flow model for density estimation, allowing it to accurately represent complicated, high-dimensional distribution functions. With a fixed simulation budget, we compare a single-round procedure to a multi-round approach that guides the training simulations toward a specific target observation. Finally, we discuss the future possibilities for use of amortized models, which train on a wide range of simulations and enable fast statistical inference for results during experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Exploration of multifidelity UQ sampling strategies for computer network applications.

Network modeling is a powerful tool to enable rapid analysis of complex systems that can be challenging to study directly using physical testing. Here, two approaches are considered: emulation and simulation. The former runs real software on virtualized hardware, while the latter mimics the behavior of network components and their interactions in software. Although emulation provides an accurate representation of physical networks, this approach alone cannot guarantee the characterization of the system under realistic operative conditions. Operative conditions for physical networks are often characterized by intrinsic variability (payload size, packet latency, etc.) or a lack of precise knowledge regarding the network configuration (bandwidth, delays, etc.); therefore uncertainty quantification (UQ) strategies should be also employed. UQ strategies require multiple evaluations of the system with a number of evaluation instances that roughly increases with the problem dimensionality, i.e., the number of uncertain parameters. It follows that a typical UQ workflow for network modeling based on emulation can easily become unattainable due to its prohibitive computational cost. In this paper, a multifidelity sampling approach is discussed and applied to network modeling problems. The main idea is to optimally fuse information coming from simulations, which are a low-fidelity version of the emulation problem of interest, in order to decrease the estimator variance. By reducing the estimator variance in a sampling approach it is usually possible to obtain more reliable statistics and therefore a more reliable system characterization. Several network problems of increasing difficulty are presented. For each of them, the performance of the multifidelity estimator is compared with respect to the single fidelity counterpart, namely, Monte Carlo sampling. For all the test problems studied in this work, the multifidelity estimator demonstrated an increased efficiency with respect to MC.

97 MATHEMATICS AND COMPUTING↗

Statistically Steady State Large-Eddy Simulations Forced by an Idealized GCM: 1. Forcing Framework and Simulation Characteristics

Using large-eddy simulations (LES) systematically has the potential to inform parameterizations of subgrid-scale (SGS) processes in general circulation models (GCMs), such as turbulence, convection, and clouds. Here we show how LES can be run to emulate grid columns of GCMs to generate a library of LES across a cross-section of dynamical regimes. The LES setup replicates the thermodynamic and water budgets in GCM grid columns. Resolved horizontal and vertical transports of heat and water and large-scale pressure gradients from the GCM are prescribed as forcing in the LES. The LES satisfies the same (slab-ocean) surface boundary conditions as the GCM, leaving the LES temperatures free to adjust. Radiative transfer is treated in a unied but highly idealized manner (a semi-gray atmosphere without cloud radiative effects) in both the GCM and LES. We show that the LES with these forcing and boundary conditions reaches statistically steady states without nudging to reference profiles. These steady states provide a training dataset for developing GCM parameterizations. The same LES setup also provides a good basis for studying the cloud response to global warming.

54 ENVIRONMENTAL SCIENCES↗

Exploring Microsimulation Process for Energy Impact Evaluation of Connected and Automated Vehicles

In this paper, the authors present a microsimulation-based methodological approach for evaluating the energy impact of connected and automated vehicles (CAVs). They use an open-source micro-simulator, SUMO, and provide a way to set up a simulation environment that emulates real-world traffic dynamics. They also employ the Intelligent Driver Model to represent human drivers and calibrate its driving behavior using real-world traffic data and driving statistics. The authors conduct extensive simulation studies considering different penetration rates of CAVs, different car-following models, and varying car-following model parameters. Using the state-of-the-art Future Automotive System Technology Simulator (FASTSim), they estimate the fuel economy of each vehicle and analyze the energy impact of the given CAV implementation. Finally, the authors analyze the possible factors affecting the simulation results, and also discuss limitations and future work.

ADVANCED PROPULSION SYSTEMS↗

Contrasting Time-Frequency Representations for Unknown Waveform Detection

Identifying unseen electromagnetic waveforms is critical for many applications, like interference management, electronic warfare and spectrum management. Traditionally this is done using statistical methods for anomaly detection, which has evolved to deep learning models for identifying the unseen data, formally termed as open set recognition. Some prior methods use a generative model to emulate open set data, which face challenges in generating synthetic samples for open set while simultaneously selecting an optimal discriminator for accurate classification. To alleviate this issue, we propose a discriminative model that effectively combines time and frequency domain features of communication signals for accurate predictions. We further introduce a cosine similarity loss that makes the domain specific features unique to enhance the prediction rate. Additionally, our model avoids generic feature vectors by extracting class-specific features during training, resulting in improved class representation. The experiment results show that this combined feature approach with cosine loss outperforms single-domain models and improves accuracy by 10% over models without cosine loss.

99 - GENERAL AND MISCELLANEOUS↗