Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate Bayesian inference”

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

Galaxy cluster matter profiles - I. Self-similarity, mass calibration, and observable-mass relation validation employing cluster mass posteriors

We present a study of the weak lensing inferred matter profiles ΔΣ(R) of 698 South Pole Telescope (SPT) thermal Sunyaev-Zel’dovich effect (tSZE) selected and MCMF optically confirmed galaxy clusters in the redshift range 0.25 < z < 0.94 that have associated weak gravitational lensing shear profiles from the Dark Energy Survey (DES). Rescaling these profiles to account for the mass dependent size and the redshift dependent density produces average rescaled matter profiles ΔΣ(R/R200c)/(ρcritR200c) with a lower dispersion than the unscaled ΔΣ(R) versions, indicating a significant degree of self-similarity. Galaxy clusters from hydrodynamical simulations also exhibit matter profiles that suggest a high degree of self-similarity, with RMS variation among the average rescaled matter profiles with redshift and mass falling by a factor of approximately six and 23, respectively, compared to the unscaled average matter profiles. We employed this regularity in a new Bayesian method for weak lensing mass calibration that employs the so-called cluster mass posterior P(M200|ζ̂, λ̂, z), which describes the individual cluster masses given their tSZE (ζ̂) and optical (λ̂, z) observables. This method enables simultaneous constraints on richness λ-mass and tSZE detection significance ζ-mass relations using average rescaled cluster matter profiles. We validated the method using realistic mock datasets and present observable-mass relation constraints for the SPT×DES sample, where we constrained the amplitude, mass trend, redshift trend, and intrinsic scatter. Our observable-mass relation results are in agreement with the mass calibration derived from the recent cosmological analysis of the SPT×DES data based on a cluster-by-cluster lensing calibration. Our new mass calibration technique offers a higher efficiency when compared to the single cluster calibration technique. We present new validation tests of the observable-mass relation that indicate the underlying power-law form and scatter are adequate to describe the real cluster sample but that also suggest a redshift variation in the intrinsic scatter of the λ-mass relation may offer a better description. In addition, the average rescaled matter profiles offer high signal-to-noise ratio (S/N) constraints on the shape of real cluster matter profiles, which are in good agreement with available hydrodynamical ΛCDM simulations. This high S/N profile contains information about baryon feedback, the collisional nature of dark matter, and potential deviations from general relativity.Key words: gravitational lensing: weak / galaxies: clusters: general / large-scale structure of Universe

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2015

Modeling the Swift BAT Trigger Algorithm with Machine Learning

To draw inferences about gamma-ray burst (GRB) source populations based on Swift observations, it is essential to understand the detection efficiency of the Swift burst alert telescope (BAT). This study considers the problem of modeling the Swift BAT triggering algorithm for long GRBs, a computationally expensive procedure, and models it using machine learning algorithms. A large sample of simulated GRBs from Lien et al. (2014) is used to train various models: random forests, boosted decision trees (with AdaBoost), support vector machines, and artificial neural networks. The best models have accuracies of approximately greater than 97% (approximately less than 3% error), which is a significant improvement on a cut in GRB flux which has an accuracy of 89:6% (10:4% error). These models are then used to measure the detection efficiency of Swift as a function of redshift z, which is used to perform Bayesian parameter estimation on the GRB rate distribution. We find a local GRB rate density of eta(sub 0) approximately 0.48(+0.41/-0.23) Gpc(exp -3) yr(exp -1) with power-law indices of eta(sub 1) approximately 1.7(+0.6/-0.5) and eta(sub 2) approximately -5.9(+5.7/-0.1) for GRBs above and below a break point of z(sub 1) approximately 6.8(+2.8/-3.2). This methodology is able to improve upon earlier studies by more accurately modeling Swift detection and using this for fully Bayesian model fitting. The code used in this is analysis is publicly available online.

gamma rays: general↗
NASA NTRS1988

Mathematical algorithms for approximate reasoning

Most state of the art expert system environments contain a single and often ad hoc strategy for approximate reasoning. Some environments provide facilities to program the approximate reasoning algorithms. However, the next generation of expert systems should have an environment which contain a choice of several mathematical algorithms for approximate reasoning. To meet the need for validatable and verifiable coding, the expert system environment must no longer depend upon ad hoc reasoning techniques but instead must include mathematically rigorous techniques for approximate reasoning. Popular approximate reasoning techniques are reviewed, including: certainty factors, belief measures, Bayesian probabilities, fuzzy logic, and Shafer-Dempster techniques for reasoning. A group of mathematically rigorous algorithms for approximate reasoning are focused on that could form the basis of a next generation expert system environment. These algorithms are based upon the axioms of set theory and probability theory. To separate these algorithms for approximate reasoning various conditions of mutual exclusivity and independence are imposed upon the assertions. Approximate reasoning algorithms presented include: reasoning with statistically independent assertions, reasoning with mutually exclusive assertions, reasoning with assertions that exhibit minimum overlay within the state space, reasoning with assertions that exhibit maximum overlay within the state space (i.e. fuzzy logic), pessimistic reasoning (i.e. worst case analysis), optimistic reasoning (i.e. best case analysis), and reasoning with assertions with absolutely no knowledge of the possible dependency among the assertions. A robust environment for expert system construction should include the two modes of inference: modus ponens and modus tollens. Modus ponens inference is based upon reasoning towards the conclusion in a statement of logical implication, whereas modus tollens inference is based upon reasoning away from the conclusion. These algorithms allow one to reason accurately with uncertain data. The above environment can replicate state-f-the-art expert system environments which provides a continuity between the current expert systems which cannot be validated or verified and future expert systems which should be both validated and verified

Murphy, John H.↗
DOE OSTI2024

Assessing the design of integrated methane sensing networks

Abstract While methane is the second largest contributor to global warming after carbon dioxide, it has a larger warming effect over a much shorter lifetime. Despite accelerated technological efforts to radically reduce global carbon dioxide emissions, rapid reductions in methane emissions are needed to limit near-term warming. Being primarily emitted as a byproduct from agricultural activities and energy extraction, methane is currently monitored via bottom–up (i.e. activity level) or top–down (via airborne or satellite retrievals) approaches. However, significant methane leaks remain undetected and emission rates are challenging to characterize with current monitoring frameworks. In this paper, we study the design of a layered monitoring approach that combines bottom–up and top–down approaches as an integrated sensing network. By recognizing that varying meteorological conditions and emission rates impact the efficacy of bottom–up monitoring, we develop a probabilistic approach to optimal sensor placement in its bottom–up network. Subsequently, we derive an inverse Bayesian framework to quantify the improvement that a design-optimized integrated framework has on emission-rate quantifications and their uncertainties. We find that under realistic meteorological conditions, the overall error in estimating the true emission rates is approximately 1.3 times higher, with their uncertainties being approximately 2.4 times higher, when using a randomized network over an optimized network, highlighting the importance of optimizing the design of integrated methane sensing networks. Further, we find that optimized networks can improve scenario coverage fractions by more than a factor of 2 over experimentally-studied networks, and identify a budget threshold beyond which the rate of optimized-network coverage improvement exhibits diminishing returns, suggesting that strategic sensor placement is also crucial for maximizing network efficiency.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2019

Scalable and efficient learning from crowds with Gaussian processes

Over the last few years, multiply-annotated data has become a very popular source of information. Online platforms such as Amazon Mechanical Turk have revolutionized the labelling process needed for any classification task, sharing the effort between a number of annotators (instead of the classical single expert). This crowdsourcing approach has introduced new challenging problems, such as handling disagreements on the annotated samples or combining the unknown expertise of the annotators. Probabilistic methods, such as Gaussian Processes (GP), have proven successful to model this new crowdsourcing scenario. However, GPs do not scale up well with the training set size, which makes them prohibitive for medium-to-large datasets (beyond 10K training instances). This constitutes a serious limitation for current real-world applications. In this work, we introduce two scalable and efficient GP-based crowdsourcing methods that allow for processing previously-prohibitive datasets. The first one is an efficient and fast approximation to GP with squared exponential (SE) kernel. The second allows for learning a more flexible kernel at the expense of a heavier training (but still scalable to large datasets). Since the latter is not a GP-SE approximation, it can be also considered as a whole new scalable and efficient crowdsourcing method, useful for any dataset size. Both methods use Fourier features and variational inference, can predict the class of new samples, and estimate the expertise of the involved annotators. A complete experimentation compares them with state-of-the-art probabilistic approaches in synthetic and real crowdsourcing datasets of different sizes. Finally, they stand out as the best performing approach for large scale problems. Moreover, the second method is competitive with the current state-of-the-art for small datasets.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2021

A Bayesian Calibration Framework with Embedded Model Error for Model Diagnostics

We study the utility and performance of a Bayesian model error embedding construction in the context of molecular dynamics modeling of metallic alloys, where we embed model error terms in existing interatomic potential model parameters. To alleviate the computational burden of this approach, we propose a framework combining likelihood approximation and Gaussian process surrogates. Here we leverage sparse Gaussian process techniques to construct a hierarchy of increasingly accurate but more expensive surrogate models. This hierarchy is then exploited by multilevel Markov chain Monte Carlo methods to efficiently sample from the target posterior distribution. We illustrate the utility of this approach by calibrating an interatomic potential model for a family of gold-copper alloys. In particular, this case study highlights effective means for dealing with computational challenges with Bayesian model error embedding in large-scale physical models, and the utility of embedded model error for model diagnostics.

Bayesian inference↗
DOE OSTI2020

Estimating posterior quantity of interest expectations in a multilevel scalable framework

Scalable approaches for uncertainty quantification are necessary for characterizing prediction confidence in large-scale subsurface flow simulations with uncertain permeability. To this end we explore a multilevel Monte Carlo approach for estimating posterior moments of a particular quantity of interest, where we employ an element-agglomerated algebraic multigrid (AMG) technique to generate the hierarchy of coarse spaces with guaranteed approximation properties for both the generation of spatially correlated random fields and the forward simulation of Darcy's law to model subsurface flow. In both these components (sampling and forward solves), we exploit solvers that rely on state-of-the-art scalable AMG. To illustrate the applicability of this approach, numerical tests are performed on two 3D examples-a unit cube and an egg-shaped domain with an irregular boundary-where the scalability of each simulation as well as the scalability of the overall algorithm are demonstrated.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

Orbit Determination Support for the Microwave Anisotropy Probe (MAP)

The Microwave Anisotropy Probe (MAP) is a Medium Class Explorers (MIDEX) mission produced in partnership between Goddard Space Flight Center (GSFC) and Princeton University. The main science objective of the MAP mission is to produce an accurate full-sky map of the cosmic microwave background temperature fluctuations anisotropy. MAP was launched from the Cape Canaveral Air Force Station Complex 17 aboard a Delta II 7425-10 expendable launch vehicle at exactly 19:46:46.183 UTC on June 30, 2001. The spacecraft received a nominal direct insertion by the Delta into a 185 km circular orbit. MAP was then maneuvered into a sequence of phasing loops designed to set up a lunar swingby (gravity-assisted acceleration) of the spacecraft onto a transfer trajectory to a Lissajous orbit about the Earth-Sun L2 point. The mission duration is approximately 27 months with 3 to 4 months of transfer time to the final mission orbit about L2. The MAP transfer orbit consisted of 3.5 phasing loops: the first loop has a 7-day period, the second and third loops have a 9-day period, and the last half loop has a 4-day period as illustrated in Figure 1, which also indicates the placement of maneuvers. A Pfinal correction maneuver was performed 18 hours after the last perigee to more closely achieve the targeted lissajous orbit. The lunar encounter or swingby took place approximately 30 days after launch. After the lunar encounter, the spacecraft will cruise for approximately 120 days before it arrives at L2. A Mid-Course Correction (MCC) maneuver was executed seven days after the swingby to further refine the trajectory. Once the MAP satellite is injected into the L2 Lissajous orbit, it will perform occasional stationkeeping maneuvers to maintain the Lissajous orbit for a minimum of two years (and a goal of four years). Because of its complex orbital characteristics, the mission provided a unique challenge to orbit determination (OD) support in many orbital regimes. Extensive trajectory error covariance analysis was performed to predict ephemeris accuracy for the OD process using a Bayesian least-squares technique. The orbit determination error analysis is essential for maneuver planning and maneuver recovery study. Several tracking scenarios were investigated for each phase of the mission. This paper provides a summary of the premission trajectory covariance error analysis, as well as actual real-time OD results. The use and impact of the various tracking stations, systems, and measurements will be discussed. Details of the operational OD support and the inferred OD accuracy will be presented, and the results will be compared to the premission covariance analysis, In addition, there will be a discussion of the challenges presented to OD support including delta-Vs at apogee as well as perigee, and effects due to spacecraft attitude mode, in light of their implications to the OD accuracy and covariance analysis.

Truong, Son H.↗
NASA NTRS2021

Analysis of simultaneous aerosol and ocean glint retrieval using multi-angle observations

Since early 2000, NASA's Multi-angle Imaging SpectroRadiometer (MISR) instrument has been performing remote sensing retrievals of aerosol optical properties from the polar-orbiting Terra spacecraft. A noteworthy aspect of MISR observations over the ocean is that, for much of the Earth, some of the multi-angle views have contributions from solar reflection by the ocean surface (glint, or glitter), while others do not. Aerosol retrieval algorithms often discard these glint-influenced observations because they can overwhelm the signal and are difficult to predict without knowledge of the (wind-speed-driven) ocean surface roughness. However, theoretical studies have shown that multi-angle observations of a location at geometries with and without reflected sun glint can be a rich source of information, sufficient to support simultaneous retrieval of both the aerosol state and the wind speed at the ocean surface. We are in the early stages of creating such an algorithm. In this paper, we describe our assessment of the appropriate level of parameterization for simultaneous aerosol and ocean surface property retrievals using sun glint. For this purpose, we use generalized nonlinear retrieval analysis (GENRA), an information content assessment (ICA) technique employing Bayesian inference, and simulations from the Ahmad–Fraser iterative radiative transfer code. We find that four parameters are suitable: aerosol optical depth (τ), particle size distribution (expressed as the fine mode fraction f of small particles in a bimodal size distribution), surface wind speed (w), and relative humidity (r, to define the aerosol water content and complex refractive index). None of these parameters define ocean optical properties, as we found that the aerosol state could be retrieved with the nine MISR near-infrared views alone, where the ocean body is strongly absorbing in the open ocean. We also found that retrieval capability varies with observation geometry and that as τ increases so does the ability to determine aerosol intensive optical properties (r and f, while it decreases for w). Increases in w decrease the ability to determine the true value of that parameter but have minimal impact on retrieval of aerosol properties. We explored the benefit of excluding the two most extreme MISR view angles for which radiative transfer with the plane-parallel approximation is less certain, but we found no advantage in doing so. Finally, the impact of treating wind speed as a scalar parameter, rather than as a two-parameter directional wind, was tested. While the simpler scalar model does contribute to overall aerosol uncertainty, it is not sufficiently large to justify the addition of another dimension to parameter space. An algorithm designed upon these principles is in development. It will be used to perform an atmospheric correction with MISR for coincident ocean color (OC) observations by the Moderate Resolution Imaging Spectroradiometer (MODIS) instrument, also on the NASA Terra spacecraft. Unlike MISR, MODIS is a single-view-angle instrument, but it has a more complete set of spectral channels ideal for determination of optical ocean properties. The atmospheric correction of MODIS OC data can therefore benefit from MISR aerosol retrievals. Furthermore, higher-spatial-resolution data from coincident MISR observations may also improve glint screening.

Kirk Knobelspiesse↗
DOE OSTI2020

We Know Where We Don't Know: 3D Bayesian CNNs for Credible Geometric Uncertainty

Deep learning has been successfully applied to the segmentation of 3D Computed Tomography (CT) scans. Establishing the credibility of these segmentations requires uncertainty quantification (UQ) to identify untrustworthy predictions. Recent UQ architectures include Monte Carlo dropout networks (MCDNs), which approximate deep Gaussian processes, and Bayesian neural networks (BNNs), which learn the distribution of the weight space. BNNs are advantageous over MCDNs for UQ but are thought to be computationally infeasible in high dimension, and neither architecture has produced interpretable geometric uncertainty maps. We propose a novel 3D Bayesian convolutional neural network (BCNN), the first deep learning method which generates statistically credible geometric uncertainty maps and scales for application to 3D data. We present experimental results on CT scans of graphite electrodes and laser-welded metals and show that our BCNN outperforms an MCDN in recent uncertainty metrics. The geometric uncertainty maps generated by our BCNN capture distributions of sigmoid values that are interpretable as confidence intervals, critical for applications that rely on deep learning for high-consequence decisions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Bayesian Static Parameter Estimation for Partially Observed Diffusions via Multilevel Monte Carlo

In this article we consider static Bayesian parameter estimation for partially observed diffusions that are discretely observed. We work under the assumption that one must resort to discretizing the underlying diffusion process, for instance, using the Euler--Maruyama method. Given this assumption, we show how one can use Markov chain Monte Carlo (MCMC) and particularly particle MCMC [C. Andrieu, A. Doucet, and R. Holenstein, J. R. Stat. Soc. Ser. B Stat. Methodol., 72 (2010), 269--342] to implement a new approximation of the multilevel (ML) Monte Carlo (MC) collapsing sum identity. Our approach comprises constructing an approximate coupling of the posterior density of the joint distribution over parameter and hidden variables at two different discretization levels and then correcting by an importance sampling method. The variance of the weights are independent of the length of the observed data set. The utility of such a method is that, for a prescribed level of mean square error, the cost of this MLMC method is provably less than i.i.d. sampling from the posterior associated to the most precise discretization. However the method here comprises using only known and efficient simulation methodologies. Finally, the theoretical results are illustrated by inference of the parameters of two prototypical processes given noisy partial observations of the process: the first is an Ornstein--Uhlenbeck process and the second is a more general Langevin equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Exact and efficient hybrid Monte Carlo algorithm for accelerated Bayesian inference of gene expression models from snapshots of single-cell transcripts

Single cells exhibit a significant amount of variability in transcript levels, which arises from slow, stochastic transitions between gene expression states. Elucidating the nature of these states and understanding how transition rates are affected by different regulatory mechanisms require state-of-the-art methods to infer underlying models of gene expression from single cell data. A Bayesian approach to statistical inference is the most suitable method for model selection and uncertainty quantification of kinetic parameters using small data sets. However, this approach is impractical because current algorithms are too slow to handle typical models of gene expression. To solve this problem, we first show that time-dependent mRNA distributions of discrete-state models of gene expression are dynamic Poisson mixtures, whose mixing kernels are characterized by a piecewise deterministic Markov process. Here, we combined this analytical result with a kinetic Monte Carlo algorithm to create a hybrid numerical method that accelerates the calculation of time-dependent mRNA distributions by 1000-fold compared to current methods. We then integrated the hybrid algorithm into an existing Monte Carlo sampler to estimate the Bayesian posterior distribution of many different, competing models in a reasonable amount of time. We demonstrate that kinetic parameters can be reasonably constrained for modestly sampled data sets if the model is known a priori. If there are many competing models, Bayesian evidence can rigorously quantify the likelihood of a model relative to other models from the data. We demonstrate that Bayesian evidence selects the true model and outperforms approximate metrics typically used for model selection.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Uncertainty quantification for incident helium flux in plasma-exposed tungsten

In this work, the surface response of a tungsten plasma-facing component was simulated by a cluster-dynamics code, Xolotl, with a focus on quantifying the impact of uncertainty in one of the input parameters to Xolotl, namely, the incident helium flux. The simulated conditions involve a tungsten surface exposed to 100 eV helium ion implantations with a flux of either 4 × 10 22 or 4 × 10 25 He m -2 s -1 . Furthermore, two sources were used to describe the implanted helium depth distribution in tungsten, either molecular dynamics (MD) or a binary collision approximation code, the stopping and range of ions in matter (SRIM). The aim of this work is to evaluate and examine uncertain predictions on the helium retention based on these two different modeling methodologies that either neglect electronic energy loss or the crystalline structure of the solid, respectively. An embedded model-form error approach was pursued here in order to arrive at predictions that account for variability due to the two different data sources, and the impact of this model-form uncertainty in incident helium flux on Xolotl output was presented for the two implantation fluxes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Synthesis of observed and simulated rain microphysics to inform a new Bayesian statistical framework for microphysical parameterization in climate models (Final Scientific Report)

This project aimed to investigate a new approach to bulk microphysics schemes. We identified the need to move beyond the fixed structural assumptions and approximation of existing schemes. For example, most schemes assume some functional form for the rain drop size distribution (e.g. a gamma or exponential distribution). Most schemes then evolve some number of statistical moments of that distribution via various processes, such as evaporation, sedimentation, collision-coalescence, and collisional breakup. These microphysical processes, in turn, are typically some fixed functional form derived from either some other (more detailed) model, or using some single-particle rates that are then integrated over the size distribution. While these process rate functions may have some free parameters to adjust, in other cases doing so is impossible (e.g. when the process rates are analytical or piecewise solutions to some target function). Our goal was to build and test a scheme that assumed no size distribution form, and used a series of power laws as the basis for the process rates. Moments of the size distribution would be predicted, but no underlying size distribution would be specified. Any number or choice of size distribution moments could be used, and any number of power laws could be employed to model the process rates. Thus, our approach is flexible, and can seamlessly scale across levels of complexity, as demanded by the data. Bayesian inference then would provide the formalism to estimate the model parameters and structure, allowing for robust uncertainty quantification. We proposed testing this framework in idealized simulations using bin microphysical schemes as a data source. We also proposed using real data to inform our microphysics scheme, and also that we would integrate our scheme into WRF.

58 GEOSCIENCES↗
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 OSTI2025

Evolution of in-medium baryon-baryon scattering cross sections and stiffness of dense nuclear matter from Bayesian analyses of FOPI proton-flow excitation functions

Within a Bayesian statistical framework using a Gaussian process (GP) emulator for an isospin-dependent Boltzmann-Uehling-Uhlenbeck (IBUU) transport model simulator of heavy-ion reactions with momentum-independent Skyrme interactions, we infer from the proton directed and elliptical flow in mid-central Au + Au reactions, measured at beam energies from 150 to 1200 MeV/nucleon by the FOPI Collaboration, the posterior probability distribution functions (PDFs) of the in-medium baryon-baryon scattering cross section (BBSCS) modification factor 𝑋 (with respect to their free-space values) and the stiffness parameter 𝐾 of dense nuclear matter. Here, we find that the most probable value of 𝑋 evolves from around 0.7 to 1.0 as the beam energy 𝐸 beam /𝐴 increases. On the other hand, the posterior PDF⁡(𝐾) may have dual peaks having roughly the same height or extended shoulders at high 𝐾 values. More quantitatively, the posterior PDF⁡(𝐾) changes from having a major peak around 220 MeV, characterizing a soft EOS in the reaction at 𝐸 beam /𝐴 = 150 MeV, to one that peaks around 320 MeV, indicating a stiff EOS in the reactions at 𝐸 beam /𝐴 higher than about 600 MeV. The transition from soft to stiff happens in mid-central Au + Au reactions at beam energies around 250 MeV/nucleon in which 𝐾 = 220 MeV and 𝐾 = 320 MeV are approximately equally probable. Altogether, the FOPI proton-flow excitation function data indicate a gradual hardening of hot and dense nuclear matter as its density and temperature increase in reactions with higher beam energies.

nuclear matter↗
DOE OSTI2025

Sharp detection of low-dimensional structure in probability measures via dimensional logarithmic Sobolev inequalities

Identifying low-dimensional structure in high-dimensional probability measures is an essential pre-processing step for efficient sampling. To identify this structure, we approximate the target measure as a perturbation of an arbitrary reference measure along a few directions in $\mathbb{R}^{d}$. These directions are determined by minimizing an upper bound on the Kullback–Leibler (KL) divergence between the target and its approximation. Our contribution improves upon previous works by leveraging dimensional logarithmic Sobolev inequalities to refine the bound on the KL divergence. These inequalities lead to a uniformly tighter bound on the KL divergence, thereby enhancing the identification of the most significant perturbation directions. In particular, when the target and reference are both Gaussian, minimizing the resulting bound is equivalent to minimizing the KL divergence. We further demonstrate the applicability of this analysis to the squared Hellinger distance, where analogous reasoning shows that the dimensional Poincaré inequality offers improved bounds.

Bayesian inference↗
DOE OSTI2019

Multi-fidelity classification using Gaussian processes: Accelerating the prediction of large-scale computational models

We report that machine learning techniques typically rely on large datasets to create accurate classifiers. However, there are situations when data is scarce and expensive to acquire. This is the case of studies that rely on state-of-the-art computational models which typically take days to run, thus hindering the potential of machine learning tools. In this work, we present a novel classifier that takes advantage of lower fidelity models and inexpensive approximations to predict the binary output of expensive computer simulations. We postulate an autoregressive model between the different levels of fidelity with Gaussian process priors. We adopt a fully Bayesian treatment for the hyper-parameters and use Markov Chain Monte Carlo samplers. We take advantage of the probabilistic nature of the classifier to implement active learning strategies. We also introduce a sparse approximation to enhance the ability of the multi-fidelity classifier to handle a large amount of low fidelity samples. We test these multi-fidelity classifiers against their single-fidelity counterpart with synthetic data, showing a median computational cost reduction of 23% for a target accuracy of 90%. In an application to cardiac electrophysiology, the multi-fidelity classifier achieves an F1 score, the harmonic mean of precision and recall, of 99.6% compared to 74.1% of a single-fidelity classifier when both are trained with 50 samples. In general, our results show that the multi-fidelity classifiers outperform their single-fidelity counterpart in terms of accuracy in all cases. Finally, we envision that this new tool will enable researchers to study classification problems that would otherwise be prohibitively expensive. Source code is available at https://github.com/fsahli/MFclass.

97 MATHEMATICS AND COMPUTING↗