Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Noisy data”

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 145 records · Page 8

Improved information criteria for Bayesian model averaging in lattice field theory

Bayesian model averaging is a practical method for dealing with uncertainty due to model specification. Use of this technique requires the estimation of model probability weights. Here, we revisit the derivation of estimators for these model weights. Use of the Kullback-Leibler divergence as a starting point leads naturally to a number of alternative information criteria suitable for Bayesian model weight estimation. We explore three such criteria, known to the statistics literature before, in detail: a Bayesian analog of the Akaike information criterion which we call the BAIC, the Bayesian predictive information criterion, and the posterior predictive information criterion (PPIC). We compare the use of these information criteria in numerical analysis problems common in lattice field theory calculations. We find that the PPIC has the most appealing theoretical properties and can give the best performance in terms of model-averaging uncertainty, particularly in the presence of noisy data, while the BAIC is a simple and reliable alternative.

97 MATHEMATICS AND COMPUTING↗

Extracting forces from noisy dynamics in dusty plasmas

Extracting environmental forces from noisy data is a common yet challenging task in complex physical systems. Machine learning (ML) represents a robust approach to this problem, yet is mostly tested on simulated data with known parameters. Here we use supervised ML to extract the electrostatic, dissipative, and stochastic forces acting on micron-sized charged particles levitated in an argon plasma (dusty plasma). By tracking the sub-pixel motion of particles in subsequent images, we successfully estimated these forces from their random motion. The experiments contained important sources of non-Gaussian noise, such as drift and pixel-locking, representing a data mismatch from methods used to analyze simulated data with purely Gaussian noise. Our model was trained on simulated particle trajectories that included all of these artifacts, and used more than 100 dynamical and statistical features, resulting in a prediction with 50\% better accuracy than conventional methods. Lastly, in systems with two interacting particles, the model provided non-contact measurements of the particle charge and Debye length in the plasma environment.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

LaueMatching: an approach for rapid and robust indexing of Laue diffraction patterns

Traditional Laue diffraction pattern indexing often struggles with noisy data, weak signals, peak overlap and missing reflections, particularly from complex or deformed microstructures. Here, we introduce LaueMatching, a high-throughput indexing algorithm designed to overcome these limitations. LaueMatching utilizes a fundamentally different approach based on direct pattern correlation: experimentally pre-processed images are compared against a comprehensive pre-computed library of simulated diffraction patterns corresponding to a dense grid of possible orientations. This approach bypasses the need for explicit peak identification and fitting, steps that are often a failure point for traditional methods. The algorithm rapidly and robustly indexes multiple crystallographic orientations and crystal systems simultaneously, even from challenging patterns. LaueMatching's effectiveness and accuracy have been rigorously tested and validated on diverse experimental (Ni, Al, EuAl 2 O 4 ) and simulated diffraction patterns, demonstrating high-fidelity orientation refinement. Code to implement this approach on both CPU and GPU resources can be downloaded from https://github.com/AdvancedPhotonSource/LaueMatching.

36 MATERIALS SCIENCE↗

WinnowML: Stable feature selection for maximizing prediction accuracy of time-based system modeling

Online deep learning (ODL) has become an important methodology for modeling time-based performance of computer systems. An open problem is the intelligent selection of features from raw workload traces of computer systems. The best methods are overly sensitive to noisy data, causing frequent feature changes and re-training. Using all available features inflates training time and introduces model artifacts if some features should have been dropped. We present WinnowML, a method for automatically determining the most relevant feature subset for a predictive time-series model. WinnowML combines existing feature ranking algorithms and a history of each feature's ranking to iteratively rank a feature set to lower prediction error and maximize long term relevance. From this ranked feature set, the most relevant and stable subset is selected to train a model. Experimentally, we show how WinnowML can lower a model's mean absolute relative error up to 42% on average compared to the closest performing approach. Additionally, we lower the fluctuation in feature ranking and selection up to 65%. We also demonstrate how to combine WinnowML and a model search tool to provide improvements in performance of up to 14.5% when compared to using all the feature available.

Bel, Oceane MS↗

Application of Markov Chain Monte Carlo Methods for Uncertainty Quantification in Inverse Transport Problems

Determination of the components of a radioactive source/shield system using the system’s radiation signature is of great importance in homeland security, material safeguards, and waste management. Although significant progress has been made toward solving this inverse transport problem in recent years, work remains to be done to quantify the uncertainty in reconstructed results. In this article we apply two Markov chain Monte Carlo (MCMC) approaches, the delayed rejection adaptive metropolis (DRAM) and differential evolution adaptive metropolis (DREAM) methods, to solve inverse problems and quantify uncertainty. The DRAM method uses delayed rejection combined with global adaptation of the proposal covariance matrix. Furthermore, the DREAM method hybridizes MCMC sampling with the differential evolution (DE) algorithm. In numerical test cases, the DRAM and DREAM methods are shown to be superior to a first-order inverse Hessian approach for problems with noisy data and multiple unknown quantities, with DREAM converging to the posterior distribution more quickly than DRAM. The DREAM and DRAM results indicate that a full posterior distribution is required to quantify uncertainty in many inverse transport problems.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Physics-Informed Neural Networks for Heat Transfer Problems

Abstract Physics-informed neural networks (PINNs) have gained popularity across different engineering fields due to their effectiveness in solving realistic problems with noisy data and often partially missing physics. In PINNs, automatic differentiation is leveraged to evaluate differential operators without discretization errors, and a multitask learning problem is defined in order to simultaneously fit observed data while respecting the underlying governing laws of physics. Here, we present applications of PINNs to various prototype heat transfer problems, targeting in particular realistic conditions not readily tackled with traditional computational methods. To this end, we first consider forced and mixed convection with unknown thermal boundary conditions on the heated surfaces and aim to obtain the temperature and velocity fields everywhere in the domain, including the boundaries, given some sparse temperature measurements. We also consider the prototype Stefan problem for two-phase flow, aiming to infer the moving interface, the velocity and temperature fields everywhere as well as the different conductivities of a solid and a liquid phase, given a few temperature measurements inside the domain. Finally, we present some realistic industrial applications related to power electronics to highlight the practicality of PINNs as well as the effective use of neural networks in solving general heat transfer problems of industrial complexity. Taken together, the results presented herein demonstrate that PINNs not only can solve ill-posed problems, which are beyond the reach of traditional computational methods, but they can also bridge the gap between computational and experimental heat transfer.

Engineering↗

Stealthy Cyber Anomaly Detection On Large Noisy Multi-material 3D Printer Datasets Using Probabilistic Models

As Additive Layer Manufacturing (ALM) becomes pervasive in industry, its applications in safety critical component manufacturing are being explored and adopted. However, ALM's reliance on embedded computing renders it vulnerable to tampering through cyber-attacks. Sensor instrumentation of ALM devices allows for rigorous process and security monitoring, but also results in a massive volume of noisy data for each run. As such, in-situ, near-real-time anomaly detection is very challenging. The ideal algorithm for this context is simple, computationally efficient, minimizes false positives, and is accurate enough to resolve small deviations. In this paper, we present a probabilistic-model-based approach to address this challenge. To test our approach, we analyze current measurements from a polymer composite 3D printer during emulated tampering attacks. Our results show that our approach can consistently and efficiently locate small changes in the presence of substantial operational noise.

Yoginath, Srikanth↗

Dynamical Components Analysis (DCA) v1.0.0

Dynamical Components Analysis is a Python implementation of the method described in "Unsupervised discovery of temporal structure in noisy data with dynamical components analysis". It implements the method as well as related data analysis functions.

Livezey, Jesse↗

Dynamical Components Analysis (DCA) v1.0.0

Dynamical Components Analysis is a Python implementation of the method described in "Unsupervised discovery of temporal structure in noisy data with dynamical components analysis". It implements the method as well as related data analysis functions.

Livezey, Jesse↗

Evidential Deep Learning: Enhancing Predictive Uncertainty Estimation for Earth System Science Applications

Abstract Robust quantification of predictive uncertainty is a critical addition needed for machine learning applied to weather and climate problems to improve the understanding of what is driving prediction sensitivity. Ensembles of machine learning models provide predictive uncertainty estimates in a conceptually simple way but require multiple models for training and prediction, increasing computational cost and latency. Parametric deep learning can estimate uncertainty with one model by predicting the parameters of a probability distribution but does not account for epistemic uncertainty. Evidential deep learning, a technique that extends parametric deep learning to higher-order distributions, can account for both aleatoric and epistemic uncertainties with one model. This study compares the uncertainty derived from evidential neural networks to that obtained from ensembles. Through applications of the classification of winter precipitation type and regression of surface-layer fluxes, we show evidential deep learning models attaining predictive accuracy rivaling standard methods while robustly quantifying both sources of uncertainty. We evaluate the uncertainty in terms of how well the predictions are calibrated and how well the uncertainty correlates with prediction error. Analyses of uncertainty in the context of the inputs reveal sensitivities to underlying meteorological processes, facilitating interpretation of the models. The conceptual simplicity, interpretability, and computational efficiency of evidential neural networks make them highly extensible, offering a promising approach for reliable and practical uncertainty quantification in Earth system science modeling. To encourage broader adoption of evidential deep learning, we have developed a new Python package, Machine Integration and Learning for Earth Systems (MILES) group Generalized Uncertainty for Earth System Science (GUESS) (MILES-GUESS) ( https://github.com/ai2es/miles-guess ), that enables users to train and evaluate both evidential and ensemble deep learning. Significance Statement This study demonstrates a new technique, evidential deep learning, for robust and computationally efficient uncertainty quantification in modeling the Earth system. The method integrates probabilistic principles into deep neural networks, enabling the estimation of both aleatoric uncertainty from noisy data and epistemic uncertainty from model limitations using a single model. Our analyses reveal how decomposing these uncertainties provides valuable insights into reliability, accuracy, and model shortcomings. We show that the approach can rival standard methods in classification and regression tasks within atmospheric science while offering practical advantages such as computational efficiency. With further advances, evidential networks have the potential to enhance risk assessment and decision-making across meteorology by improving uncertainty quantification, a longstanding challenge. This work establishes a strong foundation and motivation for the broader adoption of evidential learning, where properly quantifying uncertainties is critical yet lacking.

Schreck, John S.↗

Removing Noise in BPM Measurements with Variational Autoencoders

Noise in beam measurements is an ever-present challenge in accelerator operations. In addition to the challenges presented by hardware and signal processing, new operational regimes, such as ultra-short bunches, create additional difficulties in routine beam measurements. Techniques in machine learning have been successfully applied in other domains to overcome challenges inherent in noisy data. Variational autoencoders (VAEs) are shown to be capable of removing significant leevels of noise. A VAE can be used as a pre-processing tool for noise removal before the de-noised data is analyzed via other methods, or the VAE can be directly used to make beam dynamics measurements. Here we present the use of VAEs as a tool for addressing noise in BPM measurements.

43 PARTICLE ACCELERATORS↗

Multichannel Deconvolution of Vibrational Shock Signals: An Inverse Filtering Approach

When transporting critical systems of national security interest, out-of-the ordinary, impulsive events that can potentially be undetected and affect overall system performance are of great concern. Impulsive events that can occur are essentially pulse-like, transient signals of short duration that evolve from various phenomena. Here the event can be created by either the dropping of a test object, the system, subjecting it to a compact high-energy blow or being struck unintentionally during transit resulting in potential damage. The intensity and location of the strike can cause an inoperability condition that is unacceptable in a national security environment. Therefore, it is essential to detect, classify and localize damage of any test object subjected to an impulsive-event. This effort was targeted to evaluate the vibrational response of test objects that are subjected to “transport” shocks and roadway vibrations during shipping and handling. Any potential damage that could be inflicted during transportation must not only be detected, but also be evaluated to determine the operational readiness of a test object before and after transport. This event is a critical task that must be addressed as part of the Lawrence Livermore National Laboratory (LLNL) national security mission. The estimation of excitation signals from noisy data is termed the deconvolution problem in the signal processing literature. The deconvolution problem is based on recovering the input excitation signal from a system characterized by its impulse response sequence. Using this model of the system, an “inverse” representation or filter is developed to remove the system from the measured data and recover the input. Deconvolution techniques have existed for a long-time; however, transient deconvolution presents a few uncommon problems, since the signal has a finite-length time duration resulting in a limited amount of data containing information about the excitation process. The transient is wideband in the frequency domain relative to any measurement sensor implying that the smaller bandwidth sensor system “filters” the excitation eliminating some of its essential information for recovery. This fact, coupled with the filtering effect of the test object itself makes this excitation recovery (deconvolution) problem a challenge for signal processing.

42 ENGINEERING↗

Efficient Signal Processing in BOTDA: Utilizing PCA and PCA-Based Neural Networks for Temperature Monitoring

This work presents a comparative analysis of the various signal processing techniques used in the Brillouin gain spectrum (BGS) peak estimation. Traditional fitting methods such as Lorentzian curve fitting (LCF) are slow and less effective in noisy data. PCA-based methods were tested on the experimental data: A Euclidian distance-based approach, and a probabilistic deep neural network (PDNN) based approach, both using 5 principal components to represent a single BGS. Both methods significantly reduce computational time with respect to LCF, whereas PDNN offers uncertainty insights along with the parameter value. Measuring a range of temperatures, analyzing accuracy, and speed, it can be concluded that PCA trained PDNN outperforms other methods, and appears to be helpful in scenario where large datasets are generated.

Brillouin optical time domain analysis↗

Characterizing and mitigating coherent errors in a trapped ion quantum processor using hidden inverses

Quantum computing testbeds exhibit high-fidelity quantum control over small collections of qubits, enabling performance of precise, repeatable operations followed by measurements. Currently, these noisy intermediate-scale devices can support a sufficient number of sequential operations prior to decoherence such that near term algorithms can be performed with proximate accuracy (like chemical accuracy for quantum chemistry problems). While the results of these algorithms are imperfect, these imperfections can help bootstrap quantum computer testbed development. Demonstrations of these algorithms over the past few years, coupled with the idea that imperfect algorithm performance can be caused by several dominant noise sources in the quantum processor, which can be measured and calibrated during algorithm execution or in post-processing, has led to the use of noise mitigation to improve typical computational results. Conversely, benchmark algorithms coupled with noise mitigation can help diagnose the nature of the noise, whether systematic or purely random. Here, we outline the use of coherent noise mitigation techniques as a characterization tool in trapped-ion testbeds. We perform model-fitting of the noisy data to determine the noise source based on realistic physics focused noise models and demonstrate that systematic noise amplification coupled with error mitigation schemes provides useful data for noise model deduction. Further, in order to connect lower level noise model details with application specific performance of near term algorithms, we experimentally construct the loss landscape of a variational algorithm under various injected noise sources coupled with error mitigation techniques. This type of connection enables application-aware hardware codesign, in which the most important noise sources in specific applications, like quantum chemistry, become foci of improvement in subsequent hardware generations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NSGA-PINN: A Multi-Objective Optimization Method for Physics-Informed Neural Network Training

This paper presents NSGA-PINN, a multi-objective optimization framework for the effective training of physics-informed neural networks (PINNs). The proposed framework uses the non-dominated sorting genetic algorithm (NSGA-II) to enable traditional stochastic gradient optimization algorithms (e.g., ADAM) to escape local minima effectively. Additionally, the NSGA-II algorithm enables satisfying the initial and boundary conditions encoded into the loss function during physics-informed training precisely. We demonstrate the effectiveness of our framework by applying NSGA-PINN to several ordinary and partial differential equation problems. In particular, we show that the proposed framework can handle challenging inverse problems with noisy data.

Lu, Binghang (ORCID:0009000160016632)↗

State estimation with small nonlinearities

A variety of techniques is available for estimating the states of nonlinear dynamic systems from noisy data. The differences among several of these procedures in the presence of small dynamic and observational nonlinearities are investigated. Four discrete estimation algorithms are analyzed. The first is a strictly least square estimator, while the others are recursive algorithms similar to the Kalman filter used for estimating the states of linear systems. A group of analytic expressions is developed for the mean and covariance of the error in each of these estimators so that they may be compared without lengthy Monte Carlo simulations. The covariance expressions show that, to first order, all the estimators have the same covariance. Expressions for the means show that each estimator has a different bias. Several examples are carried out demonstrating that the relative magnitudes of the bias errors in the various estimators can be a strong function of such parameters as initial covariances and number of data points. Under some circumstances, more complicated algorithms can have larger biases than smaller ones.

Conrad, B.↗

A comparison of the effects of small nonlinearities on several estimation schemes.

A variety of techniques are available for estimating the states of nonlinear dynamic systems from noisy data. These procedures are generally equivalent when applied to linear systems. This paper investigates the difference between several of these procedures in the presence of small dynamic and observational nonlinearities. In particular, it examines one least square batch processing algorithm, and three recursive algorithms similar to the Kalman filter. To first order, all the estimators have the same covariance. Expressions for the means, however, show that each estimator has a different bias. The examples presented show that the biases can be a strong function of such parameters as initial covariances and number of data points being considered.

Conrad, B.↗

Parameter estimation using an a posteriori criterion

A procedure for system parameter estimation from noisy data is presented that is based on an a posteriori criterion. It is compared with a maximum likelihood approach for a process-noise case. Both methods yield identical results when the process noise is not modeled.

Bach, R. E., Jr.↗