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

Learning Nonlinear Reduced Models from Data with Operator Inference

This review discusses Operator Inference, a nonintrusive reduced modeling approach that incorporates physical governing equations by defining a structured polynomial form for the reduced model, and then learns the corresponding reduced operators from simulated training data. The polynomial model form of Operator Inference is sufficiently expressive to cover a wide range of nonlinear dynamics found in fluid mechanics and other fields of science and engineering, while still providing efficient reduced model computations. The learning steps of Operator Inference are rooted in classical projection-based model reduction; thus, some of the rich theory of model reduction can be applied to models learned with Operator Inference. This connection to projection-based model reduction theory offers a pathway toward deriving error estimates and gaining insights to improve predictions. Furthermore, through formulations of Operator Inference that preserve Hamiltonian and other structures, important physical properties such as energy conservation can be guaranteed in the predictions of the reduced model beyond the training horizon. This review illustrates key computational steps of Operator Inference through a large-scale combustion example.

Mechanics↗

Identifying ecological and evolutionary research targets and risks in climate change studies to break barriers to broad inference

Understanding the responses of plants, microbes, and their interactions to long-term climate change is essential to identifying the traits, genes, and functions of organisms that maintain ecosystem stability and function of the biosphere. However, many studies investigating organismal responses to climate change are limited in their scope along several key ecological, evolutionary, and environmental axes, creating barriers to broader inference. Broad inference, or the ability to apply and validate findings across these axes, is a vital component of achieving climate preparedness in the future. Breaking barriers to broad inference requires accurate cross-ecosystem interpretability and the identification of reliable frameworks for how these responses will manifest. Current approaches have generated a valuable, yet sometimes contradictory or context dependent, understanding of responses to climate change factors from the organismal- to ecosystem-level. In this synthesis, we use plants, soil microbial communities, and their interactions as examples to identify five major barriers to broad inference and resultant target research areas. We also explain risks associated with disregarding these barriers to broad inference and potential approaches to overcoming them. Developing and funding experimental frameworks that integrate basic ecological and evolutionary principles and are designed to capture broad inference across levels of organization is necessary to further our understanding of climate change on large scales.

Love, Sarah J. (ORCID:0000000180787373)↗

Semi-Analytical Hierarchical Bayesian Inference of Nonlinear Model Structure in Stochastic Dynamics: Applied to Compartmental Models of Infectious Diseases

A Bayesian computational framework for parsimonious inference in stochastic nonlinear dynamical systems is presented. This framework enables the concurrent estimation of system states, time-varying parameters, time-invariant parameters, and the optimal sparsity structure of the model parameters. Because differential equation-based models are often simplified mechanistic or phenomenological representations, robust inference from noisy measurement data requires explicit treatment of model error and uncertainty. Model error and time-varying parameters can be represented as random processes, enabling inference while making minimal assumptions about the underlying sources of discrepancy and variability. Adopting stochastic differential equation representations affords the model significant flexibility, but can also render it susceptible to overfitting during statistical inversion, where the inferred model may track noise rather than the underlying signal. To alleviate the effects of overfitting and to enable the discovery of the optimal sparse representation of the time-invariant parameters, a Bayesian sparse learning algorithm is embedded within the framework. This sparse learning framework adopts an approximate hierarchical Bayesian setting defined by a series of semi-analytical expressions. The model structure inference framework is validated using a stochastic compartmental model for tracking and forecasting active cases of an infectious disease. Compartmental models describe population-level infectious disease dynamics through interactions among population fractions grouped by disease state. Mathematically, such models consist of a system of coupled ordinary differential equations. This example adopts an expressive compartmental model that includes multiple possible interactions between disease states, motivated by early uncertainty surrounding COVID-19 reinfection dynamics and their implications for long-term epidemic forecasting. The sparse learning exercise permits the inference of a priori unknown epidemiological dynamics from simulated public health data, discovering the nested compartmental model that optimizes the trade-off between average data-fit and model complexity. It is shown that inducing sparsity among the model parameters eliminates redundant interactions between compartments, equivalently revealing the optimal coupling structure between differential equations.

97 MATHEMATICS AND COMPUTING↗

Population-level Dark Energy Constraints from Strong Gravitational Lensing using Simulation-Based Inference

In this work, we present a scalable approach for inferring the dark energy equation-of-state parameter ($w$) from a population of strong gravitational lens images using Simulation-Based Inference (SBI). Strong gravitational lensing offers crucial insights into cosmology, but traditional Monte Carlo methods for cosmological inference are computationally prohibitive and inadequate for processing the thousands of lenses anticipated from future cosmic surveys. New tools for inference, such as SBI using Neural Ratio Estimation (NRE), address this challenge effectively. By training a machine learning model on simulated data of strong lenses, we can learn the likelihood-to-evidence ratio for robust inference. Our scalable approach enables more constrained population-level inference of $w$ compared to individual lens analysis, constraining $w$ to within $1\sigma$.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Block-Structured Operator Inference for Coupled Multiphysics Model Reduction

This work presents a block-structured formulation of Operator Inference as a way to learn structured reduced-order models for multiphysics systems. The approach specifies the governing equation structure for each physics component and the structure of the coupling terms. Once the multiphysics structure is specified, the reduced-order model is learned from snapshot data following the nonintrusive Operator Inference methodology. In addition to preserving physical system structure, which in turn permits preservation of system properties such as stability and second-order structure, the block-structured approach has the advantages of reducing the overall dimensionality of the learning problem and admitting tailored regularization for each physics component. The numerical advantages of the block-structured formulation over a monolithic Operator Inference formulation are demonstrated for aeroelastic analysis, which couples aerodynamic and structural models. For the benchmark test case of the AGARD 445.6 wing, block-structured Operator Inference provides an average 20% online prediction speedup over monolithic Operator Inference across subsonic and supersonic flow conditions in both the stable and fluttering parameter regimes while preserving the accuracy achieved with monolithic Operator Inference.

42 ENGINEERING↗

A second order yield-temperature relation for accurate inference of burn-averaged quantities in multi-species plasmas

Measured yields and ion temperatures inferred from the fusion product energy spectra can be used as metrics for the performance of an ICF implosion. This can be to infer species separation, thermal decoupling, flows or other effects that can cause the inferred ion temperatures to deviate from the true underlying thermal temperature and the yield ratio to deviate from the expected value. Direct inference of the impact of these effects on observed temperatures and yields can be difficult to uncover due to underlying dependence on the shape and time evolution of the temperature and density proles of the fusing plasma. Due to differences in the temperature dependence of the reactivities, different fusion products are emitted from different regions and times within the implosion. In order to properly account for this, a second order analytic expression relating the apparent temperatures and yield ratios is developed. This expression can be coupled to models of yield and/or temperature altering effects to infer their burn-averaged impact on an implosion. The second order expression shows significant improvement over lower order expressions in synthetic data studies. Demonstrations of its applications to synthetic data coupled with models of ion thermal decoupling and radial flows are presented. In the case of thermal decoupling both first and second order expressions show reasonable levels of accuracy. To consistently infer the amplitude of radial flow with <10% error the second order equation is required.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Algorithm Optimally Orders Forward-Chaining Inference Rules

People typically develop knowledge bases in a somewhat ad hoc manner by incrementally adding rules with no specific organization. This often results in a very inefficient execution of those rules since they are so often order sensitive. This is relevant to tasks like Deep Space Network in that it allows the knowledge base to be incrementally developed and have it automatically ordered for efficiency. Although data flow analysis was first developed for use in compilers for producing optimal code sequences, its usefulness is now recognized in many software systems including knowledge-based systems. However, this approach for exhaustively computing data-flow information cannot directly be applied to inference systems because of the ubiquitous execution of the rules. An algorithm is presented that efficiently performs a complete producer/consumer analysis for each antecedent and consequence clause in a knowledge base to optimally order the rules to minimize inference cycles. An algorithm was developed that optimally orders a knowledge base composed of forwarding chaining inference rules such that independent inference cycle executions are minimized, thus, resulting in significantly faster execution. This algorithm was integrated into the JPL tool Spacecraft Health Inference Engine (SHINE) for verification and it resulted in a significant reduction in inference cycles for what was previously considered an ordered knowledge base. For a knowledge base that is completely unordered, then the improvement is much greater.

James, Mark↗

Data-free inference of the joint distribution of uncertain model parameters.

It is known that, in general, the correlation structure in the joint distribution of model parameters is critical to the uncertainty analysis of that model. Very often, however, studies in the literature only report nominal values for parameters inferred from data, along with confidence intervals for these parameters, but no details on the correlation or full joint distribution of these parameters. When neither posterior nor data are available, but only summary statistics such as nominal values and confidence intervals, a joint PDF must be chosen. Given the summary statistics it may not be reasonable nor necessary to assume the parameters are independent random variables. We demonstrate, using a Bayesian inference procedure, how to construct a posterior density for the parameters exhibiting self consistent correlations, in the absence of data, given (1) the fit-model, (2) nominal parameter values, (3) bounds on the parameters, and (4) a postulated statistical model, around the fit-model, for the missing data. Our approach ensures external Bayesian updating while marginalizing over possible data realizations. We then address the matching of given parameter bounds through the choice of hyperparameters, which are introduced in postulating the statistical model, but are not given nominal values. We discuss some possible approaches, including (1) inferring them in a separate Bayesian inference loop and (2) optimization. We also perform an empirical evaluation of the algorithm showing the posterior obtained with this data free inference compares well with the true posterior obtained from inference against the full data set.

99 GENERAL AND MISCELLANEOUS↗

Data-free inference of uncertain model parameters.

It is known that, in general, the correlation structure in the joint distribution of model parameters is critical to the uncertainty analysis of that model. Very often, however, studies in the literature only report nominal values for parameters inferred from data, along with confidence intervals for these parameters, but no details on the correlation or full joint distribution of these parameters. When neither posterior nor data are available, but only summary statistics such as nominal values and confidence intervals, a joint PDF must be chosen. Given the summary statistics it may not be reasonable nor necessary to assume the parameters are independent random variables. We demonstrate, using a Bayesian inference procedure, how to construct a posterior density for the parameters exhibiting self consistent correlations, in the absence of data, given (1) the fit-model, (2) nominal parameter values, (3) bounds on the parameters, and (4) a postulated statistical model, around the fit-model, for the missing data. Our approach ensures external Bayesian updating while marginalizing over possible data realizations. We then address the matching of given parameter bounds through the choice of hyperparameters, which are introduced in postulating the statistical model, but are not given nominal values. We discuss some possible approaches, including (1) inferring them in a separate Bayesian inference loop and (2) optimization. We also perform an empirical evaluation of the algorithm showing the posterior obtained with this data free inference compares well with the true posterior obtained from inference against the full data set.

99 GENERAL AND MISCELLANEOUS↗

Population-level Dark Energy Constraints from Strong Gravitational Lensing using Simulation-Based Inference

In this work, we present a scalable approach for inferring the dark energy equation-of-state parameter ($w$) from a population of strong gravitational lens images using Simulation-Based Inference (SBI). Strong gravitational lensing offers crucial insights into cosmology, but traditional Monte Carlo methods for cosmological inference are computationally prohibitive and inadequate for processing the thousands of lenses anticipated from future cosmic surveys. New tools for inference, such as SBI using Neural Ratio Estimation (NRE), address this challenge effectively. By training a machine learning model on simulated data of strong lenses, we can learn the likelihood-to-evidence ratio for robust inference. Our scalable approach enables more constrained population-level inference of $w$ compared to individual lens analysis, constraining $w$ to within $1\sigma$. Our model can be used to provide cosmological constraints from forthcoming strong lens surveys, such as the 4MOST Strong Lensing Spectroscopic Legacy Survey (4SLSLS), which is expected to observe 10,000 strong lenses.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Population-level Dark Energy Constraints from Strong Gravitational Lensing using Simulation-Based Inference

In this work, we present a scalable approach for inferring the dark energy equation-of-state parameter ($w$) from a population of strong gravitational lens images using Simulation-Based Inference (SBI). Strong gravitational lensing offers crucial insights into cosmology, but traditional Monte Carlo methods for cosmological inference are computationally prohibitive and inadequate for processing the thousands of lenses anticipated from future cosmic surveys. New tools for inference, such as SBI using Neural Ratio Estimation (NRE), address this challenge effectively. By training a machine learning model on simulated data of strong lenses, we can learn the likelihood-to-evidence ratio for robust inference. Our scalable approach enables more constrained population-level inference of $w$ compared to individual lens analysis, constraining $w$ to within 1$\sigma$. Our model can be used to provide cosmological constraints from forthcoming strong lens surveys, such as the 4MOST Strong Lensing Spectroscopic Legacy Survey (4SLSLS), which is expected to observe 10,000 strong lenses.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Data-driven operator inference for nonintrusive projection-based model reduction

We presenta a nonintrusive projection-based model reduction method for full models based on time-dependent partial differential equations. Projection-based model reduction constructs the operators of a reduced model by projecting the equations of the full model onto a reduced space. Traditionally, this projection is intrusive, which means that the full-model operators are required either explicitly in an assembled form or implicitly through a routine that returns the action of the operators on a given vector; however, in many situations the full model is given as a black box that computes trajectories of the full-model states and outputs for given initial conditions and inputs, but does not provide the full-model operators. Our nonintrusive operator inference approach infers approximations of the reduced operators from the initial conditions, inputs, trajectories of the states, and outputs of the full model, without requiring the full-model operators. Our operator inference is applicable to full models that are linear in the state or have a low-order polynomial nonlinear term. The inferred operators are the solution of a least-squares problem and converge, with sufficient state trajectory data, in the Frobenius norm to the reduced operators that would be obtained via an intrusive projection of the full-model operators. Our numerical results reflect operator inference on a linear climate model and on a tubular reactor model with a polynomial nonlinear term of third order.

42 ENGINEERING↗

Bayesian inference of heterogeneous epidemic models: Application to COVID-19 spread accounting for long-term care facilities

Here we propose a high dimensional Bayesian inference framework for learning heterogeneous dynamics of a COVID-19 model, with a specific application to the dynamics and severity of COVID-19 inside and outside long-term care (LTC) facilities. We develop a heterogeneous compartmental model that accounts for the heterogeneity of the time-varying spread and severity of COVID-19 inside and outside LTC facilities, which is characterized by time-dependent stochastic processes and time-independent parameters in ~ 1500 dimensions after discretization. To infer these parameters, we use reported data on the number of confirmed, hospitalized, and deceased cases with suitable post-processing in both a deterministic inversion approach with appropriate regularization as a first step, followed by Bayesian inversion with proper prior distributions. To address the curse of dimensionality and the ill-posedness of the high-dimensional inference problem, we propose use of a dimension-independent projected Stein variational gradient descent method, and demonstrate the intrinsic low-dimensionality of the inverse problem. We present inference results with quantified uncertainties for both New Jersey and Texas, which experienced different epidemic phases and patterns. Moreover, we also present forecasting and validation results based on the empirical posterior samples of our inference for the future trajectory of COVID-19.

42 ENGINEERING↗

Robust scalable initialization for Bayesian variational inference with multi-modal Laplace approximations

Predictive modeling typically relies on Bayesian model calibration to provide uncertainty quantification. Variational inference utilizing fully independent (“mean-field”) Gaussian distributions are often used as approximate probability density functions. This simplification is attractive since the number of variational parameters grows only linearly with the number of unknown model parameters. However, the resulting diagonal covariance structure and unimodal behavior can be too restrictive to provide useful approximations of intractable Bayesian posteriors that exhibit highly non-Gaussian behavior, including multimodality. High-fidelity surrogate posteriors for these problems can be obtained by considering the family of Gaussian mixtures. Gaussian mixtures are capable of capturing multiple modes and approximating any distribution to an arbitrary degree of accuracy, while maintaining some analytical tractability. Unfortunately, variational inference using Gaussian mixtures with full-covariance structures suffers from a quadratic growth in variational parameters with the number of model parameters. The existence of multiple local minima due to strong nonconvex trends in the loss functions often associated with variational inference present additional complications, These challenges motivate the need for robust initialization procedures to improve the performance and computational scalability of variational inference with mixture models. In this work, we propose a method for constructing an initial Gaussian mixture model approximation that can be used to warm-start the iterative solvers for variational inference. The procedure begins with a global optimization stage in model parameter space. In this step, local gradient-based optimization, globalized through multistart, is used to determine a set of local maxima, which we take to approximate the mixture component centers. Around each mode, a local Gaussian approximation is constructed via the Laplace approximation. Finally, the mixture weights are determined through constrained least squares regression. The robustness and scalability of the proposed methodology is demonstrated through application to an ensemble of synthetic tests using high-dimensional, multimodal probability density functions. Here, the practical aspects of the approach are demonstrated with inversion problems in structural dynamics.

97 MATHEMATICS AND COMPUTING↗

Optimizing inference of segmentation on high-resolution images in MLExchange

MLExchange is a machine learning (ML) operations platform providing web user-interfaces (UIs) for data visualization and analysis pipelines at synchrotron facilities. Among these UIs is the segmentation app which helps synchrotron users utilize ML algorithms to automatically segment high-resolution scientific images with minimal manual annotation effort. In this work, we share code optimizations that significantly speed up the segmentation inference workflow of large data in short time. By optimizing the sequence of CPU-GPU data transfers and introducing CPU parallelization to key operations, we improve the per-device, per-image frame computational efficiency and observe close to 3×$$\times$$ speedup over the original segmentation inference workflow run time when utilizing a single GPU. Further adaptations enabling multi-GPU inference yield more than 40×$$\times$$ speedup with 100 GPUs compared to the optimized single GPU inference workflow. This acceleration of the segmentation inference workflow will provide MLExchange users with easy access to segmentation results with little wait time.

Lu, Shizhao↗

FPGA-Accelerated Machine Learning Inference as a Service for Particle Physics Computing

Large-scale particle physics experiments face challenging demands for high-throughput computing resources both now and in the future. New heterogeneous computing paradigms on dedicated hardware with increased parallelization, such as Field Programmable Gate Arrays (FPGAs), offer exciting solutions with large potential gains. The growing applications of machine learning algorithms in particle physics for simulation, reconstruction, and analysis are naturally deployed on such platforms. We demonstrate that the acceleration of machine learning inference as a web service represents a heterogeneous computing solution for particle physics experiments that potentially requires minimal modification to the current computing model. As examples, we retrain the ResNet-50 convolutional neural network to demonstrate state-of-the-art performance for top quark jet tagging at the LHC and apply a ResNet-50 model with transfer learning for neutrino event classification. Using Project Brainwave by Microsoft to accelerate the ResNet-50 image classification model, we achieve average inference times of 60 (10) ms with our experimental physics software framework using Brainwave as a cloud (edge or on-premises) service, representing an improvement by a factor of approximately 30 (175) in model inference latency over traditional CPU inference in current experimental hardware. A single FPGA service accessed by many CPUs achieves a throughput of 600–700 inferences per second using an image batch of one, comparable to large batch-size GPU throughput and significantly better than small batch-size GPU throughput. Deployed as an edge or cloud service for the particle physics computing model, coprocessor accelerators can have a higher duty cycle and are potentially much more cost-effective.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Logical inference derivation of the quantum theoretical description of Stern–Gerlach and Einstein–Podolsky–Rosen–Bohm experiments

Highlights: •Logical inference connects data and their description in terms of concepts. •It is used to derive the description of Stern–Gerlach experiments. •Logical inference yields the description of Einstein–Podolsky–Rosen–Bohm experiments. •These logical inference derivations do not rely on concepts of quantum theory. -- Abstract: It is shown that the quantum-theoretical descriptions of idealized Stern–Gerlach and Einstein–Podolsky–Rosen–Bohm experiments result from a logical inference treatment of robust experiments, without relying on concepts of quantum theory. For concreteness, the derivation is given for the case that the Stern–Gerlach magnet deflects the beam in three different directions, which in quantum theory corresponds to a description in terms of spin-1 particles. The logical inference description of the Einstein–Podolsky–Rosen–Bohm experiment is shown to contain the quantum theoretical description as a particular case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An investigation of irreproducibility in maximum likelihood phylogenetic inference

Phylogenetic trees are essential for studying biology, but their reproducibility under identical parameter settings remains unexplored. Here, we find that 3515 (18.11%) IQ-TREE-inferred and 1813 (9.34%) RAxML-NG-inferred maximum likelihood (ML) gene trees are topologically irreproducible when executing two replicates (Run1 and Run2) for each of 19,414 gene alignments in 15 animal, plant, and fungal phylogenomic datasets. Notably, coalescent-based ASTRAL species phylogenies inferred from Run1 and Run2 sets of individual gene trees are topologically irreproducible for 9/15 phylogenomic datasets, whereas concatenation-based phylogenies inferred twice from the same supermatrix are reproducible. Our simulations further show that irreproducible phylogenies are more likely to be incorrect than reproducible phylogenies. These results suggest that a considerable fraction of single-gene ML trees may be irreproducible. Increasing reproducibility in ML inference will benefit from providing analyses’ log files, which contain typically reported parameters (e.g., program, substitution model, number of tree searches) but also typically unreported ones (e.g., random starting seed number, number of threads, processor type).

59 BASIC BIOLOGICAL SCIENCES↗