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 577 records · Page 32

Anomalous cross-field transport in a Hall thruster inferred from direct measurement of instability growth rates

The contribution of the electron drift instability to anomalous electron transport is experimentally assessed in a Hall effect discharge. The transport is represented by an anomalous collision frequency, which is related through quasilinear theory to the energy and growth rate of the instability. The wave energy is measured directly with ion saturation probes, while estimates of the growth rate are employed based on both linearized theory and direct measurement. The latter measurement is performed with a bispectral analysis method. The wave-driven collision frequency is compared to measurements of the actual collision frequency inferred from a method based on laser- induced fluorescence. It is found that estimates for transport using linearized theory for the growth differ by over an order of magnitude from the actual anomalous collision frequency in the plasma. The wave-driven anomalous collision frequency with measured growth, however, is shown to agree with the electron collision frequency in magnitude and capture aspects of the trends in spatial variation. This result demonstrates experimentally that wave-driven effects ultimately can explain the observed cross-field transport in these devices. As a result, the implications of this finding are discussed in the context of the key lengthscales that drive the transport as well as the implications identifying reduced fidelity models that could be used to predict anomalous collision frequency.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Experimentally Inferred Fusion Yield Dependencies of OMEGA Inertial Confinement Fusion Implosions

Statistical modeling of experimental and simulation databases has enabled the development of an accurate predictive capability for deuterium-tritium layered cryogenic implosions at the OMEGA laser. Here, a physics-based statistical mapping framework is described and used to uncover the dependencies of the fusion yield. This model is used to identify and quantify the degradation mechanisms of the fusion yield in direct-drive implosions on OMEGA. The yield is found to be reduced by the ratio of laser beam to target radius, the asymmetry in inferred ion temperatures from the $l$ = 1 mode, the time span over which tritium fuel has decayed, and parameters related to the implosion hydrodynamic stability. When adjusted for tritium decay and $l$ = 1 mode, the highest yield in OMEGA cryogenic implosions is predicted to exceed 2 × 10 14 fusion reactions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Inference of the Mass Composition of Cosmic Rays with Energies from 10 18.5 to 10 20 eV Using the Pierre Auger Observatory and Deep Learning

We present measurements of the atmospheric depth of the shower maximum X max , inferred for the first time on an event-by-event level using the surface detector of the Pierre Auger Observatory. Using deep learning, we were able to extend measurements of the X max distributions up to energies of 100 EeV ( 10 20 eV ), not yet revealed by current measurements, providing new insights into the mass composition of cosmic rays at extreme energies. Gaining a 10-fold increase in statistics compared to the fluorescence detector data, we find evidence that the rate of change of the average X max with the logarithm of energy features three breaks at 6.5 ± 0.6 ( stat ) ± 1 ( syst ) EeV , 11 ± 2 ( stat ) ± 1 ( syst ) EeV , and 31 ± 5 ( stat ) ± 3 ( syst ) EeV , in the vicinity to the three prominent features (ankle, instep, suppression) of the cosmic-ray flux. The energy evolution of the mean and standard deviation of the measured X max distributions indicates that the mass composition becomes increasingly heavier and purer, thus being incompatible with a large fraction of light nuclei between 50 and 100 EeV. Published by the American Physical Society 2025

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Hamiltonian parameter inference from resonant inelastic x-ray scattering with active learning

Identifying model Hamiltonians is a vital step toward creating predictive models of materials. Here, in this study, we combine Bayesian optimization with the EDRIXS numerical package to infer Hamiltonian parameters from resonant inelastic x-ray scattering (RIXS) spectra within the single atom approximation. To evaluate the efficacy of our method, we test it on experimental RIXS spectra of NiPS 3 , NiCl 2 , Ca 3 ⁢LiOsO 6 , and Fe 2⁢ O 3 , and demonstrate that it can reproduce results obtained from hand-fitted parameters to a precision similar to expert human analysis while providing a more systematic mapping of parameter space. Our work provides a key first step toward solving the inverse scattering problem to extract effective multi-orbital models from information-dense RIXS measurements, which can be applied to a host of quantum materials. We also propose atomic model parameter sets for two materials, Ca 3⁢ LiOsO 6 and Fe 2⁢ O 3 , that were previously missing from the literature.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimizers for stabilizing likelihood-free inference

A growing number of applications in particle physics and beyond use neural networks as unbinned likelihood ratio estimators applied to real or simulated data. Precision requirements on the inference tasks demand a high-level of stability from these networks, which are affected by the stochastic nature of training. We show how physics concepts can be used to stabilize network training through a physics-inspired optimizer. In particular, the energy conserving descent (ECD) optimization framework uses classical Hamiltonian dynamics on the space of network parameters to reduce the dependence on the initial conditions while also stabilizing the result near the minimum of the loss function. We develop a version of this optimizer known as , which has few free hyperparameters with limited ranges guided by physical reasoning. We apply to representative likelihood-ratio estimation tasks in particle physics and find on average that it out-performs the widely used Adam optimizer. We expect that ECD will be a useful tool for wide array of data-limited problems, where it is computationally expensive to exhaustively optimize hyperparameters and mitigate fluctuations with ensembling.

Monte Carlo methods↗

Correlation-aware binning for small-angle neutron scattering via Gaussian-process inference

Binning in small-angle neutron scattering (SANS) is typically performed empirically, with fixed parameters chosen for convenience rather than statistical optimality. Such practices often fail to balance statistical precision and spatial resolution, leading to inconsistencies across instruments and datasets. Here we establish a correlation-aware framework that determines the optimal bin width from first principles by extending the classical Freedman–Diaconis (FD) rule to account for inter-bin correlations with a Gaussian process. In this formulation, the scattering intensity is treated as a smooth stochastic field whose statistical coherence is described by a covariance matrix. Analytical expressions of errors derived from this model yield closed-form criteria that separate the total deviation into contributions from counting noise, aliasing distortion and curvature-dependent correlation effects. Expressed in reduced variables, the resulting dimensionless error surface reveals a continuous transition from the uncorrelated FD regime to the correlation-dominated limit, providing a unified description of noise suppression and resolution control. Because the formulation depends only on the profile characteristics of scattering intensity I(Q), specifically its average intensity and first- and second-order derivatives, it applies generally to any SANS measurement regardless of sample, instrument or geometry. Experimental validation using small- and ultra-small-angle neutron scattering data confirms the predicted scaling behavior, demonstrating that correlation-aware inference systematically reduces mean-squared error and enables information-efficient reproducible data reduction across materials and instruments.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗

Feasibility of Correlation-Aware Inference and Universal Precision Scaling in Bonse–Hart Ultra-Small-Angle Neutron Scattering

Bonse–Hart ultra-small-angle neutron scattering (USANS) provides access to micrometre-scale structure, but useful measurements often require long counting times. In this work, we test whether the expected smoothness of the scattering profile can be exploited to improve data quality at lower counting statistics. We apply a Gaussian-process-based method to Bonse–Hart USANS data and evaluate its performance on pseudo-measurements generated from high-statistics experiments under Poisson statistics. This provides a stringent test of how well the underlying I(Q) profile can be reconstructed when the available counts are substantially reduced. We further show that, in the counting-limited regime, the reconstruction error follows a universal scaling behaviour that differs from the usual independent-counting expectation. At higher counts, the improvement crosses over to a resolution-limited regime set by analyser-angle discretization and rocking-curve width. These results clarify when correlation-aware inference is useful in USANS and provide a practical basis for improving measurement efficiency and beam-time usage.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗

The structure of tubulin-binding cofactor A from Leishmania major infers a mode of association during the early stages of microtubule assembly

The structure of a tubulin-binding cofactor from L. major is reported and compared with yeast, plant and human orthologues. Tubulin-binding cofactor A (TBCA) participates in microtubule formation, a key process in eukaryotic biology to create the cytoskeleton. There is little information on how TBCA might interact with β-tubulin en route to microtubule biogenesis. To address this, the protozoan Leishmania major was targeted as a model system. The crystal structure of TBCA and comparisons with three orthologous proteins are presented. The presence of conserved features infers that electrostatic interactions that are likely to involve the C-terminal tail of β-tubulin are key to association. This study provides a reagent and template to support further work in this area.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Sparse Deep Neural Network Inference using different Programming Models

Sparse deep neural networks have gained increasing attention recently in achieving speedups on inference with reduced memory footprints. However, the real-world applications are little shown with specialized optimizations, yet a wide variety of DNN tasks remain dense without exploiting the advantages of sparsity in networks. Recent work presented by MIT/IEEE/Amazon GraphChallenge has demonstrated significant speedups and various techniques. Still, we find that there is limited investigation of the impact of various Python and C\slash C++ based programming models to explore new opportunities in general cases. In this work, we provide performance evaluation through different programming models using CuPy, cuSPARSE, and OpenMP to discuss the advantages and disadvantages of our sparse implementations on single-GPU and multiple GPUs of NVIDIA DGX-A100 40GB/80GB platforms.

machine learning, HPC↗

Distributed-Memory Sparse Deep Neural Network Inference Using Global Arrays

Partitioned Global Address Space (PGAS) models exhibit tremendous promise in developing efficient and productive distributed-memory parallel applications. They have been used extensively in scientific computations due to conveniently offering a ``shared-memory''-like model and convenient interfaces that separate communication with synchronization. Traditionally, PGAS communication models have been applied to dense/contiguously distributed data, but most modern applications depict varied levels of sparsity. Existing PGAS models require certain adaptations to support distributed sparse computations, since associated computations often require matrix arithmetic, in addition to data movement. The Global Arrays toolkit from Pacific Northwest National Laboratory (PNNL) is one of the earliest PGAS models to combine one-sided data communication and distributed matrix operations and is still used in the popular NWChem quantum chemistry suite. Recently, we have expanded the Global Arrays toolkit to support common sparse operations, like sparse matrix-dense matrix multiplies (SpMM), sparse matrix-sparse matrix multiplication (SpGEMM) and Sampled Dense-Dense Matrix Multiplication (SDDMM). As it turns out, these operations are the bedrock of sparse Deep Learning (DL); sparse deep neural networks and Graph Neural Networks (GNNs) have gained increasing attention recently in achieving speedups on training and inference with reduced memory footprints. Unlike scientific applications in High Performance Computing (HPC), modern (distributed-memory capable) DL toolkits often rely on non-standardized and closed-source vendor software optimizations, creating challenges in software-hardware co-design at scale. Our goal is to support a variety of distributed-memory sparse matrix operations and helper functions in the newly created Sparse Global Arrays (SGA), such that it is possible to build portable and productive Machine Learning scenarios for algorithm/software and hardware codesign purposes. Contemporary data-parallel schemes for training/inference are undergoing a major overhaul since model replication limits scalability and causes resource inefficiencies. As such, we have adopted tensor parallelism in decomposing the model and inputs, to mitigate memory issues. Current implementation is built on top of MPI and uses CPUs to maximize the portability across the platforms.

Distributed computing, machine learning↗

AutoReP: Automatic ReLU Replacement for Fast Private Network Inference

The proliferation of the Machine-Learning-As-A-Service (MLaaS) market has brought to light a number of clients’ data privacy and security concerns. One promising solution is private inference (PI) techniques using cryptographic primitives. These techniques often come with high computation and communication overhead associated with the non-linear operator such as ReLU. Several approaches have been developed in reducing the number of ReLU operations, however, they either require a heuristic threshold selection or introduce significant accuracy drop. This work presents AutoReP, a gradient-based framework for non-linear operators reduction that aims to mitigate these concerns from a systematic perspective. AutoReP automates the process of discrete selection of ReLU and polynomial functions on neurons to accelerate PI applications. We also introduce distribution-aware polynomial approximation (DaPa) to accurately approximate ReLUs under given distribution, preserving model expressivity. Our experimental results demonstrate significant accuracy improvements of 6.12% (94.31%, 12.9K ReLU budget, CIFAR-10), 8.39% (74.92%, 12.9K ReLU budget, CIFAR-100), and 9.45% (63.69%, 55K ReLU budget, Tiny-ImageNet) over current state-of-the-art methods, e.g., SNL. Morever, AutoReP is applied to EfficientNet-B2 on ImageNet dataset, and achieved 75.55% accuracy with 176.1 × ReLU budget reduction.

Peng, Hongwu↗

Modular Semantic Tagging of Medline Abstracts and its Use in Inferring Regulatory Networks

We describe MedstractPlus, a resource for mining relations from the Medline bibliographic database that is currently under construction. It was built on the remains of Medstract, a previously created resource that included a biorelation server and an acronym database. MedstractPlus uses simple and scalable natural language processing modules to structure text, is designed with reusability and extendibility in mind, and adheres to the philosophy of the Linguistic Annotation Framework. We show how MedstractPlus has been used to provide seeds for a novel approach to inferring transcriptional regulatory networks from gene expression data.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluating In-Clique and Topological Parallelism Strategies for Junction Tree-Based Bayesian Inference Algorithm on the Cray XMT

Long viewed as a strong statistical inference technique, Bayesian networks have emerged to be an important class of applications for high-performance computing. We have applied an architecture-conscious approach to parallelizing the Lauritzen-Spiegelhalter Junction Tree algorithm for exact inferencing in Bayesian networks. In optimizing the Junction Tree algorithm, we have implemented both in-clique and topological parallelism strategies to best leverage the fine-grained synchronization and massive-scale multithreading of the Cray XMT architecture. Two topological techniques were developed to parallelize the evidence propagation process through the Bayesian network. One technique involves performing intelligent scheduling of junction tree nodes based on its topology and relative size. The second technique involves decomposing the junction tree into a much finer tree-like representation to offer much more opportunities for parallelism. We evaluate these optimizations on five different Bayesian networks and report our findings and observations. Another important contribution of this paper is to demonstrate the application of massive-scale multithreading for load balancing and use of implicit parallelism-based compiler optimizations in designing scalable inferencing algorithms.

99 GENERAL AND MISCELLANEOUS↗

Topology Inference of Unknown Networks Based on Robust Virtual Coordinate Systems

Learning and exploring the connectivity of unknown networks represent an important problem in practical applications of communication networks and social-media networks. Modeling large-scale networks as connected graphs is highly desirable to extract their connectivity information among nodes to visualize network topology, disseminate data, and improve routing efficiency. This paper investigates a simple measurement model in which a small subset of source nodes collect hop distance information from networked nodes in order to generate a virtual coordinate system (VCS) for networks of unknown topology. We establish the VCS to define logical distance among nodes based on principal component analysis and to determine connectivity relationship and effective routing methods. More importantly, we present a robust analytical algorithm to derive the VCS against practical issues of missing and corrupted measurements. We also develop a connectivity inference method which classifies nodes into layers based on the hop distances and derives partial information on network connectivity.

97 MATHEMATICS AND COMPUTING↗

Inferring the Dynamics of the State Evolution During Quantum Annealing

To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer, which then returns a user-specified number of low-energy solutions. It would be useful to know what happens in the quantum processor during the anneal process so that one could design better algorithms or suggest improvements to the hardware. However, existing quantum annealers are not able to directly extract such information from the processor. Hence, in this work we propose to use advanced features of D-Wave 2000Q to indirectly infer information about the dynamics of the state evolution during the anneal process. Specifically, D-Wave 2000Q allows the user to customize the anneal schedule, that is, the schedule with which the anneal fraction is changed from the start to the end of the anneal. Furthermore, using this feature, we design a set of modified anneal schedules whose outputs can be used to generate information about the states of the system at user-defined time points during a standard anneal. With this process, called "slicing", we obtain approximate distributions of lowest-energy anneal solutions as the anneal time evolves. We use our technique to obtain a variety of insights into the annealer, such as the state evolution during annealing, when individual bits in an evolving solution flip during the anneal process and when they stabilize, and we introduce a technique to estimate the freeze-out point of both the system as well as of individual qubits.

42 ENGINEERING↗

Distributed Inference with Sparse and Quantized Communication

Here, we consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just 1 bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate.

42 ENGINEERING↗

Inferring Reliability Model Parameters from Expert Opinion

Here, we propose a method for constructing bathtub models of reliability from opinion. The method is intended for reliability studies early in the design and prototyping of a new system, before data concerning reliability has become available. A stylized bathtub curve is presented for soliciting best engineering judgement from technical experts. By pooling these stylized curves, we produce data that can be used to infer parameters for a piece-wise Weibull model of reliability. A numerical example demonstrates the practicality of the method while also highlighting potential pitfalls when working with subjective data.

42 ENGINEERING↗

Inference for Nonparanormal Partial Correlation via Regularized Rank-Based Nodewise Regression

Abstract Partial correlation is a common tool in studying conditional dependence for Gaussian distributed data. However, partial correlation being zero may not be equivalent to conditional independence under non-Gaussian distributions. In this paper, we propose a statistical inference procedure for partial correlations under the high-dimensional nonparanormal (NPN) model where the observed data are normally distributed after certain monotone transformations. The NPN partial correlation is the partial correlation of the normal transformed data under the NPN model, which is a more general measure of conditional dependence. We estimate the NPN partial correlations by regularized nodewise regression based on the empirical ranks of the original data. A multiple testing procedure is proposed to identify the nonzero NPN partial correlations. The proposed method can be carried out by a simple coordinate descent algorithm for lasso optimization. It is easy-to-implement and computationally more efficient compared to the existing methods for estimating NPN graphical models. Theoretical results are developed to show the asymptotic normality of the proposed estimator and to justify the proposed multiple testing procedure. Numerical simulations and a case study on brain imaging data demonstrate the utility of the proposed procedure and evaluate its performance compared to the existing methods. Data used in preparation of this article were obtained from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database.

97 MATHEMATICS AND COMPUTING↗