Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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

Probabilistic Inference of Low-Surface-Brightness Galaxy Morphological Parameters Using Simulation-Based Inference

Low-surface-brightness galaxies (LSBGs) are diffuse, often dark-matter-dominated systems whose faintness makes their structural parameters difficult to measure reliably in wide-field imaging surveys. Robust parameter inference, including uncertainty quantification, is important for population studies and for comparisons with models of galaxy formation, as future surveys are expected to produce increasingly large samples of diffuse galaxies. In practice, LSBG profile modeling is sensitive to sky- background errors, masking choices, contaminating background sources, and the computational cost of obtaining posterior-level uncertainties for large samples. Motivated by these questions, we develop a simulation-based inference (SBI) framework for estimating posterior distributions of LSBG morphological parameters from simulated galaxy images. Using PyImfit, we generate DES-like single-Sersic profile LSBG images with known position angle, ellipticity, Sersic index, effective surface brightness, and effective radius. We then train a normalizing-flow-based neural posterior estimator using the sbi package to infer these parameters from the simulated images. For isolated simulated galaxies, the SBI posterior recovers the true input parameters, produces posterior predictive residuals consistent with the assumed noise model, and shows good empirical calibration in a DES-motivated test regime. We also compare SBI with PyImfit-based MCMC inference and find broadly comparable posterior constraints, while SBI enables substantially faster posterior sampling after training. Finally, we test robustness to compact background contaminants. A model trained only on isolated galaxies produces undercovered posteriors on contaminated images, whereas training on simulations with variable contaminant positions and fluxes improves calibration across contaminated test sets. These results demonstrate the promise of SBI for scalable, uncertainty-aware LSBG morphology inference, while emphasizing that posterior reliability strongly depends on whether training simulations include relevant observational complications.

Batbayar, Bilguun [U. Chicago (main)]↗

Optimizing High-Throughput Inference on Graph Neural Networks at Shared Computing Facilities with the NVIDIA Triton Inference Server

Abstract With machine learning applications now spanning a variety of computational tasks, multi-user shared computing facilities are devoting a rapidly increasing proportion of their resources to such algorithms. Graph neural networks (GNNs), for example, have provided astounding improvements in extracting complex signatures from data and are now widely used in a variety of applications, such as particle jet classification in high energy physics (HEP). However, GNNs also come with an enormous computational penalty that requires the use of GPUs to maintain reasonable throughput. At shared computing facilities, such as those used by physicists at Fermi National Accelerator Laboratory (Fermilab), methodical resource allocation and high throughput at the many-user scale are key to ensuring that resources are being used as efficiently as possible. These facilities, however, primarily provide CPU-only nodes, which proves detrimental to time-to-insight and computational throughput for workflows that include machine learning inference. In this work, we describe how a shared computing facility can use the NVIDIA Triton Inference Server to optimize its resource allocation and computing structure, recovering high throughput while scaling out to multiple users by massively parallelizing their machine learning inference. To demonstrate the effectiveness of this system in a realistic multi-user environment, we use the Fermilab Elastic Analysis Facility augmented with the Triton Inference Server to provide scalable and high-throughput access to a HEP-specific GNN and report on the outcome.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

LLM-Inference-Bench: Inference Benchmarking of Large Language Models on AI Accelerators

Large Language Models (LLMs) have propelled groundbreaking advancements across several domains and are commonly used for text generation applications. However, the computational demands of these complex models pose significant challenges, requiring efficient hardware acceleration. Benchmarking the performance of LLMs across diverse hardware platforms is crucial to understanding their scalability and throughput characteristics. We introduce LLM-Inference-Bench, a comprehensive benchmarking suite to evaluate the hardware inference performance of LLMs. We thoroughly analyze diverse hardware platforms, including GPUs from Nvidia and AMD and specialized AI accelerators, Intel Habana and SambaNova. Our evaluation includes several LLM inference frameworks and models from LLaMA, Mistral, and Qwen families with 7B and 70B parameters. Our benchmarking results reveal the strengths and limitations of various models, hardware platforms, and inference frameworks. We provide an interactive dashboard to help identify configurations for optimal performance for a given hardware platform.

Chitty-Venkata, Krishna Teja↗

Fast and Flexible Inference Framework for Continuum Reverberation Mapping Using Simulation-based Inference with Deep Learning

Continuum reverberation mapping (CRM) of active galactic nuclei (AGN) monitors multiwavelength variability signatures to constrain accretion disk structure and supermassive black hole (SMBH) properties. The upcoming Vera Rubin Observatory’s Legacy Survey of Space and Time will survey tens of millions of AGN over the next decade, with thousands of AGN monitored with almost daily cadence in the deep drilling fields. However, existing CRM methodologies often require long computation time and are not designed to handle such large amounts of data. In this paper, we present a fast and flexible inference framework for CRM using simulation-based inference (SBI) with deep learning to estimate SMBH properties from AGN light curves. We use a long short-term memory summary network to reduce the high dimensionality of the light curve data and then use a neural density estimator to estimate the posterior of SMBH parameters. Using simulated light curves, we find SBI can produce more accurate SMBH parameter estimation with 10 3 –10 5 times speed up in inference efficiency compared to traditional methods. The SBI framework is particularly suitable for wide-field CRM surveys as the light curves will have identical observing patterns, which can be incorporated into the SBI simulation. We explore the performance of our SBI model on light curves with irregular-sampled, realistic observing cadence and alternative variability characteristics to demonstrate the flexibility and limitation of the SBI framework.

79 ASTRONOMY AND ASTROPHYSICS↗

Dark Energy Survey Year 3 results: Simulation-based cosmological inference with wavelet harmonics, scattering transforms, and moments of weak lensing mass maps. Validation on simulations

Beyond-two-point statistics contain additional information on cosmological as well as astrophysical and observational (systematics) parameters. In this methodology paper we provide an end-to-end simulationbased analysis of a set of Gaussian and non-Gaussian weak lensing statistics using detailed mock catalogs of the Dark Energy Survey (DES). Here, we implement: 1) second and third moments; 2) wavelet phase harmonics (WPH); 3) the scattering transform (ST). Our analysis is fully based on simulations, it spans a space of seven $νw$CDM cosmological parameters, and it forward models the most relevant sources of systematics of the data (masks, noise variations, clustering of the sources, intrinsic alignments, and shear and redshift calibration). We implement a neural network compression of the summary statistics, and we estimate the parameter posteriors using a likelihood-free-inference approach. We validate the pipeline extensively, and we find that WPH exhibits the strongest performance when combined with second moments, followed by ST, and then by third moments. The combination of all the different statistics further enhances constraints with respect to second moments, up to 25 percent, 15 percent, and 90 percent for S 8 , Ω m , and the figure-of-merit FoM S8;Ωm , respectively. We further find that non-Gaussian statistics improve constraints on w and on the amplitude of intrinsic alignment with respect to second moments constraints. The methodological advances presented here are suitable for application to Stage IV surveys from Euclid, Rubin-LSST, and Roman with additional validation on mock catalogs for each survey. In a companion paper we present an application to DES Year 3 data.

79 ASTRONOMY AND ASTROPHYSICS↗

Dark Energy Survey Year 3 results: Simulation-based cosmological inference with wavelet harmonics, scattering transforms, and moments of weak lensing mass maps. II. cosmological results

Here, we present a simulation-based cosmological analysis using a combination of Gaussian and non-Gaussian statistics of the weak lensing mass (convergence) maps from the first three years of the Dark Energy Survey. We implement the following: (1) second and third moments; (2) wavelet phase harmonics; (3) the scattering transform. Our analysis is fully based on simulations, spans a space of seven 𝑤 Cold Dark Matter (𝑤⁢ CDM) cosmological parameters, and forward models the most relevant sources of systematics inherent in the data: masks, noise variations, clustering of the sources, intrinsic alignments, and shear and redshift calibration. We implement a neural network compression of the summary statistics, and we estimate the parameter posteriors using a simulation-based inference approach. Including and combining different non-Gaussian statistics is a powerful tool that strongly improves constraints over Gaussian statistics (in our case, the second moments); in particular, the figure of merit (𝑆 8 , Ω m ) is improved by 70% (Λ ⁢CDM) and 90% (𝑤 ⁢CDM). When all the summary statistics are combined, we achieve a 2% constraint on the amplitude of fluctuations parameter 𝑆 8 ≡ 𝜎 8 ⁢(Ω m /0.3) 0.5 , obtaining 𝑆 8 = 0.794 ±0.017 (Λ⁢ CDM) and 𝑆 8 = 0.817 ±0.021 (𝑤 ⁢CDM), and a ∼10% constraint on Ω m , obtaining Ω m =0.259 ±0.025 (Λ ⁢CDM) and Ω m = 0.273 ±0.029 (𝑤⁢ CDM). In the context of the 𝑤⁢ CDM scenario, these statistics also strengthen the constraints on the parameter 𝑤, obtaining 𝑤 <−0.72. The constraints from different statistics are shown to be internally consistent (with a 𝑝-value>0.1 for all combinations of statistics examined). We compare our results to other weak lensing results from the first three years of the Dark Energy Survey data, finding good consistency; we also compare with results from external datasets, such as planck constraints from the cosmic microwave background, finding statistical agreement, with discrepancies no greater than <2.2⁢𝜎.

79 ASTRONOMY AND ASTROPHYSICS↗

Inferring pesticide toxicity to honey bees from a field‐based feeding study using a colony model and Bayesian inference

Abstract Honey bees are crucial pollinators for agricultural crops but are threatened by a multitude of stressors including exposure to pesticides. Linking our understanding of how pesticides affect individual bees to colony‐level responses is challenging because colonies show emergent properties based on complex internal processes and interactions among individual bees. Agent‐based models that simulate honey bee colony dynamics may be a tool for scaling between individual and colony effects of a pesticide. The U.S. Environmental Protection Agency (USEPA) and U.S. Department of Agriculture (USDA) are developing the VarroaPop + Pesticide model, which simulates the dynamics of honey bee colonies and how they respond to multiple stressors, including weather, Varroa mites, and pesticides. To evaluate this model, we used Approximate Bayesian Computation to fit field data from an empirical study where honey bee colonies were fed the insecticide clothianidin. This allowed us to reproduce colony feeding study data by simulating colony demography and mortality from ingestion of contaminated food. We found that VarroaPop + Pesticide was able to fit general trends in colony population size and structure and reproduce colony declines from increasing clothianidin exposure. The model underestimated adverse effects at low exposure (36 µg/kg), however, and overestimated recovery at the highest exposure level (140 µg/kg), for the adult and pupa endpoints, suggesting that mechanisms besides oral toxicity‐induced mortality may have played a role in colony declines. The VarroaPop + Pesticide model estimates an adult oral LD 50 of 18.9 ng/bee (95% CI 10.1–32.6) based on the simulated feeding study data, which falls just above the 95% confidence intervals of values observed in laboratory toxicology studies on individual bees. Overall, our results demonstrate a novel method for analyzing colony‐level data on pesticide effects on bees and making inferences on pesticide toxicity to individual bees.

59 BASIC BIOLOGICAL SCIENCES↗

Inferring the Energetics of CO 2 –Aniline Adduct Formation from Vibrational Spectroscopy

Control of atmospheric CO 2 is an important contemporary scientific and engineering challenge. Towards this goal, the reaction of CO 2 with amines to form carbamate bonds is an established method for CO 2 capture. However, controllable reversal of this reaction remains difficult and requires tuning the energetics of the carbamate bond. Through IR spectroscopy, we show that a characteristic frequency observed upon carbamate formation varies as a function of the substituent’s Hammett parameter for a family of para- substituted anilines. We present computational evidence that the vibrational frequency of the adducted CO 2 serves as a predictor of the energy of formation of the carbamate. Electron donating groups typically enhance the driving force of carbamate formation by transferring more charge to the adducted CO 2 and thus increasing the occupancy of the anti-bonding orbital in the carbon-oxygen bonds. Increased occupancy of the anti-bonding orbital within adducted CO 2 indicates a weaker bond, leading to a red shift in the characteristic carbamate frequency. As a result, our work serves the large field of CO 2 capture research where spectroscopic observables, such as IR frequencies, are more easily obtainable and can stand in as a descriptor of driving forces.

Amines↗

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

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

79 ASTRONOMY AND ASTROPHYSICS↗

Identifying strengths and weaknesses of methods for computational network inference from single-cell RNA-seq data

Single-cell RNA-sequencing (scRNA-seq) offers unparalleled insight into the transcriptional programs of different cellular states by measuring the transcriptome of thousands of individual cells. An emerging problem in the analysis of scRNA-seq is the inference of transcriptional gene regulatory networks and a number of methods with different learning frameworks have been developed to address this problem. Here, we present an expanded benchmarking study of eleven recent network inference methods on seven published scRNA-seq datasets in human, mouse, and yeast considering different types of gold standard networks and evaluation metrics. We evaluate methods based on their computing requirements as well as on their ability to recover the network structure. We find that, while most methods have a modest recovery of experimentally derived interactions based on global metrics such as Area Under the Precision Recall curve, methods are able to capture targets of regulators that are relevant to the system under study. Among the top performing methods that use only expression were SCENIC, PIDC, MERLIN or Correlation. Addition of prior biological knowledge and the estimation of transcription factor activities resulted in the best overall performance with the Inferelator and MERLIN methods that use prior knowledge outperforming methods that use expression alone. We found that imputation for network inference did not improve network inference accuracy and could be detrimental. Comparisons of inferred networks for comparable bulk conditions showed that the networks inferred from scRNA-seq datasets are often better or at par with the networks inferred from bulk datasets. Our analysis should be beneficial in selecting methods for network inference. At the same time, this highlights the need for improved methods and better gold standards for regulatory network inference from scRNAseq datasets.

59 BASIC BIOLOGICAL SCIENCES↗

Application of AI techniques to infer vegetation characteristics from directional reflectance(s)

Traditionally, the remote sensing community has relied totally on spectral knowledge to extract vegetation characteristics. However, there are other knowledge bases (KB's) that can be used to significantly improve the accuracy and robustness of inference techniques. Using AI (artificial intelligence) techniques a KB system (VEG) was developed that integrates input spectral measurements with diverse KB's. These KB's consist of data sets of directional reflectance measurements, knowledge from literature, and knowledge from experts which are combined into an intelligent and efficient system for making vegetation inferences. VEG accepts spectral data of an unknown target as input, determines the best techniques for inferring the desired vegetation characteristic(s), applies the techniques to the target data, and provides a rigorous estimate of the accuracy of the inference. VEG was developed to: infer spectral hemispherical reflectance from any combination of nadir and/or off-nadir view angles; infer percent ground cover from any combination of nadir and/or off-nadir view angles; infer unknown view angle(s) from known view angle(s) (known as view angle extension); and discriminate between user defined vegetation classes using spectral and directional reflectance relationships developed from an automated learning algorithm. The errors for these techniques were generally very good ranging between 2 to 15% (proportional root mean square). The system is designed to aid scientists in developing, testing, and applying new inference techniques using directional reflectance data.

Kimes, D. S.↗

Intelligent machines in the twenty-first century: foundations of inference and inquiry

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Review↗

Robust inference of ecosystem soil water stress from eddy covariance data

Eddy covariance data are invaluable for determining ecosystem water use strategies under soil water stress. However, existing stress inference methods require numerous subjective data processing and model specification assumptions whose effect on the inferred soil water stress signal is rarely quantified. These uncertainties may confound the stress inference and the generalization of ecosystem water use strategies across multiple sites and studies. In this research, we quantify the sensitivity of soil water stress signals inferred from eddy covariance data to the prevailing data and modeling assumptions (i.e., their robustness) to compile a comprehensive list of sites with robust soil water stress signals and assess the performance of current stress inference methods. To accomplish this, we identify the most prevalent assumptions from the literature and perform a digital factorial experiment to extract probability distributions of plausible soil water stress signals and model performance at 151 FLUXNET2015 and AmeriFlux-FLUXNET sites. Here, we develop a new framework that summarizes these probability distributions to classify and rank the robustness of each site’s soil water stress signal, which we display with a user-friendly heat map. We estimate that only 5%–36% of sites exhibit a robust soil water stress signal due to deficient model performance and poorly constrained ecosystem water use parameters. We also find that the lack of robustness is site-specific, which undermines grouping stress signals by broad ecosystem categories or comparing results across studies with differing assumptions. Lastly, existing stress inference methods appear better suited for eddy covariance sites with grass/annual vegetation. Our findings call for more careful and consistent inference of ecosystem water stress from eddy covariance data.

54 ENVIRONMENTAL SCIENCES↗