Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Learning with errors”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

An Assessment of the Error Due to Computing Waste Isolation Pilot Plant Porosity Using the Porosity Response Surface Approach

The Waste Isolation Pilot Plant Performance Assessment (WIPP PA) must predict the likelihood that radionuclides will escape into the biosphere via mechanisms that depend on geohydraulic flow. Ideally, one would predict the geohydraulic flow using coupled geohydraulic and geomechanical simulations, but such coupled simulations are not computationally tractable. Instead, Sandia has historically used a look-up table of porosities for a given fluid pressure and time, called the porosity response surface, but this approach can introduce porosity errors because it largely ignores the porosity’s dependence on the past fluid pressure history. This report discusses efforts to quantify these porosity errors for both the legacy and new porosity response surfaces. Six hundred different fluid pressure histories were fed through the legacy/new geomechanical model and the legacy/new porosity response surface to generate six hundred porosity error histories. The error associated with the legacy porosity surface was substantial, while the error associated with the new porosity surface was typically small, except when fluid pressures exceeded the lithostatic pressure at the repository. In response to the errors at high pressures, a preliminary study of the WIPP PA’s sensitivity to these porosity errors was conducted. The study found that reducing the porosity errors at high pressures negligibly affected predictions of radionuclide releases. Finally, an initial machine-learned model for porosity was developed. This ML model significantly reduced the porosity error at high pressures, but sizable errors remained, so more development is necessary before coupling an ML model to the geohydraulic model.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

A physics-based ensemble machine-learning approach to identifying a relationship between lightning indices and binary lightning hazard

To convert lightning indices generated by numerical weather prediction experiments into binary lightning hazard, a machine-learning tool was developed. This tool, consisting of parallel multilayer perceptron classifiers, was trained on an ensemble of planetary boundary layer schemes and microphysics parameterizations that generated four different lightning indices over 1 week. In a subsequent week, the multi-physics ensemble was applied and the machine-learning tool was used to evaluate the accuracy. Unintuitively, the machine-learning tool performed better on the testing dataset than the training dataset. Much of the error may be attributed to mischaracterizing the convection. The combination of the machine learning model and simulations could not differentiate between cloud-to-cloud lightning and cloud-to-ground lightning, despite being trained on cloud-to-ground lightning. It was found that the simulation most representative of the local operational model was the most accurate simulation tested.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Convex Q-Learning in Continuous Time with Application to Dispatch of Distributed Energy Resources

Convex Q-learning is a recent approach to reinforcement learning, motivated by the possibility of a firmer theory for convergence, and the possibility of making use of greater a priori knowledge regarding policy or value function structure. This paper explores algorithm design in the continuous time domain, with a finite-horizon optimal control objective. The main contributions are (i) The new Q-ODE: a model-free characterization of the Hamilton-Jacobi-Bellman equation. (ii) A formulation of Convex Q-learning that avoids approximations appearing in prior work. The Bellman error used in the algorithm is defined by filtered measurements, which is necessary in the presence of measurement noise. (iii) Convex Q-learning with linear function approximation is a convex program. It is shown that the constraint region is bounded, subject to an exploration condition on the training input. (iv) The theory is illustrated in application to resource allocation for distributed energy resources, for which the theory is ideally suited.

Lu, Fan↗
DOE OSTI2024

Heisenberg-limited Hamiltonian learning for interacting bosons

We develop a protocol for learning a class of interacting bosonic Hamiltonians from dynamics with Heisenberg-limited scaling. For Hamiltonians with an underlying bounded-degree graph structure, we can learn all parameters with root mean square error ϵ using ${\mathcal{O}}(1/\epsilon )$ total evolution time, which is independent of the system size, in a way that is robust against state-preparation and measurement error. In the protocol, we only use bosonic coherent states, beam splitters, phase shifters, and homodyne measurements, which are easy to implement on many experimental platforms. A key technique we develop is to apply random unitaries to enforce symmetry in the effective Hamiltonian, which may be of independent interest.

computer science↗
DOE OSTI2021

Advances in the electron diffraction characterization of atomic clusters and nanoparticles

Nanoparticles and metallic clusters continue to make a remarkable impact on novel and emerging technologies. In recent years, there have been impressive advances in the controlled synthesis of clusters and their advanced characterization. One of the most common ways to determine the structures of nanoparticles and clusters is by means of X-ray diffraction methods. However, this requires the clusters to crystallize in a similar way to those used in protein studies, which is not possible in many cases. Novel methods based on electron diffraction have been used to efficiently study individual nanoparticles and clusters and these can overcome the obstacles commonly encountered during X-ray diffraction methods without the need for large crystals. These novel methodologies have improved with advances in electron microscopy instrumentation and electron detection. Here, we review advanced methodologies for characterizing metallic nanoparticles and clusters using a variety of electron diffraction procedures. These include selected area electron diffraction, nanobeam diffraction, coherent electron diffraction, precession electron diffraction, scanning transmission electron microcopy diffraction, and high throughput data analytics, which leverage deep learning to reduce the propensity for data errors and translate nanometer and atomic scale measurements into material data.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2024

Training self-learning circuits for power-efficient solutions

As the size and ubiquity of artificial intelligence and computational machine learning models grow, the energy required to train and use them is rapidly becoming economically and environmentally unsustainable. Recent laboratory prototypes of self-learning electronic circuits, such as “physical learning machines,” open the door to analog hardware that directly employs physics to learn desired functions from examples at a low energy cost. In this work, we show that this hardware platform allows for an even further reduction in energy consumption by using good initial conditions and a new learning algorithm. Using analytical calculations, simulations, and experiments, we show that a trade-off emerges when learning dynamics attempt to minimize both the error and the power consumption of the solution—greater power reductions can be achieved at the cost of decreasing solution accuracy. Finally, we demonstrate a practical procedure to weigh the relative importance of error and power minimization, improving the power efficiency given a specific tolerance to error.

Stern, Menachem (ORCID:0000000302158082)↗
DOE OSTI2026

Hyperdimensional computing for image classification (HDC) v1.0

This is an implementation of the hyperdimensional computing technique to classify images. It consists of a python script that trains the system for a set of images from a set of images (dataset) specified by the user. This training produces hardware configuration parameters and description vectors that are then loaded into the hardware description part of the project. The hardware description consists of hardware described in Verilog (a well known language for this purpose) that is synthesizable and can be implemented in a real chip. This hardware received the training information generated by python, and then is able to accept images to produce answers for each image on which category (class) from the pre-=trained ones the image belongs to. The hardware and python training scripts are configurable and documented. The advantage of hyperdimensional computing is its robustness to errors and the easy capability for online learning (refining the training during inference slowly over time), which this implementation supports.

Michelogiannakis, Georgios [Lawrence Berkeley Nati↗
DOE OSTI2024

Group-theoretic error mitigation enabled by classical shadows and symmetries

Abstract Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. To address these challenges simultaneously, we develop a quantum error-mitigation strategy called symmetry-adjusted classical shadows , by adjusting classical-shadow tomography according to how symmetries are corrupted by device errors. As a concrete example, we highlight global U(1) symmetry, which manifests in fermions as particle number and in spins as total magnetization, and illustrate their group-theoretic unification with respective classical-shadow protocols. We establish rigorous sampling bounds under readout errors obeying minimal assumptions, and perform numerical experiments with a more comprehensive model of gate-level errors derived from existing quantum processors. Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.

Zhao, Andrew (ORCID:0000000202990277)↗
DOE OSTI2023

Criticality Experiments to Reduce Compensating Errors in Plutonium Nuclear Data

Compensating errors between nuclear data observables in a library can adversely impact application simulations. The primary goal of the EUCLID project (Experiments Underpinned by Computational Learning for Improvements in Nuclear Data) is to reduce compensating errors in nuclear data. A new criticality experiment, described in this work, was designed with the specific target nuclear data of 239 Pu fission, inelastic scattering, elastic scattering, capture, nu-bar, and prompt fission neutron spectrum (PFNS). This work will focus on the design and execution of the EUCLID experiment, performed on the Planet vertical lift critical assembly machine at the National Criticality Experiments Research Center (NCERC). The criticality experiment includes two different configurations with very different geometries: one is cube-like to minimize neutron leakage while the other is slab-like to maximize leakage. Having these two widely varying configurations allows the scattering sensitivities of 239 Pu to the neutron multiplication factor to be greatly changed while minimally impacting the other cross section sensitivities. Both configurations utilize the Pu ZPPR (Zero Power Physics Reactor) plates as fuel. The experiments were designed using a D-Optimality criteria, which is an optimization method minimizing the log-determinant of the adjusted nuclear data covariance for the target reactions. These experiments include not only inference of k eff , as done in all critical benchmark experiments, but several other responses as well, such as neutron multiplication measurements and reaction rate ratios. After analysis of the measured data is complete, adjustment of nuclear data will be performed to assess whether the new experimental data successfully reduced compensating errors.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Physics-assisted generative adversarial network for X-ray tomography

X-ray tomography is capable of imaging the interior of objects in three dimensions non-invasively, with applications in biomedical imaging, materials science, electronic inspection, and other fields. The reconstruction process can be an ill-conditioned inverse problem, requiring regularization to obtain satisfactory results. Recently, deep learning has been adopted for tomographic reconstruction. Unlike iterative algorithms which require a distribution that is known a priori , deep reconstruction networks can learn a prior distribution through sampling the training distributions. In this work, we develop a Physics-assisted Generative Adversarial Network (PGAN), a two-step algorithm for tomographic reconstruction. In contrast to previous efforts, our PGAN utilizes maximum-likelihood estimates derived from the measurements to regularize the reconstruction with both known physics and the learned prior. Compared with methods with less physics assisting in training, PGAN can reduce the photon requirement with limited projection angles to achieve a given error rate. The advantages of using a physics-assisted learned prior in X-ray tomography may further enable low-photon nanoscale imaging.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Visualization Quality Assessment

Understanding how inaccuracies in visualizations affect users’ perception and understanding of scientific data is hard. Inaccuracies in visualizations are quite common and could arise from a range of sources such as errors in the original dataset arising from compression artifacts, errors in the capturing device, noise during transmission of the data, effects due to the algorithm being used to convert data to visualization images, images generated from neural networks, and sources we have yet to discover. Many image quality assessment metrics have been developed to quantify image errors. However, these are usually focused on “natural images” rather than visualizations of scientific data. Common image quality assessment metrics (IQAs) include MSE, PSNR, perceptual metrics such SSIM, FSIM as well as perceptual metrics using deep learning approaches. However, a critical part of understanding how errors are perceived by humans, and subsequently developing more accurate quality assessment metrics, is through user evaluation studies. The goal of this software is to develop a visualization quality assessment (VQA) process that will enable the generation of VQAs that can be used to quantify errors in scientific data visualizations. The VQA development process will include software to support user evaluation experimental design, analysis of visualization differences against standard quality metrics, and the ability to develop additional VQA metrics specific to scientific visualization images.

Grosset, Andre↗
DOE OSTI2021

Constraints on Neutrino Oscillation Parameters from Neutrinos and Antineutrinos with Machine Learning

NOvA is a two detector, long baseline neutrino oscillation experiment measuring the oscillations of muon neutrinos from the \numi neutrino beam over a baseline of \SI{810}{km}. The experiment uses four oscillation channels, $\numu \rightarrow \numu$, $\numubar \rightarrow \numubar$, $\numu \rightarrow \nue$, and $\numubar \rightarrow \nuebar$, with a peak neutrino energy of \SI{1.8}{GeV}. This dissertation describes the analysis of these channels using a dataset of $13.6\times10^{20}$ protons on target neutrino beam mode and $12.5\times10^{20}$ protons on target antineutrino beam mode. The analysis makes use of improvements in the treatment of systematic uncertainties and machine learning techniques to reconstruct neutrino interactions. A technique for decorrelating systematic errors using principle component analysis was utilized to reduce and optimize neutrino cross section and beam related uncertainties. The improved machine learning algorithms make use of convolutional ne ural net works for neutrino event classification, particle classification, and instance segmentation. The selection of neutrino signal events utilizing the neutrino event classifier shows an efficiency of 63\% for the selection of electron neutrinos in neutrino beam mode and 75\% for electron antineutrinos in antineutrino beam mode. Using this algorithm, 82 appearing electron neutrino candidates and 33 appearing electron antineutrino candidates were observed with expected backgrounds of 26.8 and 14.0 respectively. In addition, 211 surviving muon neutrino candidates and 105 muon antineutrino candidates were identified with a purity of more than 96\% using the same neutrino event classifier. Fitting these data to the three flavor neutrino oscillation model, using constraints on \thetaonetwo, \thetaonethree, and \dmsqonetwo from solar and reactor neutrino experiments, the oscillation parameters are measured to be $\sintwothree = 0.57^{+0.04}_{-0.03}$, $\dmsqthreetwo = \SI[parse-numbers= false]{+ 2.41\pm0.07 \times 10^{-3}}{eV^2}$, and $\dcp=0.82^{+0.27}_{-0.87}\pi$ with a preference for the normal neutrino mass hierarchy. Leading systematic uncertainties for these measurements come from detector calibration and neutrino interaction models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

AI-Driven Crack Detection for Remanufacturing Cylinder Heads Using Deep Learning and Engineering-Informed Data Augmentation

Detecting cracks in cylinder heads traditionally relies on manual inspection, which is time-consuming and susceptible to human error. As an alternative, automated object detection utilizing computer vision and machine learning models has been explored. However, these methods often face challenges due to a lack of sufficiently annotated training data, limited image diversity, and the inherently small size of cracks. Addressing these constraints, this paper introduces a novel automated crack-detection method that enhances data availability through a synthetic data generation technique. Unlike general data augmentation practices, our method involves copying cracks from one location to another, guided by both random and informed engineering decisions about likely crack formations due to cyclic thermomechanical loads. The innovative aspect of our approach lies in the integration of domain-specific engineering knowledge into the synthetic generation process, which substantially improves detection accuracy. We evaluate our method’s effectiveness using two metrics: the F2 score, which emphasizes recall to prioritize detecting all potential cracks, and mean average precision (MAP), a standard measure in object detection. Experimental results demonstrate that, without engineering insights, our method increases the F2 score from 0.40 to 0.65, while maintaining a stable MAP. Incorporating detailed engineering knowledge further enhances the F2 score to 0.70 and improves MAP to 0.57, representing increases of 63% and 43%, respectively. These results confirm that our approach not only mitigates the limitations of traditional data augmentation but also significantly advances the reliability and precision of crack detection in industrial settings.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Quantum circuit fidelity estimation using machine learning

The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the computation has been performed. In this work, we introduce a machine learning-based technique to estimate the fidelity between the state produced by a noisy quantum circuit and the target state corresponding to ideal noise-free computation. Our machine learning model is trained in a supervised manner, using smaller or simpler circuits for which the fidelity can be estimated using other techniques like direct fidelity estimation and quantum state tomography. Here we demonstrate that, for simulated random quantum circuits with a realistic noise model, the trained model can predict the fidelities of more complicated circuits for which such methods are infeasible. In particular, we show that the trained model may make predictions for circuits with higher degrees of entanglement than were available in the training set and that the model may make predictions for non-Clifford circuits even when the training set included only Clifford-reducible circuits. This empirical demonstration suggests classical machine learning may be useful for making predictions about beyond-classical quantum circuits for some non-trivial problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Reactivity Coefficient Measurements to Aid in Reducing Compensating Errors in Plutonium Nuclear Data

Compensating errors between several nuclear data observables in a nuclear data library can adversely impact application simulations. The primary goal of the EUCLID project (Experiments Underpinned by Computational Learning for Improvements in Nuclear Data) is to reduce compensating errors between fast (0.1–5 MeV) 239Pu nuclear data for prompt fission neutron spectra (PFNS), average prompt fission neutron multiplicities, and neutron induced fission, capture, elastic, and inelastic cross sections. This work will focus on the design and execution of void reactivity coefficient measurements in the EUCLID experiment, performed on the Planet vertical lift critical assembly machine at the National Criticality Experiments Research Center (NCERC). Two different base configurations were designed and measured, one with high neutron leakage, and one with low neutron leakage. Both were primarily made up of plutonium metal (Zero Power Physics Reactor plates) without interstitial moderators and reflected by half-inch aluminum. Design optimization showed that void reactivity coefficient measurements in three locations per configuration was most impactful to reduce nuclear data uncertainties due to the varying impacts from elastic and inelastic scattering, as well as fission and capture. The locations for measurements were chosen based on preliminary studies which balanced measurement uncertainty and measurement practicality. The measurements were also selected to have sensitivities maximally complementary to previous arrangements. Comparisons across nuclear data libraries highlight the potential impact.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

LAF-Net: A Deep Residual and Cross-Attention Framework for Day-Ahead Load Forecasting: Preprint

Accurate day-ahead load forecasting is essential for reliable power system operations and market efficiency. System operators such as the Midcontinent Independent System Operator (MISO) rely on forecasts from multiple vendors, yet combining them effectively remains a persistent challenge due to vendor-specific biases. This paper presents a novel LSTM-Attention Fusion Network with Error Representation (LAF-Net) that enhances day-ahead hourly load forecasting through deep residual learning and multi-modal cross-attention. The proposed model builds a historical error memory from past vendor performance and dynamically queries it with future hour context to generate adaptive, hour-specific trust weights for each vendor. A bounded residual correction further refines forecasts by mitigating systematic and temporally localized errors. Tested on real MISO LBA data with multi-vendor forecasts, LAF-Net consistently outperforms the best vendor baseline across all 38 LBAs, achieving more than a 40% reduction in system-level mean absolute error (MAE) during peak load hours relative to the best vendor baseline.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Decision Science for Machine Learning (DeSciML)

The increasing use of machine learning (ML) models to support high-consequence decision making drives a need to increase the rigor of ML-based decision making. Critical problems ranging from climate change to nonproliferation monitoring rely on machine learning for aspects of their analyses. Likewise, future technologies, such as incorporation of data-driven methods into the stockpile surveillance and predictive failure analysis for weapons components, will all rely on decision-making that incorporates the output of machine learning models. In this project, our main focus was the development of decision scientific methods that combine uncertainty estimates for machine learning predictions, with a domain-specific model of error costs. Other focus areas include uncertainty measurement in ML predictions, designing decision rules using multiobjecive optimization, the value of uncertainty reduction, and decision-tailored uncertainty quantification for probability estimates. By laying foundations for rigorous decision making based on the predictions of machine learning models, these approaches are directly relevant to every national security mission that applies, or will apply, machine learning to data, most of which entail some decision context.

97 MATHEMATICS AND COMPUTING↗