Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “posterior 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 19 records

Assessing and benchmarking the fidelity of posterior inference methods for astrophysics data analysis

In this era of large and complex astronomical survey data, interpreting, validating, and comparing inference techniques becomes increasingly difficult. This is particularly critical for emerging inference methods like Simulation-Based Inference (SBI), which offer significant speedup potential and posterior modeling flexibility, especially when deep learning is incorporated. We present a study to assess and compare the performance and uncertainty prediction capability of Bayesian inference algorithms – from traditional MCMC sampling of analytic functions to deep learning-enabled SBI. We focus on testing the capacity of hierarchical inference modeling in those scenarios. Before we extend this study to cosmology, we first use astrophysical simulation data to ensure interpretability. We demonstrate a probabilistic programming implementation of hierarchical and non-hierarchical Bayesian inference using simulations derived from the DeepBench software library, a benchmarking tool developed by our group that generates simple and controllable astrophysical objects from first principles. This study will enable astronomers and physicists to harness the inference potential of these methods with confidence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Mapping Stellar Surfaces. II. An Interpretable Gaussian Process Model for Light Curves

The use of Gaussian processes (GPs) as models for astronomical time series data sets has recently become almost ubiquitous, given their ease of use and flexibility. In particular, GPs excel at marginalization over the stellar signal when the variability due to starspots is treated as a nuisance, as in exoplanet transit modeling. However, these effective models are less useful in cases where the starspot signal is of primary interest, since it is not obvious how the parameters of the GP relate to physical parameters like the spot size, contrast, and latitudinal distribution. Instead, it is common practice to explicitly model the effect of individual starspots on the light curve and attempt to infer their properties via optimization or posterior inference. Unfortunately, this process is ill-posed and often computationally intractable when applied to stars with more than a few spots and/or to ensembles of many stars. Here we derive a closed-form expression for a GP that describes the light curve of a rotating, evolving stellar surface conditioned on a given distribution of starspot sizes, contrasts, and latitudes. We demonstrate that this model is correctly calibrated, allowing one to robustly infer physical parameters of interest from one or more light curves, including the typical spot radii and latitudes. Our GP has far-ranging implications for understanding the variability and magnetic activity of stars from light curves and radial velocity measurements, as well as for modeling correlated noise in exoplanet searches. Our implementation is efficient, user-friendly, and open-source, available in the package starry-process.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Attraction Indian Buffet Distribution

We propose the attraction Indian buffet distribution (AIBD), a distribution for binary feature matrices influenced by pairwise similarity information. Binary feature matrices are used in Bayesian models to uncover latent variables (i.e., features) that explain observed data. The Indian buffet process (IBP) is a popular exchangeable prior distribution for latent feature matrices. In the presence of additional information, however, the exchangeability assumption is not reasonable or desirable. The AIBD can incorporate pairwise similarity information, yet it preserves many properties of the IBP, including the distribution of the total number of features. Thus, much of the interpretation and intuition that one has for the IBP directly carries over to the AIBD. A temperature parameter controls the degree to which the similarity information affects feature-sharing between observations. Unlike other nonexchangeable distributions for feature allocations, the probability mass function of the AIBD has a tractable normalizing constant, making posterior inference on hyperparameters straight-forward using standard MCMC methods. A novel posterior sampling algorithm is proposed for the IBP and the AIBD. We demonstrate the feasibility of the AIBD as a prior distribution in feature allocation models and compare the performance of competing methods in simulations and an application.

97 MATHEMATICS AND COMPUTING↗

pop-cosmos : redshifts and physical properties of KiDS-1000 galaxies

ABSTRACT Principled Bayesian inference of galaxy properties has not previously been performed for wide-area weak-lensing surveys with millions of sources. We address this gap by applying the pop-cosmos generative model to perform spectral energy distribution (SED) fitting for 4 million KiDS (Kilo-Degree Survey)-1000 galaxies. Calibrated on deep COSMOS2020 photometric data, pop-cosmos specifies a physically motivated prior over the galaxy population up to $z \simeq 6$ in stellar population synthesis (SPS) parameter space. Using the Speculator SPS emulator with GPU (graphics processing unit)-accelerated Markov Chain Monte Carlo sampling, we perform full posterior inference at 8.2 GPU seconds per galaxy, obtaining joint constraints on galaxy redshifts and physical properties. We validate photometric redshifts against $\sim \!185\,\!000$ KiDS galaxies cross-matched to Dark Energy Spectroscopic Instrument Data Release 1 spectroscopic samples, achieving low bias ($2\times 10^{-3}$), scatter ($\sigma _{\mathrm{MAD}}=0.03$), and outlier fraction (3.2 per cent) for the Bright Galaxy Survey, with comparable performance (bias $3\times 10^{-2}$, $\sigma _{\mathrm{MAD}}=0.05$, 1.0 per cent outliers) for luminous red galaxies (LRGs). Within the LRG sample, we identify massive, dusty, star-forming contaminants at $z \simeq 0.4$ satisfying standard colour selections for quenched populations. We infer trends in stellar mass, star formation, metallicity, and dust across five tomographic redshift bins consistent with established scaling relations. Using specific star formation rate constraints, we identify $\sim$7 per cent of KiDS-1000 galaxies as quenched, versus 37 per cent implied by conservative colour cuts. This enables the construction of weak-lensing samples defined by physical properties while mitigating intrinsic alignment systematics and preserving statistical power. Our analysis validates pop-cosmos out of sample, establishing it as a scalable approach for galaxy evolution and cosmological analyses with photometric surveys.

Halder, Anik [Institute of Astronomy and Kavli Ins↗

A flexible class of priors for orthonormal matrices with basis function-specific structure

Statistical modeling of high-dimensional matrix-valued data motivates the use of a low-rank representation that simultaneously summarizes key characteristics of the data and enables dimension reduction. Low-rank representations commonly factor the original data into the product of orthonormal basis functions and weights, where each basis function represents an independent feature of the data. However, the basis functions in these factorizations are typically computed using algorithmic methods that cannot quantify uncertainty or account for basis function correlation structure a priori. While there exist Bayesian methods that allow for a common correlation structure across basis functions, empirical examples motivate the need for basis function-specific dependence structure. We propose a prior distribution for orthonormal matrices that can explicitly model basis function-specific structure. The prior is used within a general probabilistic model for singular value decomposition to conduct posterior inference on the basis functions while accounting for measurement error and fixed effects. We discuss how the prior specification can be used for various scenarios and demonstrate favorable model properties through synthetic data examples. Finally, we apply our method to two-meter air temperature data from the Pacific Northwest, enhancing our understanding of the Earth system’s internal variability.

97 MATHEMATICS AND COMPUTING↗

Gaussian processes meet NeuralODEs: a Bayesian framework for learning the dynamics of partially observed systems from scarce and noisy data

We present a machine learning framework (GP-NODE) for Bayesian model discovery from partial, noisy and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling and Gaussian Process priors over the observed system states. This allows us to exploit temporal correlations in the observed data, and efficiently infer posterior distributions over plausible models with quantified uncertainty. The use of the Finnish Horseshoe as a sparsity-promoting prior for free model parameters also enables the discovery of parsimonious representations for the latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed GP-NODE method including predator–prey systems, systems biology and a 50-dimensional human motion dynamical system. This article is part of the theme issue ‘Data-driven prediction in dynamical systems’.

Science & Technology - Other Topics↗

Bayesian mixture model approach to quantifying the empirical nuclear saturation point

The equation of state (EOS) in the limit of infinite symmetric nuclear matter exhibits an equilibrium density, $n_0 \approx 0.16 \, \mathrm{fm}^{-3}$, at which the pressure vanishes and the energy per particle attains its minimum, $E_0 \approx -16 \, \mathrm{MeV}$. Although not directly measurable, the nuclear saturation point $(n_0,E_0)$ can be extrapolated by density functional theory (DFT), providing tight constraints for microscopic interactions derived from chiral effective field theory (EFT). However, when considering several DFT predictions for $(n_0,E_0)$ from Skyrme and Relativistic Mean Field (RMF) models together, a discrepancy between these model classes emerges at high confidence levels that each model prediction's uncertainty cannot explain. How can we leverage these DFT constraints to rigorously benchmark nuclear saturation properties of chiral interactions? To address this question, we present a Bayesian mixture model that combines multiple DFT predictions for $(n_0,E_0)$ using an efficient conjugate prior approach. The inferred posterior distribution for the saturation point's mean and covariance matrix follows a Normal-inverse-Wishart class, resulting in posterior predictives in the form of correlated, bivariate $t$-distributions. The DFT uncertainty reports are then used to mix these posteriors using an ordinary Monte Carlo approach. At the 95\% credibility level, we estimate $n_0 \approx 0.157 \pm 0.010 \, \mathrm{fm}^{-3}$ and $E_0 \approx -15.97 \pm 0.40 \, \mathrm{MeV}$ for the marginal (univariate) $t$-distributions. Combined with chiral EFT calculations of the pure neutron matter EOS, we obtain bivariate normal distributions for the nuclear symmetry energy and its slope parameter evaluated at $n_0$: $S_v \approx 32.0 \pm 1.1 \, \mathrm{MeV}$ and $L\approx 52.6\pm 8.1 \, \mathrm{MeV}$ (95\%), respectively. Furthermore, our Bayesian framework is publicly available, so practitioners can readily use and extend our results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Improving Trustworthiness of Data-Driven Power Grid Contingency Analysis With Bayesian Residual Graph Neural Networks

The evolving energy landscape requires novel tools to efficiently perform contingency analysis and reliability assessment of power grids, potentially in real-time. The high computational cost of traditional power flow solvers limits their applicability in practice. Machine learning (ML) surrogates such as deep neural networks (NNs) accelerate power flow solvers computations, enabling high-order contingency analysis and real-time decision-making by learning highly nonlinear functions and integrating grid topology via graph architectures. However, (graph) NNs lack predictive power away from training data and do not provide predictive confidence estimates. Here, we present a Bayesian residual graph NN that integrates knowledge from low-fidelity data via residual training and embeds granular quantification of uncertainties, improving trustworthiness critical for high-consequence decision-making. Applying Bayesian concepts to NNs is challenging due to the high-dimensionality of both the parameter space, complicating derivation of a meaningful prior, and the output space in large grid systems, requiring enhanced techniques to assess the predicted high-dimensional uncertainties. Our contributions include: (1) Deriving a prior for fully connected and graph NNs that leverages low-fidelity data to guide mean predictions and appropriately control prior predictive uncertainty. (2) Integrating this prior within an ensembling with anchoring scheme for efficient approximate posterior inference. (3) Deriving enhanced metrics to assess accuracy of both the mean and uncertainty predictions in high dimensions, appropriately accounting for correlations propagated through graph layers. The resulting Bayesian residual graph NN is tested on a contingency analysis task for 14-bus and 118-bus grids.

24 - POWER TRANSMISSION AND DISTRIBUTION↗

An Efficient Bayesian Approach to Learning Droplet Collision Kernels: Proof of Concept Using “Cloudy,” a New n -Moment Bulk Microphysics Scheme

The small-scale microphysical processes governing the formation of precipitation particles cannot be resolved explicitly by cloud resolving and climate models. Instead, they are represented by microphysics schemes that are based on a combination of theoretical knowledge, statistical assumptions, and fitting to data (“tuning”). Historically, tuning was done in an ad hoc fashion, leading to parameter choices that are not explainable or repeatable. Recent work has treated it as an inverse problem that can be solved by Bayesian inference. The posterior distribution of the parameters given the data—the solution of Bayesian inference—is found through computationally expensive sampling methods, which require over $\mathcal{O}$(10 5 ) evaluations of the forward model; this is prohibitive for many models. We present a proof of concept of Bayesian learning applied to a new bulk microphysics scheme named “Cloudy,” using the recently developed Calibrate-Emulate-Sample (CES) algorithm. Cloudy models collision-coalescence and collisional breakup of cloud droplets with an adjustable number of prognostic moments and with easily modifiable assumptions for the cloud droplet mass distribution and the collision kernel. The CES algorithm uses machine learning tools to accelerate Bayesian inference by reducing the number of forward evaluations needed to $\mathcal{O}$(10 2 ). It also exhibits a smoothing effect when forward evaluations are polluted by noise. In a suite of perfect-model experiments, we show that CES enables computationally efficient Bayesian inference of parameters in Cloudy from noisy observations of moments of the droplet mass distribution. In an additional imperfect-model experiment, a collision kernel parameter is successfully learned from output generated by a Lagrangian particle-based microphysics model.

54 ENVIRONMENTAL SCIENCES↗

Enhancing approximate modular Bayesian inference by emulating the conditional posterior

In modular Bayesian analyses, complex models are composed of distinct modules, each representing different aspects of the data or prior information. In this context, fully Bayesian approaches can sometimes lead to undesirable feedback between modules, compromising the integrity of the inference. The “cut-distribution” prevents unwanted influence between modules by “cutting” feedback. The direct sampling (DS) algorithm is standard practice for approximating the cut-distribution, but it can be computationally intensive, especially when the number of imputations required is large. An enhanced method is proposed, the Emulating the Conditional Posterior (ECP) algorithm, which leverages emulation to increase the number of imputations. Through numerical experiment it is demonstrated that the ECP algorithm outperforms the traditional DS approach in terms of accuracy and computational efficiency, particularly when resources are constrained. Here, it is also shown how the DS algorithm can be improved using ideas from design of experiments. Some practical recommendations are given for algorithm choice in modular Bayesian analyses.

97 MATHEMATICS AND COMPUTING↗

DIGS: deep inference of galaxy spectra with neural posterior estimation

Abstract With the advent of billion-galaxy surveys with complex data, the need of the hour is to efficiently model galaxy spectral energy distributions (SEDs) with robust uncertainty quantification. The combination of simulation-based inference (SBI) and amortized neural posterior estimation (NPE) has been successfully used to analyse simulated and real galaxy photometry both precisely and efficiently. In this work, we utilise this combination and build on existing literature to analyse simulated noisy galaxy spectra. Here, we demonstrate a proof-of-concept study of spectra that is (a) an efficient analysis of galaxy SEDs and inference of galaxy parameters with physically interpretable uncertainties; and (b) amortized calculations of posterior distributions of said galaxy parameters at the modest cost of a few galaxy fits with Markov chain Monte Carlo (MCMC) methods. We utilise the SED generator and inference framework Prospector to generate simulated spectra, and train a dataset of 2 × 10 6 spectra (corresponding to a five-parameter SED model) with NPE. We show that SBI—with its combination of fast and amortized posterior estimations—is capable of inferring accurate galaxy stellar masses and metallicities. Our uncertainty constraints are comparable to or moderately weaker than traditional inverse-modelling with Bayesian MCMC methods (e.g. 0.17 and 0.26 dex in stellar mass and metallicity for a given galaxy, respectively). We also find that our inference framework conducts rapid SED inference (0.9–1.2 × 10 5 galaxy spectra via SBI/NPE at the cost of 1 MCMC-based fit). With this work, we set the stage for further work that focuses of SED fitting of galaxy spectra with SBI, in the era of JWST galaxy survey programs and the wide-field Roman Space Telescope spectroscopic surveys.

spectroscopy↗

Bayesian inference of fine features of the nuclear equation of state from future neutron star radius measurements to 0.1 km accuracy

To more precisely constrain the equation of state (EOS) of supradense neutron-rich nuclear matter, future high-precision x-ray and gravitational wave observatories are proposed to measure the radii of neutron stars (NSs) with an accuracy better than about 0.1 km. However, it remains unclear what particular aspects (other than the stiffness generally spoken of in the literature) of the EOS and to what precision they will be better constrained. In this work, within a Bayesian framework using a metamodel EOS for NSs, we infer the posterior probability distribution functions (PDFs) of incompressibility K 0 and skewness J 0 of symmetric nuclear matter (SNM) as well as the slope L, curvature K sym , and skewness J sym characterizing the density dependence of nuclear symmetry energy E sym ⁡(ρ), respectively, from mean values of NS radii consistent with existing observations and an expected accuracy Δ⁢R ranging from about 1.0 to 0.1 km. Here, we found that (1) the Δ⁢R has little effect on inferring the stiffness of SNM at suprasaturation densities, (2) smaller Δ⁢R reveals more accurately not only the PDFs but also pairwise correlations among parameters characterizing high-density E sym ⁡(ρ), (3) a double-peak feature of the PDF(K sym ) corresponding to the strong K sym – J sym and K sym – L anticorrelations is revealed when Δ⁢R is less than about 0.2 km, and the locations of the two peaks are sensitive to the maximum value of J sym reflecting the stiffness of E sym ⁡(ρ) above about 3 times the saturation density ρ 0 of SNM, and (4) the high-precision radius measurement for canonical NSs is more useful than that for massive ones for constraining the EOS of nucleonic matter around (2–3)⁢ρ 0 .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Bayesian inference of nuclear-matter density from proton scattering

Background: Proton elastic scattering at intermediate energy is widely employed as a tool for determining the matter radius of atomic nuclei. Here, the sensitivity of the approach relies on high-resolution measurements at small scattering angles and low-momentum transfer. Under these conditions, the Glauber multiple scattering theory accurately describes the proton-nucleus elastic cross section. Purpose: Investigate the sensitivity of the Glauber multiple scattering theory to uncertainties associated with input parameters such as the nuclear-matter density distribution and nucleon-nucleon data. Method: A joint Bayesian inference was performed using 12 angular distributions of elastic scattering at different energies on 58 Ni, 90 Zr, and 208 Pb targets. A Metropolis-Hastings algorithm was implemented to make an uncertainty quantification analysis for the input parameters used in the Glauber multiple scattering theory. Results: The experimental cross sections were fitted simultaneously using a joint Bayesian inference approach. Posterior probability density distributions of 42 input parameters were obtained from the analysis. A moderate correlation between the nuclear density parameters and the nucleon-nucleon cross sections was found. This correlation impacts the extraction of the nuclear-matter radius. Conclusions: The present analysis provided a consistent method for extracting the nuclear-matter density distribution of 58 Ni, 90 Zr, and 208 Pb from data across different incident energies. Due to the correlation of the nucleon-nucleon cross sections with the other input parameters, a constrained Bayesian inference using free nucleon-nucleon cross section data was performed. The nuclear-matter radii obtained from the analysis are in good agreement with multiple results reported in the literature.

190 ≤ A ≤ 219↗

A forward modeling approach to analyzing galaxy clustering with S IM BIG

We present cosmological constraints from a simulation-based inference (SBI) analysis of galaxy clustering from the SimBIG forward modeling framework. SimBIG leverages the predictive power of high-fidelity simulations and provides an inference framework that can extract cosmological information on small nonlinear scales. In this work, we apply SimBIG to the Baryon Oscillation Spectroscopic Survey (BOSS) CMASS galaxy sample and analyze the power spectrum, P ℓ (k), to k max = 0.5 h/Mpc. We construct 20,000 simulated galaxy samples using our forward model, which is based on 2,000 high-resolution Quijote N -body simulations and includes detailed survey realism for a more complete treatment of observational systematics. We then conduct SBI by training normalizing flows using the simulated samples and infer the posterior distribution of ΛCDM cosmological parameters: Ω m , Ω b , h, n s , σ 8 . We derive significant constraints on Ω m and σ 8 , which are consistent with previous works. Our constraint on σ 8 is 27% more precise than standard P ℓ analyses because we exploit additional cosmological information on nonlinear scales beyond the limit of current analytic models, k > 0.25 h/Mpc. This improvement is equivalent to the statistical gain expected from a standard P ℓ analysis of galaxy sample ~ 60% larger than CMASS. While we focus on P ℓ in this work for validation and comparison to the literature, SimBIG provides a framework for analyzing galaxy clustering using any summary statistic. We expect further improvements on cosmological constraints from subsequent SimBIG analyses of summary statistics beyond P ℓ .

79 ASTRONOMY AND ASTROPHYSICS↗

Morphostatistical characterization of the spatial galaxy distribution through Gibbs point processes

ABSTRACT This paper proposes a morphostatistical characterization of the galaxy distribution through spatial statistical modelling based on inhomogeneous Gibbs point processes. The galaxy distribution is supposed to exhibit two components. The first one is related to the major geometrical features exhibited by the observed galaxy field, here, its corresponding filamentary pattern. The second one is related to the interactions exhibited by the galaxies. Gibbs point processes are statistical models able to integrate these two aspects in a probability density, controlled by some parameters. Several such models are fitted to real observational data via the ABC shadow algorithm. This algorithm provides simultaneous parameter estimation and posterior-based inference, hence allowing the derivation of the statistical significance of the obtained results.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerating Hamiltonian Monte Carlo for Bayesian inference in neural networks and neural operators

Hamiltonian Monte Carlo (HMC) is a powerful and accurate method to sample from the posterior distribution in Bayesian inference. However, HMC techniques are computationally demanding for Bayesian neural networks due to the high dimensionality of the network’s parameter space and the non-convexity of their posterior distributions. Therefore, various approximation techniques, such as variational inference (VI) or stochastic gradient MCMC, are often employed to infer the posterior distribution of the network parameters. Such approximations introduce inaccuracies in the inferred distributions, resulting in unreliable uncertainty estimates. In this work, we propose a hybrid approach that combines inexpensive VI and accurate HMC methods to efficiently and accurately quantify uncertainties in neural networks and neural operators. The proposed approach leverages an initial VI training on the full network. We examine the influence of individual parameters on the prediction uncertainty, which shows that a large proportion of the parameters do not contribute substantially to uncertainty in the network predictions. This information is then used to significantly reduce the dimension of the parameter space, and HMC is performed only for the subset of network parameters that strongly influence prediction uncertainties. This yields a framework for accelerating the full batch HMC for posterior inference in neural networks. We demonstrate the efficiency and accuracy of the proposed framework on deep neural networks and operator networks, showing that inference can be performed for large networks with tens to hundreds of thousands of parameters. Finally, we show that this method can effectively learn surrogates for complex physical systems by modeling the operator that maps from upstream conditions to wall-pressure data on a cone in hypersonic flow.

Bayesian inference↗